This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
3.5 Bibliographic Notes
Altman, E., Khamisy, A and Yechiali, U. (1992). On elevator polling with globally gated regime. Queueing Sys., 11, 85–90.
Altman, E., Blabc, H., Khamisy, A., and Yechiali, U. (1994). Gated-type polling systems with walking and switch-in times. Stock. Models, 10, 741–763.
Altman, E. (2002). Stochastic recursive equations with applications to queue with dependent vacations. Ann. Oper. Res., 112, 43–61.
Bacot, J.B. and Dshalalow, J. H. (2001). A bulk input queueing system with batch gated service and multiple vacation policy. Math. and Comput. Model., 34, 873–886.
Bischof, W. (2001). Analysis of M/G/1 queues with setup time and vacations under six different service disciplines. Queueing Sys., 39, 265–301.
Browne, S. Coffman, E.G., Gilbert, E.N. and Wright, E.W. (1992a). The gated infinite server queue: Uniform service times. SIAM J. Appl. Math., 52, 1751–1762.
Browne, S., Coffman, E.G., Gilbert, E. and Wright, E.W. (1992b). Gated, exhaustive, parallel service. Prob. Eng. Inform. Sci., 6, 217–239.
Choi, B.D. and Park, K., (1990) The M/G/1 retrial queue with Bernoulli schedule. Queueing Systems, 7, 219–228.
Choi, B.D., Kim, B., and Choi, S.H. (2003). An M/G/1 queue with multiple type of feedback gated vacations and FIFS policy. Comput. Oper. Res., 30, 1289–1309.
Eisenberg, M. and Leung, K.K. (1991). A single sever queue with vacations and non-gated time-limited service. Perform. Evaluation, 12, 115–125.
Ishizaki, F., Takine, T., and Hasegawa, T. (1995). Analysis of a discrete-time queue with gated priority. Perform. Evaluation, 23, 121–143.
Keilson, J. and Servi, L. (1986). Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules. J. Appl. Probab., 23, 790–802.
Kumar, B. and Arivudainambi, D. (2002). The M/G/1 retrial queue with Bernoulli schedules and general retrial times. Comput. Math. Appl., 43, 15–30.
Lee, H. and Srinivasan, M. (1989). Control policies for the Mx/G/1 queueing system. Manage. Sci., 35, 707–721.
Madan, K., Abu-Dayyeh, W. and Taiyyan, F. (2003). A two server queue with Bernoulli schedules and a single vacation policy. Appl. Math. Comput., 145, 59–71.
Ramaswamy, R. and Servi, L. (1988). The busy period of the M/G/1 vacation model with a Bernoulli schedule. Stoch. Models, 4, 507–521.
Servi, L. (1986a). Average delay approximation of M/G/l cyclic queues with Bernoulli schedules. IEEE J. Select. Areas Commun., SAC-4, 813–822.
Servi, L. (1986b). D/G/l queue with vacations. Oper. Res., 34, 619–629.
Takagi, H. (1991). Queueing Analysis, Vol. 1, Vacation and Priority Systems. North-Holland Elsevier, Amsterdam.
Takagi, H. and Leung, K. (1994). Analysis of a discrete-time queueing system with time-limited service. Queueing Sys., 18, 183–197.
Takagi, H. (1991). Queueing Analysis, Vol. 1, Vacation and Priority Systems. North-Holland Elsevier, Amsterdam.
Tedijanto, E.E. (1990). Exact results for the cyclic service queue with a Bernoulli schedule. Perform. Evaluation, 11, 107–115.
Wortman, M., Disney, R. and Kiessler, P. (1991). The M/G/1 Bernoulli feedback queue with vacations. Queueing Sys., 9, 353–364.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Tian, N., Zhang, Z.G. (2006). M/G/1 Type Vacation Models: Nonexhaustive Service. In: Vacation Queueing Models Theory and Applications. International Series in Operations Research & Management Science, vol 93. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-33723-4_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-33723-4_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-33721-0
Online ISBN: 978-0-387-33723-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)