Routing jobs with deadlines to heterogeneous parallel servers

Esa Hyytiä A · Rhonda Righter

11 citations0/0 files storedOperations Research Letters

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Scheduling and Optimization Algorithms Optimization and Search Problems

Abstract

We consider a dispatching system, where jobs with deadlines for their waiting times are assigned to FCFS servers immediately upon arrival. The dispatching problem is to choose a server for each job so as to minimize the probability of deadline violation. We derive an efficient deadline-aware policy in the MDP framework by means of policy improvement, analyze it, and evaluate its performance with simulations. We find that the new policy offers significant improvements over traditional heuristic policies.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 11 citations exist upstream.

References

1977Optimality of the shortest line discipline 2013Performance Modeling and Design of Computer Systems: Queueing Theory in Action 1987OR Forum—Perspectives on Queues: Social Justice and the Psychology of Queueing 1980A simple dynamic routing problem 1958TWO QUEUES IN PARALLEL 1998Optimal Load Balancing on Distributed Homogeneous Unreliable Processors 1987Joining the right queue: A Markov decision-rule 2011Size- and state-aware dispatching problem with queue-specific job sizes

Cited by

2017Value (Generating) Functions for the MX/G/1 Queue

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.