On value functions for FCFS queues with batch arrivals and general cost structures
- 1 April 2020
- journal article
- research article
- Published by Elsevier in Performance Evaluation
- Vol. 138, 102083
Abstract
No abstract availableKeywords
Funding Information
- Háskóli Íslands
This publication has 35 references indexed in Scilit:
- To split or not to split: Selecting the right server with batch arrivalsOperations Research Letters, 2013
- Minimizing slowdown in heterogeneous size-aware dispatching systemsACM SIGMETRICS Performance Evaluation Review, 2012
- M/M/1-PS queue and size-aware task assignmentPerformance Evaluation, 2011
- DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEMProbability in the Engineering and Informational Sciences, 2009
- On the value function of the M/Cox(r)/1 queueJournal of Applied Probability, 2006
- Generalised ‘join the shortest queue’ policies for the dynamic routing of jobs to multi-class queuesJournal of the Operational Research Society, 2003
- A heuristic rule for routing customers to parallel serversStatistica Neerlandica, 1997
- On the Optimality of the Generalized Shortest Queue PolicyProbability in the Engineering and Informational Sciences, 1990
- Joining the right queue: a state-dependent decision ruleIEEE Transactions on Automatic Control, 1990
- On the optimal assignment of customers to parallel serversJournal of Applied Probability, 1978