论文信息 - Bounds for a Dynamic-Priority Queue

Bounds for a Dynamic-Priority Queue

This paper obtains upper and lower bounds on equilibrium mean waiting times for a Poisson-input queue with the nonpreemptive dynamic-priority service discipline studied by Jackson.

J. M. Holtzman

[1] Linus Schrage. Letter to the Editor - An Alternative Proof of a Conservation Law for the Queue G/G/1 , 1970, Oper. Res..

[2] D C LittleJohn. A Proof for the Queuing Formula , 1961 .

[3] Leonard Kleinrock,et al. Time Dependent Priority Queues , 1967, Oper. Res..

[4] Lajos Takács,et al. Priority queues , 2019, The Art of Multiprocessor Programming.

[5] James R. Jackson. Waiting-time distributions for queues with dynamic priorities , 1962 .

[6] L. Kleinrock. A conservation law for a wide class of queueing disciplines , 1965 .

[7] J. Little. A Proof for the Queuing Formula: L = λW , 1961 .

[8] G. M. Jenkins,et al. Stochastic Service Systems. , 1964 .

[9] Alan Cobham,et al. Priority Assignment in Waiting Line Problems , 1954, Oper. Res..