Interchange arguments for classical scheduling problems in queues
From MaRDI portal
Publication:1120461
DOI10.1016/0167-6911(89)90011-XzbMath0672.90050MaRDI QIDQ1120461
Publication date: 1989
Published in: Systems \& Control Letters (Search for Journal in Brave)
stochastic scheduling; coupling; \(\mu \) c-rule; index-rule; partial feedback; scheduling problems in queues
90B35: Deterministic scheduling theory in operations research
90B22: Queues and service in operations research
Related Items
Dynamic control of a single-server system with abandonments, 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, Stochastic scheduling of parallel queues with set-up costs, Sample path methods in the control of queues, Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration, On the introduction of an agile, temporary workforce into a tandem queueing system, The existence of sensitive optimal policies in two multi-dimensional queueing models
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