Interchange arguments for classical scheduling problems in queues

DOI10.1016/0167-6911(89)90011-XMaRDI QIDQ1120461zbMATH OpenFDO

Authors Philippe Nain

Publication date 1989

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

zbMATH Keywords

couplingstochastic scheduling\(\mu \) c-ruleindex-rulepartial feedbackscheduling problems in queues

Mathematics Subject Classification ID

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

Recommendations

• Interchange arguments in stochastic scheduling
• The cμ rule revisited
• Simultaneous optimization of flow control and scheduling in a single server queue with two job classes
• Dynamic scheduling with convex delay costs: The generalized \(c\mu\) rule
• Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal

Cites work

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

Cited in

(13)

• Dynamically scheduling and maintaining a flexible server
• Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration
• Stochastic scheduling of parallel queues with set-up costs
• On the introduction of an agile, temporary workforce into a tandem queueing system
• Dynamic control of a single-server system with abandonments
• Dynamic scheduling with uncertain job types
• 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
• Sample path methods in the control of queues
• Two‐class constrained optimization with applications to queueing control
• Interchange arguments in stochastic scheduling
• Whittle indexability in egalitarian processor sharing systems
• The existence of sensitive optimal policies in two multi-dimensional queueing models

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

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