Stochastic Scheduling in Priority Queues with Strict Deadlines

[1]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[2]  Guy Pujolle,et al.  Recurrence in single server queues with impatient customers , 1978 .

[3]  Donald F. Towsley,et al.  Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service , 1988, JACM.

[4]  C. Derman,et al.  A Renewal Decision Problem , 1978 .

[5]  P. P. Bhattacharya,et al.  Optimal allocation of a server between two queues with due times , 1991 .

[6]  Anthony Ephremides,et al.  Optimal scheduling with strict deadlines , 1989 .

[7]  Anthony Ephremides,et al.  A simple dynamic routing problem , 1980 .

[8]  L. Takács.  A single-server queue with limited virtual waiting time , 1974, Journal of Applied Probability.

[9]  Weiss Gideon,et al.  Scheduling jobs with stochastic processing times and due dates to minimize total tardiness , 1992 .

[10]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[11]  F. Baccelli,et al.  Single-server queues with impatient customers , 1984, Advances in Applied Probability.

[12]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[13]  Sartaj Sahni,et al.  Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops , 1981, Oper. Res..

[14]  Robert E. Stanford,et al.  Reneging Phenomena in Single Channel Queues , 1979, Math. Oper. Res..

[15]  Kishor S. Trivedi,et al.  A Single Server Queue in a Hard-Real-Time Environment , 1985 .