Waiting and interdeparture times in priority queues with poisson- and general-arrival streams

Operations Research

Volumn 45, Issue 5, 1997, Pages 725-735

  Stanford, David A ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY; QUEUEING THEORY;

HIGH PRIORITY POISSON ARRIVAL CLASSES; INTERDEPARTURE TIME DISTRIBUTIONS; SINGLE SERVER PRIORITY QUEUES; WAITING TIME DISTRIBUTIONS;

OPERATIONS RESEARCH;

EID: 0031222284     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.45.5.725     Document Type: Article

References (32)

1. ALFA, A. S. 1995. Matrix-geometric Solution of a Discrete Time MAP/PH/1 Queue. Submitted for publication.
2. BERTSIMAS, D. J., J. KEILSON, D. NAKAZATO, AND H. ZHANG. 1991. Transient and Busy Period Analysis of the GI/G/1 Queue as a Hubert Factorization Problem. J. Appl. Prob. 28, 873-885.
3. BITRAN, G. R. AND D. TIRUPATI. 1988. Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference. Mgmt. Sci. 34, 75-100.
4. BUZACOTT, J. A. AND J. G. SHANTIKUMAR. 1985. On Approximate Queueing Models of Dynamic Job Shops. Mgmt. Sci. 31, 870-887.
5. COBHAM, A. 1954. Priority Assignment in Waiting Line Problems. Opns. Res. 2, 70-76.
6. COHEN, J. W. 1982. The Single Server Queue. North-Holland, Amsterdam.
7. CONWAY, R. W., W. L. MAXWELL, AND L. W. MILLER. 1967. Theory of Scheduling. Addison-Wesley, Reading, MA.
8. DELBROUCK, L. 1990. Interdeparture Times in M/G/1 Queueing Systems with Nonpreemptive Priority Discipline. O. R. Lett. 9, 65-69.
9. FISCHER, W. 1989. Waiting Times in Priority Systems with General Arrivals. INRS Technical Report 89-34, INRS-Télécommunications, Verdun, Québec, Canada.
10. HOLLEY, J. L. 1954. Waiting Lines Subject to Priorities. Opns. Res. 2, 341-343.
11. JAISWAL, N. K. 1968. Priority Queues. Academic Press, New York.
12. JAISWAL, N. K. AND K. THIRUVENGADAM. 1962. Preemptive Resume Priority Queue with Erlangian Inputs. Indian J. Math. 4, 53-70.
13. KESTEN, H. AND J. TH. RUNNENBURG. 1957. Priority in Waiting Line Problems. Nederl. Akad. Wetensch. Indagationes Math. 60, 312-336.
14. KÜHN, P. J. 1979. Approximate Analysis of General Queueing Networks by Decomposition. IEEE Trans. Comm. 27, 113-126.
15. MILLER, R. G. 1960. Priority Queues. Ann. Math Statist 31, 86-103.
16. NAIN, P. 1984. Interdeparture Times from a Queueing System with Preemptive Resume Priority. Perform. Eval. 4, 93-98.
17. OTT, T. J. 1987. The Single-Server Queue with Independent GI/G and M/G Input Streams. Adv. Appl. Prob. 19, 266-286.
18. RAMACHANDRAN, K. AND D. A. STANFORD. 1995. A Two-priority Queue with Phase and Poisson Streams. Submitted for publication.
19. SCHASSBERGER, R. 1974. A Broad Analysis of Single Server Priority Queues with Two Independent Streams, One of Them Poisson. Adv. Appl. Prob. 6, 666-688.
20. SCHMIDT, V. 1984. The Stationary Waiting Time Process in Single-server Priority Queues with General Low Priority Arrival Process. Math. Operationsforsch, u. Statist., ser. Optimization 15, 301-312.
21. SEGAL, M. AND W. WHITT. 1988. A Queueing Network Analyzer for Manufacturing. Paper 3.4iB.2, Proc. 12th Int'l Teletraffic Congress, Turin, Italy.
22. SHANTIKUMAR, J. G. AND J. A. BUZACOTT. 1981. Open Queueing Network Models of Dynamic Job Shops. Int. J. Prod. Res. 19, 255-266.
23. i/1 Queue. Perform. Eval. 12, 43-60.
24. STANFORD, D. A. AND W. FISCHER. 1991. Characterising Interdeparture Times for Bursty Input Streams in the Queue with Pooled Renewal Arrivals, Commun. Statist.-Stochastic Models 7, 2, 311-320.
25. SUMITA, S. 1986. An Application of the Conservation Law to Analyzing Single Server Queueing Systems with Two Independent Input Streams. Trans. IECE Japan 69, 628-637.
26. TAKÁCS, L. 1964. Priority Queues. Opns. Res. 12, 63-74.
27. TAKAGI, H. 1991. Queueing Analysis: A Foundation of Performance Evaluation. Vol. 1: Vacation and Priority Systems, Part 1. North-Holland, Amsterdam.
28. WAGNER, D. 1994. Analysis of a Multi-server Model with Nonpreemptive Priorities and Nonrenewal Input. In The Fundamental Role of Teletraffic in the Evolution of Telecommunications Networks. J. Labetoulle and J. W. Roberts, (eds.). Elsevier, Amsterdam, 757-766.
29. WAGNER, D. 1996. Analysis of a Finite Capacity Multi-server Model with Non-preemptive Priorities and Non-renewal Input. In Matrix-analytic Methods in Stochastic Models. S. R. Chakravarthy and A. S. Alfa, (eds.). Marcel Dekker, New York, 67-86.
30. WHTTT, W. 1983. The Queueing Network Analyzer. Bell System Tech. J. 62, 9, 2779-2815.
31. WHITT, W. 1988. A Light-Traffic Approximation for Single-class Departure Processes from Multi-class Queues. Mgmt. Sci. 34, 1333-1346.
32. WOLFF, R. W. 1982. Poisson Arrivals See Time Averages. Opns. Res. 30, 223-231.