GEOM/GEOM[a]/1/ queue with late arrival system with delayed access and delayed multiple working vacations
DOI:
https://doi.org/10.2298/YJOR120627014CKeywords:
discrete time, bulk-service, working vacations, queue, waiting time distributionAbstract
This paper considers a discrete-time bulk-service queue with infinite buffer space and delay multiple working vacations. Considering a late arrival system with delayed access (LAS-AD), it is assumed that the inter-arrival times, service times, vacation times are all geometrically distributed. The server does not take a vacation immediately at service complete epoch but keeps idle period. According to a bulk-service rule, at least one customer is needed to start a service with a maximum serving capacity 'a'. Using probability analysis method and displacement operator method, the queue length and the probability generating function of waiting time at pre-arrival epochs are obtained. Furthermore, the outside observer’s observation epoch queue length distributions are given. Finally, computational examples with numerical results in the form of graphs and tables are discussed.References
Takagi, H., Queueing Analysis—A Foundation of Performance Evaluation: Vol. 3. Discrete-time Systems, North-Holland, New York, 1993.
Zhang, Z.G., Tian, N., “Discrete-time Geo/G/1 queue with multiple adaptive vacations”, Queuing Systems, 38 (2001) 419-429.
Tian, N., Zhang, Z.G., “The discrete-time GI/Geo/1 queue with multiple vacations”, Queueing Systems, 40 (2002) 283-294.
Bruneel, H., Fiems, D., “Analysis of a discrete-time queuing system with timed vacations”, Queuing Systems, 42 (2002) 243-254.
Alfa, A.S., “Vacation models in discrete time”, Queuing Systems, 44 (2003) 5-30.
Alfa, A.S., “A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service”, Operations Research Letters, 18 (1995) 31-40.
Servi, L.D., Finn, S.G., “M/M/1 queues with working vacations (M/M/1/WV)”, Performance Evaluation, 50 (2002) 41-52.
Wu, D., Takagi, H., “M/G/1 queue with multiple working vacations”, Performance Evaluation, 63 (2006) 654-681.
Baba, Y., “Analysis of a GI/M/1 queue with multiple working vacations”, Operations Research Letters, 33 (2005) 201-209.
Banik, A.D., Gupta, U.C., Pathak, S.S., “On the GI/M/1/N queue with multiple working vacations—analytic analysis and computation”, Applied Mathematical Modelling, 31 (2007) 1701-1710.
Tian, N., Ma, Z., Liu, M., “The discrete time Geom/Geom/1 queue with multiple working vacations”, Applied Mathematical Modeling, 32 (2007) 2941-2953.
Li, J.H., Tian, N.S., Liu, W.Y., “Discrete-time GI/Geom/1 queue with multiple working vacations”, Queueing Systems, 56 (2007) 53-63.
Yu, M.M., Tang, Y.H., Fu, Y.H., “Steady state analysis and computation of the GI^[x]/M^[b]/1/L queue with multiple working vacations and partial batch rejection”, Computer & Industrial Engineering, 56 (2009) 1243-1253.
Vijaya Laxmi, P., Obsie Mussa Yesuf., “Renewal input infinite buffer batch service queue with single exponential working vacation and accessibility to batches”, International Journal of Mathematics in Operational Research, 3 (2011) 219-243.
Goswami, V., Mund, G.B., “Analysis of discrete-time batch service renewal input queue with multiple working vacations”, Computers & Industrial Engineering, 61 (2011) 629-636.
CHUAN KE, J., “The optimal control in batch arrival queue with server vacations, startup and breakdowns”, Yugoslav Journal of Operations Research, 14 (2004) 41-55.
Spiegel, M.R., Schaum's Outline of Theory and Problems of Calculus of Finite Differences and Difference Equations, McGraw-Hill, New York, 1971.
Hunter, J.J., “Mathematical techniques of applied probability”, in: Discrete-time Models: Techniques and Applications, Vol. 2, Academic Press, New York, 1983.
Tian, N.S., X, X.L., Ma, Z.Y., Discrete Time Queueing Theory, Science Press, Beijing, 2007.
Downloads
Published
Issue
Section
License
Copyright (c) 2014 YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
