Clearing models for M/G/1 queues

Queueing Systems

Volumn 38, Issue 3, 2001, Pages 287-306

  Boxma, Onno J ^a,b   Perry, David ^c   Stadje, Wolfgang ^d  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

^c UNIVERSITY OF HAIFA   (Israel)

^d UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

Clearing; M G 1 queue; Workload

Indexed keywords

CLEARING; M/G/1 QUEUE; QUEUEING SYSTEM; STATIONARY DISTRIBUTION; WORKLOAD;

QUEUEING THEORY;

EID: 0035536445     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/A:1010903605577     Document Type: Article

References (24)

1. S. Asmussen, Applied Probability and Queues (Wiley, New York, 1987).
2. R.J. Boucherie and O.J. Boxma, The workload in the M/G/1 queue with work removal, Probab. Engrg. Inform. Sci. 10 (1996) 261-277.
3. R.J. Boucherie, O.J. Boxma and K. Sigman, A note on negative customers, GI/G/1 workload, and risk processes, Probab. Engrg. Inform. Sci. 11 (1997) 305-311.
4. O.J. Boxma and D. Perry, A queueing model with dependence between service and interarrival times, European J. Oper. Res. 128 (2001) 611-614.
5. O.J. Boxma, D. Perry and F.A. van der Duyn Schouten, Fluid queues and mountain processes, Probab. Engrg. Inform. Sci. 13 (1999) 407-427.
6. J.W. Cohen, On up- and downcrossings, J. Appl. Probab. 14 (1977) 405-410.
7. J.W. Cohen, The Single Server Queue (North-Holland, Amsterdam, 1982).
8. B. Doshi, Level-crossing analysis of queues, in: Queueing and Related Models, eds. U. Bhat et al., Oxford Statistical Science Series, Vol. 9 (Clarendon Press, Oxford, 1992) pp. 3-33.
9. E. Gelenbe, Product-form queuing networks with negative and positive customers, J. Appl. Probab. 28 (1991) 656-663.
10. P.G. Harrison and E. Pitel, The M/G/1 queue with negative customers, Adv. in Appl. Probab. 28 (1996) 540-566.
11. G. Jain and K. Sigman, Generalizing the Pollaczek-Khintchine formula to account for arbitrary work removal, Probab. Engrg. Inform. Sci. 10 (1996) 519-531.
12. G. Jain and K. Sigman, A Pollaczek-Khintchine formula for M/G/1 queues with disasters, J. Appl. Probab. 33 (1996) 1191-1200.
13. O. Kella, An exhaustive Lévy storage process with intermittent output, Stochastic Models 14 (1998) 979-992.
14. O. Kella and W. Whitt, Useful martingales for stochastic storage processes with Lévy input, J. Appl. Probab. 29 (1992) 396-403.
15. O. Kella and W. Whitt, A storage model with a two-state random environment, Oper. Res. 40 (1992) S257-S262.
16. D. Perry and B. Levikson, Continuous production/inventory model with analogy to certain queueing and dam models, Adv. in Appl. Probab. 21 (1989) 123-141.
17. D. Perry and M.J.M. Posner, A correlated M/G/1-type queue with randomized server repair and maintenance modes, Oper. Res. Lett. 26 (2000) 137-147.
18. D. Perry, W. Stadje and S. Zacks, Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility, Oper. Res. Lett. 27 (2000) 163-174.
19. R. Serfozo, Introduction to Stochastic Networks (Springer, New York, 1999).
20. R. Serfozo and S. Stidham, Semi-stationary clearing processes, Stochastic Process. Appl. 6 (1978) 165-178.
21. S. Stidham. Stochastic clearing systems, Stochastic Process. Appl. 2 (1974) 85-113.
22. S. Stidham, Cost models for stochastic clearing systems, Oper. Res. 25 (1977) 100-127.
23. S. Stidham, Clearing systems and (s, S) inventory systems with nonlinear costs and positive lead times, Oper. Res. 34 (1986) 276-280.
24. W. Whitt, The stationary distribution of a stochastic clearing process, Oper. Res. 29 (1981) 294-308.