Discrete-Time Retrial Queuing Systems with Last-Come-First-Served (LCFS) and First-Come-First-Served (FCFS) Disciplines: Negative Customer Impact and Stochastic Analysis

Abstract

This paper examines a discrete-time retrial queuing system that incorporates negative customers, system breakdowns, and repairs. In this model, an arriving customer has the option to go directly to the server, pushing the currently served customer, if any, to the front of the orbit queue, or to join the orbit based on a First-Come-First-Served (FCFS) discipline. The study also considers negative customers who not only remove the customer currently being served but also cause a server breakdown. An in-depth analysis of the model is conducted using a generating function approach, leading to the determination of the distribution and expected values of the number of customers in the orbit and the entire system. The paper explores the stochastic decomposition law and provides bounds for the difference between the steady-state distribution of this system and a comparable standard system. Recursive formulas for the steady-state distributions of the orbit and the system are developed. Additionally, it is shown that the studied discrete-time system can approximate the M/G/1 continuous-time version of the model. The research includes a detailed examination of the customer’s sojourn time distribution in the orbit and the system, utilizing the busy period of an auxiliary system. The paper concludes with numerical examples that highlight how different system parameters affect various performance characteristics, and a section summarizing the key research contributions.