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

DOI10.1016/J.EJOR.2011.09.029MaRDI QIDQ439382zbMATH OpenOpenAlexFDO

Authors Esa Hyytiä, Aleksi Penttinen, Samuli Aalto

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)

Recommendations

• Open problem: Size-based scheduling with estimation errors
• A general ``power-of-\(d\) dispatching framework for heterogeneous systems
• On the average sojourn time under \(M/M/1/\)SRPT
• Improving routing decisions in parallel non-observable queues
• Performance balancing size-interval routing policies

Cites work

• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 1514781 (Why is no real title available?)
• scientific article; zbMATH DE number 1416627 (Why is no real title available?)
• scientific article; zbMATH DE number 3338194 (Why is no real title available?)
• scientific article; zbMATH DE number 3361678 (Why is no real title available?)
• A heuristic rule for routing customers to parallel servers
• A simple dynamic routing problem
• Allocation of tasks to specialized processors: A planning approach
• Deciding Which Queue to Join: Some Counterexamples
• Fluid limits for shortest remaining processing time queues
• Instability of the Join-the-Shortest-Queue and FCFS Policies in Queueing Systems and Their Stabilization
• Joining the right queue: a state-dependent decision rule
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Machine repair as a priority waiting-line problem
• Multi-layered round robin routing for parallel servers
• On extremal service disciplines in single-stage queueing systems
• On the value function of the M/Cox(r)/1 queue
• Optimal control of two interacting service stations
• Optimal load balancing on distributed homogeneous unreliable processors
• Optimality of the round-robin routing policy
• Optimality of the shortest line discipline
• Round robin scheduling of heterogeneous parallel servers in heavy traffic
• The Queue M/G/1 with the Shortest Remaining Processing Time Discipline
• The autostrada queueing problem

Cited in

(13)

• Optimal Routing of Fixed Size Jobs to Two Parallel Servers
• To split or not to split: selecting the right server with batch arrivals
• Assigning multiple job types to parallel specialized servers
• Dispatching of robotic control programs
• Open problems in queueing theory inspired by datacenter computing
• Open problem: Size-based scheduling with estimation errors
• Minimizing the mean slowdown in a single-server queue
• Minimizing the mean slowdown in the M/G/1 queue
• Last in line
• Queue-length-aware dispatching in large-scale heterogeneous systems
• On the value function of the M/G/1 FCFS and LCFS queues
• Routing jobs with deadlines to heterogeneous parallel servers
• Dispatching to parallel servers. Solutions of Poisson's equation for first-policy improvement

This page was built for publication: Size- and state-aware dispatching problem with queue-specific job sizes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q439382)