An M/Ek/1 queueing system with no damage service interruptions

Authors:
Miaomiao Yu;Yinghui Tang;Yonghong Fu;Lemeng Pan
Affiliations:
School of Mathematics & Software Science, Sichuan Normal University, 610068, Chengdu, Sichuan, China and School of Science, Sichuan University of Science and Engineering, 643000, Zigong, Sichuan, ...;School of Mathematics & Software Science, Sichuan Normal University, 610068, Chengdu, Sichuan, China;School of Computer science, Sichuan University of Science and Engineering, 643000, Zigong, Sichuan, China;Department of Mathematics, University of Maryland, College Park, MD 20742, USA
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2011

Citing 4
Cited 0

A single server queue with service interruptions

Queueing Systems: Theory and Applications
A discrete-time retrial queue with negative customers and unreliable server

Computers and Industrial Engineering
An M/G/1 retrial G-queue with preemptive resume and feedback under N-policy subject to the server breakdowns and repairs

Computers & Mathematics with Applications
An M/G/1 queue with second optional service and server breakdowns

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.98

Visualization

Abstract

Motivated by a congestion problem arising in a Chinese hospital, an M/E"k/1 queueing system, where the service process is subject to no damage interruptions has been considered. When the first phase of service is completed, the service process can be interrupted with probability 1-p(0@?p@?1) as a result of the customer leaving the service area to attend to other work. There is a finite space to accommodate the interrupted customers in the queueing system. When the other work is completed, the customer, whose service was interrupted, will re-enter the service area and resume his interrupted service based on the non-preemptive priority rule. Using the matrix geometric method, the steady state behavior of this system is analyzed. Based on the queue length distribution, several important performance measures along with some numerical examples have been discussed. Finally, under a given cost structure, we use the direct search method to determine the optimal capacity of the space to accommodate the interrupted customers.