On the optimality of the earliest due date rule in stochastic scheduling and in queueing
DOI10.1016/j.ejor.2021.09.039zbMath1490.90145OpenAlexW3210463067MaRDI QIDQ2076926
Richard Bryant, Peter Lakner, Michael L. Pinedo
Publication date: 22 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.09.039
schedulingparallel machine schedulingdue date related objective functionsEDD rulemulti-server queueing
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Preemptive scheduling to minimize mean weighted flow time
- Effects of service disciplines in \(G/GI/s\) queueing systems
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Sample path methods in the control of queues
- The ``least flexible job first rule in scheduling and in queueing
- Two machine preemptive scheduling problem with release dates, equal processing times and precedence constraints
- Hard Real-Time Computing Systems
- On the Characteristics of the General Queueing Process, with Applications to Random Walk
- Preemptive Scheduling with Release Times, Deadlines, and Due Times
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- Applied Probability and Queues
- Multiprocessor Scheduling for Real-Time Systems
- Work-conserving priorities
- On the Theory of Queues With Many Servers
- Scheduling
This page was built for publication: On the optimality of the earliest due date rule in stochastic scheduling and in queueing