E. Hyytiä, R. Righter, O. Bilenne and X. Wu, Dispatching discrete-size jobs with multiple deadlines to parallel heterogeneous servers, in Systems modeling: methodologies and tools, pp. 29-46, Springer, EAI/Springer Innovations in Communications and Computing, 2018.
Abstract: We study the M/D/1 queue and its generalization, the M/iD/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. The M/iD/1 queue enables us to model both varying jobs sizes and batch arrival processes. We derive explicit value functions for these M/D/1-type of queues that enable the development of efficient cost-aware dispatching policies to parallel servers.
BibTeX entry:
@incollection{hyytia-springer-2018, author = {Esa Hyyti{\"a} and Rhonda Righter and Olivier Bilenne and Xiaohu Wu}, title = {Dispatching discrete-size jobs with multiple deadlines to parallel heterogeneous servers}, editor = {Antonio Puliafito and Kishor Trivedi}, booktitle = {Systems modeling: methodologies and tools}, publisher = {Springer}, year = {2018}, series = {EAI/Springer Innovations in Communications and Computing}, pages = {29--46}, doiopt = {10.1007/978-3-319-92378-9_3}, }