Interchange arguments for classical scheduling problems in queues

DOI10.1016/0167-6911(89)90011-XzbMath0672.90050MaRDI QIDQ1120461

Philippe Nain

Publication date: 1989

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

zbMATH Keywords

stochastic schedulingcoupling\(\mu \) c-ruleindex-rulepartial feedbackscheduling problems in queues

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22)

Related Items (12)

The existence of sensitive optimal policies in two multi-dimensional queueing models ⋮ Stochastic scheduling of parallel queues with set-up costs ⋮ Sample path methods in the control of queues ⋮ Dynamically scheduling and maintaining a flexible server ⋮ Two‐class constrained optimization with applications to queueing control ⋮ Dynamic control of a single-server system with abandonments ⋮ Dynamic scheduling with uncertain job types ⋮ On the introduction of an agile, temporary workforce into a tandem queueing system ⋮ A survey of Markov decision models for control of networks of queues ⋮ Optimal server assignment in the case of service times with monotone failure rates ⋮ Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration ⋮ Whittle indexability in egalitarian processor sharing systems

Cites Work

• Unnamed Item
• K competing queues with geometric service requirements and linear costs: The \(\mu\) c-rule is always optimal
• Point processes and queues. Martingale dynamics
• On optimal right-of-way policies at a single-server station when insertion of idle times is permitted
• Interchange arguments in stochastic scheduling
• The cμ rule revisited
• Dynamic Scheduling of a Multiclass Queue: Discount Optimality
• Time-Sharing Service Systems. I

This page was built for publication: Interchange arguments for classical scheduling problems in queues