Preemptive stochastic online scheduling on two uniform machines
References (13)
- et al.
A note on time sharing
Journal of Combinatorial Theory
(1968) Scheduling with random service times
Management Science
(1966)- et al.
Sequencing tasks with exponential service times to minimize the expected flowtime or makespan
Journal of the ACM
(1981) Optimal scheduling of jobs with exponential service times on identical parallel processors
Operations Research
(1989)- et al.
On the asymptotic optimality of a simple on-line algorithm for the stochastic single machine weighted completion time problem and its extensions
Operations Research
(2006) - et al.
Approximation in stochastic scheduling: the power of LP-based priority policies
Journal of the ACM
(1999)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2008 Elsevier B.V. All rights reserved.