Open Access
August, 1995 Dynamic Scheduling with Convex Delay Costs: The Generalized c|mu Rule
Jan A. van Mieghem
Ann. Appl. Probab. 5(3): 809-833 (August, 1995). DOI: 10.1214/aoap/1177004706

Abstract

We consider a general single-server multiclass queueing system that incurs a delay cost Ck(τk) for each class k job that resides τk units of time in the system. This paper derives a scheduling policy that minimizes the total cumulative delay cost when the system operates during a finite time horizon. Denote the marginal delay cost function and the (possibly nonstationary) average processing time of class k by ck=Ck and 1/μk, respectively, and let ak(t) be the "age" or time that the oldest class k job has been waiting at time t. We call the scheduling policy that at time t serves the oldest waiting job of that class k with the highest index μk(t)ck(ak(t)), the generalized cμ rule. As a dynamic priority rule that depends on very little data, the generalized cμ rule is attractive to implement. We show that, with nondecreasing convex delay costs, the generalized cμ rule is asymptotically optimal if the system operates in heavy traffic and give explicit expressions for the associated performance characteristics: the delay (throughput time) process and the minimum cumulative delay cost. The optimality result is robust in that it holds for a countable number of classes and several homogeneous servers in a nonstationary, deterministic or stochastic environment where arrival and service processes can be general and interdependent.

Citation

Download Citation

Jan A. van Mieghem. "Dynamic Scheduling with Convex Delay Costs: The Generalized Rule." Ann. Appl. Probab. 5 (3) 809 - 833, August, 1995. https://doi.org/10.1214/aoap/1177004706

Information

Published: August, 1995
First available in Project Euclid: 19 April 2007

zbMATH: 0843.90047
MathSciNet: MR1359830
Digital Object Identifier: 10.1214/aoap/1177004706

Subjects:
Primary: 90B35
Secondary: 60J70 , 60K25 , 90B22 , 93E20

Keywords: rule , asymptotic optimality , dynamic priorties , heavy traffic limit , production control , queueing systems , scheduling

Rights: Copyright © 1995 Institute of Mathematical Statistics

Vol.5 • No. 3 • August, 1995
Back to Top