Routing with too much information?
- 1 April 2022
- journal article
- editorial
- Published by Springer Nature in Queueing Systems
- Vol. 100 (3-4) , 441-443
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Partial Flexibility in Routeing and SchedulingAdvances in Applied Probability, 2013
- Size- and state-aware dispatching problem with queue-specific job sizesEuropean Journal of Operational Research, 2012
- Multi-layered round robin routing for parallel serversQueueing Systems, 2006
- Optimal state-free, size-aware dispatching for heterogeneous -type systemsPerformance Evaluation, 2005
- Optimality of the round-robin routing policyJournal of Applied Probability, 1994
- Certain optimality properties of the first-come first-served discipline for G/G/s queuesStochastic Processes and their Applications, 1987
- Approximation of multichannel queueing systemsSiberian Mathematical Journal, 1980
- A simple dynamic routing problemIEEE Transactions on Automatic Control, 1980
- On the optimal assignment of customers to parallel serversJournal of Applied Probability, 1978
- Optimality of the shortest line disciplineJournal of Applied Probability, 1977