Aug 2026· International Journal For Multidisciplinary Research· Vol 8· 0 citations· 7 references
Abstract
This paper investigates a single-server time-sharing queueing system with server breakdowns, discouraging arrivals and customer reneging. Customers arrive according to a Poisson process with rate λ while the server is operational. During server breakdowns, the arrival rate is reduced to represent customer discouragement. The server operates under the time-sharing discipline, where all customers in the system receive an equal share of the available service capacity simultaneously. Service times are assumed to be exponentially distributed. The server is subject to random breakdowns and is restored after repair, while customers may abandon the system due to impatience through reneging. The proposed model is analysed using the Continuous-Time Markov Chain (CTMC) approach and the corresponding steady-state balance equations are formulated to obtain the steady-state probability distribution. Several system performance measures, including the expected number of customers in the system, average waiting time, server availability, throughput and reneging probability are derived. Numerical experiments are carried out to examine the effects of arrival rate, breakdown rate, repair rate and reneging rate on system performance. The proposed model provides a useful analytical framework for evaluating time-sharing service systems operating under server interruptions and impatient customer behavior with potential applications in computer systems, communication networks, cloud computing and other shared-resource environments.
This paper studies an N-policy M(λ1,λ2)/G/1 repairable queue in which arrival rates depend on the server state and multiple vacations may be interrupted by a Bernoulli decision. When the queue first reaches N during a vacation, the server interrupts the current vacation with probability p and otherwise completes it. We...
Ya-Xing He, Wen-Qing Wu, Qiong-Lin Liu et al.· Axioms· 0 citations
This work comprises a model with the multiple working vacations, reneging, and change over time of the server
in an individual arrival-batch service queue. The server performs three types of service modes, such as working vacation,
batch service in platform-I, and batch service in platform-II according to (a,c,d) polic...
C. Baburaj, P. Sahana· International Journal of Inn...· 0 citations
This paper investigates the steady‐state performance of an queueing system subject to random and time‐homogeneous partial and complete server breakdowns and develops a structured cost model to account for service, breakdown, and holding costs.
K. Santhi, S. P. B. Murugan, B. Manikandan· Applied Stochastic Models in...· 0 citations
- This paper presents a comprehensive modelling and performance analysis of telecommunication queuing systems using Continuous-Time Markov Chains (CTMCs). The research addresses the stochastic nature of packet arrivals and service processes by developing mathematical representations for classic queuing models: M/M/1, M...
Owoade Praise Oluwapelumi, Ini Adinya, Folorunso Tobi Emmanuel· Iconic research and engineer...· 0 citations
Ticket-based queueing systems are widely adopted in the service industry and government sectors for managing customer flow. In such systems, each arriving customer receives a numbered ticket that indicates the number currently being served. Unlike conventional classical queueing systems, these are governed by ticketing...
Hui-Ling Wang, Jui-Kuo Ma, Tzu-Hsin Liu et al.· Computation· 0 citations
We study a non-stationary state-dependent Hawkes single-server queueing model with both time-varying arrival and service rates, under the first-come first-served discipline. The arrival process is a Hawkes process with a time-varying baseline rate function, and a self-exciting function that depends on the state of the...