Article contents
Stochastic Scheduling in Priority Queues with Strict Deadlines
Published online by Cambridge University Press: 27 July 2009
Abstract
Tasks belonging to N priority classes arrive for processing in a single or multiserver facility. If the processing does not begin by a certain time (deterministic or random), the task is lost and a cost is incurred. We determine properties of dynamic, nonidling, nonpreemptive strategies that minimize an infinite horizon expected cost.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 7 , Issue 2 , April 1993 , pp. 273 - 289
- Copyright
- Copyright © Cambridge University Press 1993
References
- 6
- Cited by