A simple policy for multiple queues with size-independent service times
From MaRDI portal
Publication:2450707
DOI10.1016/J.ORL.2013.07.001zbMath1286.90033arXiv1306.3513OpenAlexW2963964039MaRDI QIDQ2450707
Publication date: 15 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.3513
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The shuttle dispatch problem with compound Poisson arrivals: Controls at two terminals
- K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
- Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
- The cμ rule revisited
- The Computation of Optimal Control Limits for a Queue with Batch Services
- Technical Note—Further Results on an Infinite Capacity Shuttle with Control at a Single Terminal
- Optimal Dispatching of a Finite Capacity Shuttle
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- Optimal Dispatching of an Infinite-Capacity Shuttle: Control at a Single Terminal
- Optimal Average Cost Policies for the Two-Terminal Shuttle
- Algorithm for Traffic Control
This page was built for publication: A simple policy for multiple queues with size-independent service times