Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal
From MaRDI portal
Publication:3217401
DOI10.2307/1427059zbMath0554.60087OpenAlexW2331002104MaRDI QIDQ3217401
Armand M. Makowski, John S. Baras, Arthur J. Dorsey
Publication date: 1985
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1427059
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
Optimal routing for electric vehicle service systems, Optimal assignment policy of a single server attended by two queues, Stochastic approximations for finite-state Markov chains, Necessary and sufficient conditions for a bounded solution to the optimality equation in average reward Markov decision chains, Job scheduling to minimize expected weighted flowtime on uniform processors, Necessary conditions for the optimality equation in average-reward Markov decision processes, Optimal myopic policies and index policies for stochastic scheduling problems, The single-server scheduling problem with convex costs, A simple policy for multiple queues with size-independent service times, Recent results on conditions for the existence of average optimal stationary policies, Solving convex optimization with side constraints in a multi-class queue by adaptive \(c\mu \) rule, Optimal control of a deterministic multiclass queuing system for which several queues can be served simultaneously, Dynamic estimation of queue behaviour in urban traffic, Customer Scheduling with Incomplete Information, A survey of Markov decision models for control of networks of queues, Optimal scheduling of parallel queues using stochastic flow models, Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration, K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
