Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers
Loading...
Access rights
openAccess
© 2017 The Authors. Published by Elsevier B.V. This is an open access article under the CC-BY Licence.
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Date
Major/Subject
Mcode
Degree programme
Language
en
Pages
13
Series
Performance Evaluation, Volume 114, pp. 32-44
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.Description
Keywords
Other note
Citation
Hyytiä, E, Righter, R, Bilenne, O & Wu, X 2017, 'Dispatching fixed-sized jobs with multiple deadlines to parallel heterogeneous servers', Performance Evaluation, vol. 114, pp. 32-44. https://doi.org/10.1016/j.peva.2017.04.003