Routing jobs with deadlines to heterogeneous parallel servers
From MaRDI portal
Publication:1694786
DOI10.1016/j.orl.2016.05.009zbMath1380.90117OpenAlexW2418456802MaRDI QIDQ1694786
Publication date: 6 February 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2016.05.009
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Size- and state-aware dispatching problem with queue-specific job sizes
- Certain optimality properties of the first-come first-served discipline for G/G/s queues
- Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
- TWO QUEUES IN PARALLEL
- On the value function of the M/Cox(r)/1 queue
- A simple dynamic routing problem
- Optimality of the shortest line discipline
- Introduction to Queueing