Abstract
We study the M/D/1 queue when jobs have firm deadlines for waiting (or sojourn) time. If a deadline is not met, a job-specific deadline violation cost is incurred. We derive explicit value functions for this M/D/1 queue that enable the development of efficient cost-aware dispatching policies to parallel servers. The performance of the resulting dispatching policies is evaluated by means of simulations.
Original language | English |
---|---|
Pages (from-to) | 32-44 |
Number of pages | 13 |
Journal | Performance Evaluation |
Volume | 114 |
DOIs | |
Publication status | Published - 25 May 2017 |
MoE publication type | A1 Journal article-refereed |
Keywords
- Deadlines
- Dispatching problem
- M/D/1
- MDP
- Parallel computing