HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Stochastic scheduling in a multiclass G/G/1 queue

Abstract : We address the problem of scheduling customers in a multiclass G/G/1 queue so as to minimize a weighted sum of the workloads of the different classes. We establish that the nonidling, preemptive, fixed prority policy that schedules customers belonging to the class having the maximum weight minimizes the cost function pathwise at any point in time. This result is based on the application of elementary forward induction arguments and is shown to hold for a very general class of policies. A new proof for the optimality of the c-rule in the multiclass G/M/1 queue is then obtained as an easy corollary of the first result.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Monday, May 29, 2006 - 11:46:27 AM
Last modification on : Friday, February 4, 2022 - 3:16:28 AM
Long-term archiving on: : Friday, May 13, 2011 - 10:22:25 PM


  • HAL Id : inria-00076986, version 1



Philippe Nain, Don Towsley. Stochastic scheduling in a multiclass G/G/1 queue. [Research Report] RR-1746, INRIA. 1992. ⟨inria-00076986⟩



Record views


Files downloads