Stochastic scheduling in a multiclass G/G/1 queue - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

Stochastic scheduling in a multiclass G/G/1 queue


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1746.pdf (483.24 Ko) Télécharger le fichier

Dates and versions

inria-00076986 , version 1 (29-05-2006)


  • 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⟩
70 View
64 Download


Gmail Facebook Twitter LinkedIn More