Round robin scheduling of heterogeneous parallel servers in heavy traffic
From MaRDI portal
Publication:2378336
DOI10.1016/j.ejor.2008.01.040zbMath1161.90408MaRDI QIDQ2378336
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
queueing; heavy traffic; heterogeneous servers; round robin routing; shortest remaining processing time scheduling
90B22: Queues and service in operations research
90B36: Stochastic scheduling theory in operations research
Related Items
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