Interchange arguments in stochastic scheduling

DOI10.2307/3214386MaRDI QIDQ3032047zbMATH OpenOpenAlexFDO

Authors Philippe Nain, Pantelis Tsoucas, Jean Walrand

Publication date 1989

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1903/4821

zbMATH Keywords

communicationfeedbackblockingtandem queuesmulticlass networkoptimal policiesBernoulli routinglossy channelsInterchange argumentsmulticlass tandemoptimality of priority list policies

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Deterministic scheduling theory in operations research (90B35) Queueing theory (aspects of probability theory) (60K25) Stochastic network models in operations research (90B15)

Recommendations

• Interchange arguments for classical scheduling problems in queues
• Optimal Multiserver Stochastic Scheduling of two Interconnected Priority Queues
• Optimal Scheduling of Multiclass Stochastic Systems
• Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network
• Optimality of index policies for stochastic scheduling with switching penalties

Cited in

(9)

• Stochastic scheduling of parallel queues with set-up costs
• Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue
• The µc-rule is not optimal in the second node of the tandem queue: a counterexample
• A survey of Markov decision models for control of networks of queues
• Mathematical problems in the theory of processor-sharing queueing systems
• Optimal control of a deterministic multiclass queuing system for which several queues can be served simultaneously
• Interchange arguments for classical scheduling problems in queues
• Sample path methods in the control of queues
• Whittle indexability in egalitarian processor sharing systems

This page was built for publication: Interchange arguments in stochastic scheduling

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