Work-conserving priorities

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

[2]  J. Wolfowitz,et al.  On the Characteristics of the General Queueing Process, with Applications to Random Walk , 1956 .

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

[4]  J D Littler,et al.  A PROOF OF THE QUEUING FORMULA , 1961 .

[5]  D. Gaver.  A Waiting Line with Interrupted Service, Including Priorities , 1962 .

[6]  V. E. Beneš,et al.  General Stochastic Processes in the Theory of Queues , 1965 .

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

[8]  P. Naor,et al.  Some Queuing Problems with the Service Station Subject to Breakdown , 1963 .

[9]  Peter D. Welch,et al.  On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service , 1964 .

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

[11]  Robert M. Oliver.  AN ALTERNATE DERIVATION OF THE POLLACZEK KHINTCHINE FORMULA , 1963 .

[12]  William L. Maxwell,et al.  Queuing with Alternating Priorities , 1965 .

[13]  N. K. Jaiswal,et al.  Priority queues , 1968 .

[14]  Lajos Takács.  Two Queues Attended by a Single Server , 1968, Oper. Res..

[15]  Linus Schrage.  A Mixed-Priority Queue with Applications to the Analysis of Real-Time Systems , 1969, Oper. Res..

[16]  R. Wolff.  Time Sharing with Priorities , 1970 .

[17]  Ralph E. Strauch,et al.  When a Queue Looks the Same to an Arriving Customer as to an Observer , 1970 .