Interchange arguments in stochastic scheduling

DOI10.2307/3214386zbMath0689.90030OpenAlexW2011324725MaRDI QIDQ3032047

Jean Walrand, Pantelis Tsoucas, Philippe Nain

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

communicationfeedbacktandem queuesblockingoptimal policiesmulticlass networkBernoulli routinglossy channelsInterchange argumentsmulticlass tandemoptimality of priority list policies

Mathematics Subject Classification ID

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

Related Items (8)

Stochastic scheduling of parallel queues with set-up costs ⋮ Interchange arguments for classical scheduling problems in queues ⋮ Sample path methods in the control of queues ⋮ Flow time distributions in a \(K\) class \(M/G/1\) priority feedback queue ⋮ 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 ⋮ A survey of Markov decision models for control of networks of queues ⋮ Whittle indexability in egalitarian processor sharing systems

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