Randomized policy of a poisson input queue with J vacations

Abstract

This paper studies the operating characteristics of an M/G/1 queuing system with a randomized control policy and at most J vacations. After all the customers are served in the queue exhaustively, the server immediately takes at most J vacations repeatedly until at least N customers are waiting for service in the queue upon returning from a vacation. If the number of arrivals does not reach N by the end of the J ^th vacation, the server remains idle in the system until the number of arrivals in the queue reaches N. If the number of customers in the queue is exactly accumulated N since the server remains idle or returns from vacation, the server is activated for services with probability p and deactivated with probability (1 − p). For such variant vacation model, other important system characteristics are derived, such as the expected number of customers, the expected length of the busy and idle period, and etc. Following the construction of the expected cost function per unit time, an efficient and fast procedure is developed for searching the joint optimum thresholds (N*, J*) that minimize the cost function. Some numerical examples are also presented.

Keywords

Cost / < p / N >-policy / supplementary variable technique / vacation

References

[1] Arumuganathan R., Jeyakumar S.. Steady state analysis of a bulk queue with multiple vacations, setup times with N-policy and closedown times. Applied Mathematical Modeling, 2005, 29: 972-986.

[2] Baba Y.. On the M^[x]/G/1 queue with vacation time. Operations Research Letters, 1986, 5: 93-98.

[3] Choudhury G.. A batch arrival queue with a vacation time under single vacation policy. Computers and Operations Research, 2002, 29: 1941-1955.

[4] Cox D.R.. The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables. Proceedings Cambridge Philosophical Society, 1955, 51: 433-441.

[5] Doshi B.T.. Queueing systems with vacations-a survey. Queueing Systems, 1986, 1: 29-66.

[6] Feinberg E.A., Kim D.J.. Bicriterion optimization of an M/G/1 queue with a removable server. Probability in the Engineering and Informational Sciences, 1996, 10: 57-73.

[7] Ke J.-C.. The control policy of an M^[x]/G/1 queueing system with server startup and two vacation types. Mathematical Methods of Operations Research, 2001, 54(3): 471-490.

[8] Ke J.-C., Chu Y.-K.. A modified vacation model M^[x]/G/1 system. Applied Stochastic Models in Business and Industry, 2006, 22: 1-16.

[9] Ke J.-C.. Operating characteristic analysis on the M^[x]/G/1 system with a variant vacation policy and balking. Applied Mathematical Modelling, 2007, 31(7): 1321-1337.

[10] Kella O.. The threshold policy in the M/G/1 queue with server vacations. Naval Research Logistics, 1989, 36: 111-123.

[11] Kuo C.-C., Wang K.-H., Lee S.-L.. Optimal control of the < p, ^N > -policy M/G/1 queue with server breakdowns and general startup times. International Journal of Information and Management Sciences, 2009, 20: 565-577.

[12] Lee H.W., Lee S.S., Park J.O., Chae K.C.. Analysis of M^[x]/G/1 queue with N policy and multiple vacations. Journal of Applied Probability, 1994, 31: 476-496.

[13] Lee S.S., Lee H.W., Chae K.C.. Batch arrival queue with N policy and single vacation. Computers and Operations Research, 1995, 22: 173-189.

[14] Levy Y., Yechiali U.. Utilization of idle time in an M/G/1 queueing system. Management Science, 1975, 22: 202-211.

[15] Moreno P.. Analysis of a Geo/G/1 queuing system with a generalized N-policy and setup-closedown times. Quality Technology & Quantitative Management, 2008, 5(2): 111-128.

[16] Tadj L., Choudhury G.. Optimal design and control of queues. TOP, 2005, 13(2): 359-412.

[17] Takagi H.. Queueing Analysis: A Foundation of Performance Evaluation. Vol. I, Vacation and Priority Systems, Part I, 1991, Amsterdam: North-Holland

[18] Wang K.-H., Huang K.-B.. A maximum entropy approach for the < p, N > -Policy M/G/1 queue with a removable and unreliable server. Applied Mathematical Modelling, 2009, 33(4): 2024-2034.

[19] Zhang Z.G., Tian N.. Discrete time Geo/G/1 queue with multiple adaptive vacations. Queueing Systems, 2001, 38: 419-429.