IDR Logo

Please use this identifier to cite or link to this item: http://idr.iitbbs.ac.in/jspui/handle/2008/1231
Title: Stationary analysis and optimal control under multiple working vacation policy in a GI/M(a,b)/1 queue
Authors: Panda G.
Banik A.D.
Guha D.
Keywords: Bulk service
cost optimization
mean idle period
multiple working vacations
roots method
system-length
Issue Date: 2017
Citation: 1
Abstract: This paper considers an infinite buffer renewal input queue with multiple working vacation policy wherein customers are served by a single server according to general bulk service (a, b)-rule (1 ? a ? b). If the number of waiting customers in the system at a service completion epoch (during a normal busy period) is lower than �a�, then the server starts a vacation. During a vacation if the number of waiting customers reaches the minimum threshold size �a�, then the server starts serving this batch with a lower rate than that of the normal busy period. After completion of a batch service during working vacation, if the server finds less than �a� customers accumulated in the system, then the server takes another vacation, otherwise the server continues to serve the available batch with that lower rate. The maximum allowed size of a batch in service is �b�. The authors derive both queue-length and system-length distributions at pre-arrival epoch using both embedded Markov chain approach and the roots method. The arbitrary epoch probabilities are obtained using the classical argument based on renewal theory. Several performance measures like average queue and system-length, mean waiting-time, cost and profit optimization are studied and numerically computed. � 2017 Institute of Systems Science, Academy of Mathematics and Systems Science, CAS and Springer-Verlag GmbH Germany, part of Springer Nature
URI: http://dx.doi.org/10.1007/s11424-017-6172-y
http://10.10.32.48:8080/jspui/handle/2008/1231
Appears in Collections:Research Publications

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.