Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal

DOI10.2307/1427059MaRDI QIDQ3217401zbMATH OpenOpenAlexFDO

Authors John S. Baras, Arthur J. Dorsey, Armand M. Makowski

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

zbMATH Keywords

bufferdiscounted criteriondynamic priority assignment problemlong-run average criterionoptimality

Mathematics Subject Classification ID

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

Recommendations

• K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
• The cμ rule revisited
• Simultaneous optimization of flow control and scheduling in a single server queue with two job classes
• Beyond the c rule: Dynamic scheduling of a two-class loss queue
• Optimal scheduling of two competing queues with blocking

Cited in

(25)

• K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
• 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
• Interchange arguments for classical scheduling problems in queues
• Recent results on conditions for the existence of average optimal stationary policies
• Optimal assignment policy of a single server attended by two queues
• A survey of Markov decision models for control of networks of queues
• The single-server scheduling problem with convex costs
• \(K\) competing queues with customer abandonment: optimality of a generalised \(c \mu \)-rule by the smoothed rate truncation method
• Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration
• A simple policy for multiple queues with size-independent service times
• Stochastic approximations for finite-state Markov chains
• Customer scheduling with incomplete information
• Optimal routing for electric vehicle service systems
• An M/M/l queue with a generalized dynamic promotion rule
• Technical Note—On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment
• Optimal scheduling of two competing queues with blocking
• The µc-rule is not optimal in the second node of the tandem queue: a counterexample
• Optimal myopic policies and index policies for stochastic scheduling problems
• Solving convex optimization with side constraints in a multi-class queue by adaptive c 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
• Stochastic dynamic job scheduling with interruptible setup and processing times: an approach based on queueing control
• Optimal scheduling of parallel queues using stochastic flow models

This page was built for publication: Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3217401)