Abstract
Implementable algorithms are developed for a single server queue serving two types of customers and operating under a dynamic non-preemptive priority rule which assigns higher priority to type 1 customers when their queue length exceeds a pre-assigned theshold N, and to type 2 customers otherwise. The model is discussed under the assumption of a finite waiting room of size K-1 for type 2 customers and for the case of general service times and Poisson arrivals. The recursive computational schemes, which are obtained here using the function-analytic methods recently introduced by M. F. Neuts, can be used interactively in the design of such systems for arriving at desirable values of N and K. A self-contained section of numerical examples illustrates some interesting qualitative aspects of such a model.
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.
References
Cinlar, E. (1969), “Markov Renewal Theory”, Adv. in Appl. Probab., 1, 123–187.
Conway, R. W., Maxwell, W. L. & Miller, L. W. (1967), Theory of Scheduling, Addison-Wesley, Reading, MA.
Cox, D. R. (1955), “A Use of Complex Probabilities in the Theory of Stochastic Processes”, Proc. Cambridge Phil. Soc., 51, 313–319.
Heiman, D. & Neuts, M. F. (1973), “The Single Server Queue in Discrete Time — Numerical Analysis IV”, Naval Res. Logist. Quart., 20, 753–766.
Hunter, J. J. (1969), “On the Moments of Markov Renewal Processes”, Adv. in Appl. Probab., 1, 188–210.
Hunter, J. J. (1980), “Generalized Inverses and their Applications to Applied Probability Problems”, Tech. Rep. No. VTR-8006, Virginia Polytechnic Institute and State University, Industrial Engineering and Operations Research, Blacksburg, VA 24061.
Kesten, H. & Runnenburg, J. T. (1957), “Priority in Waiting Line Problems I and II”, Koninkl. Ned. Akad. Wetenschap. Proc., Ser. A., 60, 312–336.
Lucantoni, D. M. & Neuts, M. F. (1978), “Numerical Methods for a Class of Markov Chains Arising in Queueing Theory”, Tech. Rep. No. 78/10, Applied Mathematics Institute, University of Delaware, Newark, Delaware.
Matthews, D. E. (1979), “A Simple Method for Reducing Queueing Times in M/G/1”, Oper. Res., 27, 318–323.
Neuts, M. F. (1975), “Probability Distributions of Phase type”, Liber Amicorum Prof. Emeritus H. Florin, Department of Mathematics, University of Louvain, Belgium, 173–206.
Neuts, M. F. (1976), “Moment Formulas for the Markov Renewal Branching Process”, Adv. in Appl. Probab., 8, 690–711.
Neuts, M. F. (1977), “The M/G/1 Queue with Several Types of Customers and Change-Over Times”, Adv. in Appl. Probab., 9, 604–644.
Neuts, M. F. (1978), “Renewal Processes of Phase type”, Naval Res. Logist. Quart., 25, 445–454.
Neuts, M. F. (1979), “Queues Solvable without Rouché’s Theorem”, Oper. Res., 27, 767–781.
Neuts, M. F. & Meier, K. S. (1981), “On the Use of Phase Type Distributions in Reliability Modelling of Systems with a Small Number of Components”, O.R. Spectrum, 2, 227–234.
Ramaswami, V. (1980), “The N/G/1 Queue and its Detailed Analysis”, Adv. in Appl. Probab., 12, 222–261.
Ramaswami, V. (1980), “The Busy Period of Queues which have a Matrix-Geometric Steady-State Probability Vector”, Tech. Rep. No. 3-80, Dept. of Mathematics, Drexel University, Philadelphia, PA.
Schrage, L. E. & Miller, L. W. (1966), “The Queue M/G/1 with the Shortest Remaining Processing Discipline”, Oper. Res., 14, 670–684.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ramaswami, V., Lucantoni, D.M. (1982). Algorithmic Analysis of a Dynamic Priority Queue. In: Disney, R.L., Ott, T.J. (eds) Applied Probability— Computer Science: The Interface. Progress in Computer Science, vol 3. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-5798-1_8
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5798-1_8
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-3093-5
Online ISBN: 978-1-4612-5798-1
eBook Packages: Springer Book Archive