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.
Type de document :
[Research Report] RR-1746, INRIA. 1992
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : lundi 29 mai 2006 - 11:46:27
Dernière modification le : samedi 27 janvier 2018 - 01:31:33
Document(s) archivé(s) le : vendredi 13 mai 2011 - 22:22:25



  • 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〉



Consultations de la notice


Téléchargements de fichiers