Size- and state-aware dispatching problem with queue-specific job sizes

DOI10.1016/j.ejor.2011.09.029zbMath1244.90065OpenAlexW2022590452MaRDI QIDQ439382

Esa Hyytiä, Samuli Aalto, Aleksi Penttinen

Publication date: 16 August 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.09.029

zbMATH Keywords

routingMDP\(M/G/1\)mean response timeparellel queuesrelative values

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items

Assigning multiple job types to parallel specialized servers ⋮ Minimizing the mean slowdown in a single-server queue ⋮ Minimizing the mean slowdown in the M/G/1 queue ⋮ Routing jobs with deadlines to heterogeneous parallel servers ⋮ Optimal Routing of Fixed Size Jobs to Two Parallel Servers ⋮ Dispatching of Robotic Control Programs ⋮ To split or not to split: selecting the right server with batch arrivals ⋮ On the Value Function of the M/G/1 FCFS and LCFS Queues ⋮ Last in line ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Allocation of tasks to specialized processors: A planning approach
• Round robin scheduling of heterogeneous parallel servers in heavy traffic
• Multi-layered round robin routing for parallel servers
• Optimal Load Balancing on Distributed Homogeneous Unreliable Processors
• Fluid Limits for Shortest Remaining Processing Time Queues
• Joining the right queue: a state-dependent decision rule
• Optimal control of two interacting service stations
• The autostrada queueing problem
• On the value function of the M/Cox(r)/1 queue
• On extremal service disciplines in single-stage queueing systems
• Deciding Which Queue to Join: Some Counterexamples
• A simple dynamic routing problem
• Optimality of the shortest line discipline
• Optimality of the round-robin routing policy
• A heuristic rule for routing customers to parallel servers
• Instability of the Join-the-Shortest-Queue and FCFS Policies in Queueing Systems and Their Stabilization
• Machine Repair as a Priority Waiting-Line Problem
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline