Round robin scheduling of heterogeneous parallel servers in heavy traffic

DOI10.1016/j.ejor.2008.01.040zbMath1161.90408OpenAlexW2034793817MaRDI QIDQ2378336

Rong Wu, Douglas G. Down

Publication date: 8 January 2009

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

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

zbMATH Keywords

queueingheavy trafficheterogeneous serversround robin routingshortest remaining processing time scheduling

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36)

Related Items (6)

Optimal routing for electric vehicle service systems ⋮ Size- and state-aware dispatching problem with queue-specific job sizes ⋮ Analysis of tollbooth systems with two tandem skill-based servers and two vehicle types ⋮ Dynamic routing in a distributed parallel many-server service system: the effect of \(\xi \)-choice ⋮ Balanced routing with partial information in a distributed parallel many-server queueing system ⋮ Mathematical modelling of a tollbooth system with two parallel skill-based servers and two vehicle types

Cites Work

• Heavy traffic resource pooling in parallel-server systems
• Multi-layered round robin routing for parallel servers
• Optimal control of a queueing system with two heterogeneous servers
• OPTIMAL ROUTING IN OUTPUT-QUEUED FLEXIBLE SERVER SYSTEMS
• Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Round robin scheduling of heterogeneous parallel servers in heavy traffic