K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal

DOI10.1016/0167-6911(85)90037-4zbMath0568.60090OpenAlexW2004964364MaRDI QIDQ1060497

Dye-Jyun Ma, Armand M. Makowski, John S. Baras

Publication date: 1985

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(85)90037-4

zbMATH Keywords

competing queuescost over an infinite horizon

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

Asymptotic properties of constrained Markov Decision Processes, Simultaneous optimization of flow control and scheduling in a single server queue with two job classes, Simultaneous optimization of flow-control and scheduling in a single server queue with two job classes: Numerical results and approximation, Stochastic approximations for finite-state Markov chains, The existence of sensitive optimal policies in two multi-dimensional queueing models, On the optimization of two-class work-conserving parameterized scheduling policies, Discrete time queues with delayed information, Stochastic scheduling of parallel queues with set-up costs, Optimal control for parallel queues with a single batch server, Optimal control of multiclass parallel service systems, Interchange arguments for classical scheduling problems in queues, Optimal myopic policies and index policies for stochastic scheduling problems, Sample path methods in the control of queues, Unnamed Item, Exact finite approximations of average-cost countable Markov decision processes, A simple policy for multiple queues with size-independent service times, On global near optimality of special periodic protocols for fluid polling systems with setups, Dynamic pricing and scheduling in a multi-class single-server queueing system, Optimal control of a deterministic multiclass queuing system for which several queues can be served simultaneously, A survey of Markov decision models for control of networks of queues, \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method

Cites Work

• Unnamed Item
• On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
• Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
• The cμ rule revisited
• Dynamic Scheduling of a Multiclass Queue: Discount Optimality