Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-17T02:09:28.494Z Has data issue: false hasContentIssue false

Further results for dynamic scheduling of multiclass G/G/1 queues

Published online by Cambridge University Press:  14 July 2016

Tetsuji Hirayama*
Affiliation:
University of Electro-communications
Masaaki Kijima*
Affiliation:
Tokyo Institute of Technology
Shoichi Nishimura*
Affiliation:
University of Tsukuba
*
∗ Postal address: Department of Communications and Systems Engineering, University of Electro-communications, Chofugaoka, Chofu-shi, Tokyo 182, Japan.
∗∗ Present address: Graduate School of Management, University of Tsukuba, Tokyo, Otsuka, Bunkyoku, Tokyo, Japan.
∗∗∗ Postal address: Institute of Socio-Economic Planning, University of Tsukuba, Tsukuba, Ibaraki 305, Japan.

Abstract

We consider discrete-time dynamic scheduling problems of the following three types of G/G/1 queue with K different customer classes: (i) a G/DFR/1 queue with K classes under preemptive resume service discipline, (ii) a G/IFR/1 queue with two classes under preemptive resume service discipline, and (iii) a G/G/1 queue with two classes under non-preemptive service discipline. Interchange arguments are used to show that simple index policies of different type minimize the total holding cost of customers in a finite-horizon scheduling period for the three cases. Our results extend the result for a G/M/1 queue by Buyukkoc et al. (1985) to general queues.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1989 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable