Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers

Esa Hyytiä*, Rhonda Righter, Olivier Bilenne, Xiaohu Wu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterScientificpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationEAI/Springer Innovations in Communication and Computing
Pages29-46
Number of pages18
ISBN (Electronic)978-3-319-92378-9
DOIs
Publication statusPublished - 1 Jan 2019
MoE publication typeA3 Part of a book or another research book

Publication series

NameEAI/Springer Innovations in Communication and Computing
ISSN (Print)2522-8595
ISSN (Electronic)2522-8609

Keywords

  • Batch Arrivals
  • Job Size
  • Parallel Servers
  • Varying Job Sizes
  • Violation Cost

Fingerprint Dive into the research topics of 'Dispatching Discrete-Size Jobs with Multiple Deadlines to Parallel Heterogeneous Servers'. Together they form a unique fingerprint.

Cite this