Further results for dynamic scheduling of multiclass G/G/1 queues
- 1 March 1989
- journal article
- research article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 26 (03) , 595-603
- https://doi.org/10.1017/s0021900200038183
Abstract
We consider discrete-time dynamic scheduling problems of the following three types ofG/G/1 queue withKdifferent customer classes: (i) aG/DFR/1 queue withKclasses under preemptive resume service discipline, (ii) aG/IFR/1 queue with two classes under preemptive resume service discipline, and (iii) aG/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 aG/M/1 queue by Buyukkoc et al. (1985) to general queues.Keywords
This publication has 10 references indexed in Scilit:
- Convex ordering of sojourn times in single-server queues: extremal properties of FIFO and LIFO service disciplinesJournal of Applied Probability, 1987
- NONPREEMPTIVE SCHEDULING OF A FINITE-SOURCE QUEUE WITH TWO CUSTOMER CLASSESJournal of the Operations Research Society of Japan, 1987
- Extensions of the multiarmed bandit problem: The discounted caseIEEE Transactions on Automatic Control, 1985
- The cμ rule revisitedAdvances in Applied Probability, 1985
- On the evaluation of fixed permutations as strategies in stochastic schedulingStochastic Processes and their Applications, 1982
- Arm-Acquiring BanditsThe Annals of Probability, 1981
- Multiserver scheduling of jobs with increasing completion ratesJournal of Applied Probability, 1981
- Scheduling tasks with exponential service times on parallel processorsJournal of Applied Probability, 1979
- Dynamic Scheduling of a Multiclass Queue: Discount OptimalityOperations Research, 1975
- Work-conserving prioritiesJournal of Applied Probability, 1970