Article contents
The Stochastic Optimality of SEPT in Parallel Machine Scheduling
Published online by Cambridge University Press: 27 July 2009
Abstract
We consider preemptive scheduling on parallel machines where processing times of jobs are i.i.d. but jobs may already have received distinct amounts of service. We show that when processing times are increasing in likelihood ratio, SEPT (shortest expected [remaining] processing time first) stochastically minimizes any increasing and Schur-concave function of the job completion times. The same result holds when processing times are exponential with possibly different means.
- Type
- Research Article
- Information
- Probability in the Engineering and Informational Sciences , Volume 8 , Issue 2 , April 1994 , pp. 179 - 188
- Copyright
- Copyright © Cambridge University Press 1994
References
- 2
- Cited by