Skip to main content
Log in

Optimal priority queues: The simple discretionary priority rule

  • Published:
Zeitschrift für Operations Research Aims and scope Submit manuscript

Summary

The simple discretionary priority rule defines a point of discretion for every customer class up to which preemption by newly arriving customers of higher classes is possible. The paper derives the transient state results for the case with arbitrary numbers of customer classes and general service time distributions. The optimal point of discretion is determined for cost functions linear in the expected number of customers of each class present in the system.

Zusammenfassung

Die einfache diskretionäre Prioritätsregel legt für jede Kundenklasse einen Punkt der Diskretion fest, bis zu welchem Verdrängung durch neuankommende Kunden höherer Klassen möglich ist. Ergebnisse für das zeitabhängige Verhalten von Prozessen mit beliebiger Anzahl von Kundenklassen und allgemeinverteilten Bedienzeiten werden abgeleitet. Der optimale Punkt der Diskretion wird bestimmt für eine Kostenfunktion linear im Erwartungswert der Anzahl der im System anwesenden Kunden einer jeden Klasse.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Avi-Itzhak, B., I. Brosh andP. Naor: On Discretionary Priority Queueing. ZAMM,6, 235–242, 1964.

    Google Scholar 

  • Brosh, I., andP. Naor: On Optimal Disciplines in Priority Queues. Internat. Stat. Inst,40, 593–607, 1963.

    Google Scholar 

  • Balachandran, K. R.: Parametric Priority Rules: An Approach to Optimization in Priority Queues. ORSA,18, 526–540, 1970.

    Google Scholar 

  • Cobham, A.: Priority Assignment in Waiting Lines. ORSA,2, 70–76, 1954.

    Google Scholar 

  • Etschmaier, M.: Discretionary Priority Processes. Tech. Memo Nr. 60, Case Institute of Technology, 1966.

  • —: Prioritätswarteschlangen zur Produktionssteuerung. Doctoral Dissertation Technical University of Graz, Austria 1970.

    Google Scholar 

  • Gaver, Jr., D. P.: ImbeddedMarkov Chain Analysis of a Waiting Line Process in Continuous Time. Ann. Math. Stat.,30, 698–720, 1959.

    Google Scholar 

  • —: A Waiting Line with Interrupted Service Including Priorities. J. Roy. Stat. Soc., B,24, 73–90, 1962.

    Google Scholar 

  • Jaiswal, N. K.: Priority Queues. Academic Press, New York 1968.

    Google Scholar 

  • Keilson, J.: Queues Subject to Service Interruptions. Ann. Math. Stat.,33, No. 4, 1962.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Etschmaier, M.M. Optimal priority queues: The simple discretionary priority rule. Zeitschrift für Operations Research 16, 101–112 (1972). https://doi.org/10.1007/BF01963621

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01963621

Keywords

Navigation