Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T06:28:25.027Z Has data issue: false hasContentIssue false
  • English
  • Français

On M/G/1 queues with exhaustive service and generalized vacations

Part of:Operations research and management scienceSpecial processes

Published online by Cambridge University Press:  01 July 2016

Huan Li and
Yixin Zhu
Huan Li*
Affiliation:
State University of New York at Buffalo
Yixin Zhu*
Affiliation:
BNR Inc., Richardson, Texas
*
* Postal address: Department of Industrial Engineering, State University of New York at Buffalo, Buffalo, NY 14260, USA.
** Postal address: Department of Systems Engineering, BNR Inc., Richardson, TX 75082, USA.
Get accessRights & Permissions [Opens in a new window]

Abstract

We consider M/G/1 queues with exhaustive service and generalized vacations, where at the end of every busy period the server either follows a mixed vacation policy from a given vacation policy set or stays idle. A simple recursive formula for the moments of the stationary waiting time is provided. This formula results in the decomposition property for our model immediately. It also enables us to derive many existing results for the M/G/1 queues with various vacation policies.

Keywords

SERVER VACATIONSMOMENTSRECURSIVE FORMULAS

MSC classification

Primary:90B22: Queues and service
Secondary:60K25: Queueing theory

Information

Type
General Applied Probability
Information
Advances in Applied Probability , Volume 27 , Issue 2 , June 1995, pp. 510 - 531
Copyright
Copyright © Applied Probability Trust 1995 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Boxma, O. J. and Groenendijk, W. P. (1987) Pseudo-conservation laws in cyclic-service systems. J. Appl. Prob. 24, 949–964.Google Scholar
Brumelle, S. L. (1972) A generalization of L = ?W to moments of queue length and waiting time. Operat. Res. 20, 1127–1136.Google Scholar
Chow, Y. S. and Teicher, H. (1988) Probability Theory: Independence, Interchangeability, Martingales. Springer-Verlag, New York.Google Scholar
Chung, K. L. (1974) A Course in Probability Theory. Academic Press, New York.Google Scholar
Cooper, R. B. (1970) Queues served in cyclic order: waiting times. Bell System Tech. J. 49, 399–413.Google Scholar
Doshi, B. T. (1986) Queueing systems with vacations–a survey. Queueing Systems 1, 29–66.Google Scholar
Doshi, B. T. (1990a) Conditional and unconditional distributions for M/G/1 type queues with server vacations. Queueing Systems 7, 229–252.Google Scholar
Doshi, B. T. (1990b) Single server queues with vacations. In Stochastic Analysis of Computer and Communication Systems, ed. Takagi, H., pp. 217–266. North-Holland, Amsterdam.Google Scholar
Fuhrmann, S. W. (1984) A note on the M/G/1 queue with server vacations. Operat. Res. 31, 1368–1373.Google Scholar
Fuhrmann, S. W. and Cooper, R. B. (1985) Stochastic decomposition in an M/G/1 queue with generalized vacations. Operat. Res. 33, 1117–1129.Google Scholar
Gaver, D. P. Jr. (1962) A waiting line with interrupted service, including priorities. J. R. Statist. Soc. B 24, 73–90.Google Scholar
Harris, C. M. and Marchal, W. G. (1988) State dependence in M/G/1 server vacation models. Operat. Res. 36, 560–565.Google Scholar
Keilson, J. (1962) Queues subject to service interruption. Ann. Math. Statist. 33, 1314.Google Scholar
Keilson, J. and Servi, L. D. (1986) Oscillating random walk models for GI/G/1 vacation systems with Bernoulli schedules. J. Appl. Prob. 23, 790–802.Google Scholar
Kella, O. (1990) Optimal control of the vacation scheme in an M/G/1 queue. Operat. Res. 38, 725–728.Google Scholar
Leung, K. K. (1992) On the additional delay in an M/G/l queue with generalized vacations and exhaustive service. Operat. Res. 40, S272–S283.Google Scholar
Levy, Y. and Yechiali, U. (1975) Utilization of idle time in an M/G/l queueing system. Management Sci. 22, 202–211.Google Scholar
Ross, S. M. (1983) Stochastic Processes. Wiley, New York.Google Scholar
Scholl, M. and Kleinrock, L. O. (1983) On the M/G/1 queue with rest periods and certain service independent queueing disciplines. Operat. Res. 31, 705–719.Google Scholar
Shanthikumar, J. G. (1988) On stochastic decomposition in M/G/1 type queues with generalized server vacations. Operat. Res. 36, 566–569.Google Scholar
Shanthikumar, J. G. and Sumita, U. (1989) Modified Lindley process with replacement: dynamic behavior, asymptotic decomposition and application. J. Appl. Prob. 26, 552–565.Google Scholar