Preemptive stochastic online scheduling on two uniform machines
- 16 March 2009
- journal article
- research article
- Published by Elsevier in Information Processing Letters
- Vol. 109 (7) , 369-375
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Models and Algorithms for Stochastic Online SchedulingMathematics of Operations Research, 2006
- On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its ExtensionsOperations Research, 2006
- Approximation in Preemptive Stochastic Online Scheduling2006
- Approximation in stochastic schedulingJournal of the ACM, 1999
- On almost optimal priority rules for preemptive scheduling of stochastic jobs on parallel machinesAdvances in Applied Probability, 1995
- Optimal Scheduling of Jobs with Exponential Service Times on Identical Parallel ProcessorsOperations Research, 1989
- Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or MakespanJournal of the ACM, 1981
- Scheduling for Minimum Total Loss Using Service Time DistributionsJournal of the ACM, 1974
- A note on time-sharingJournal of Combinatorial Theory, 1968
- Scheduling with Random Service TimesManagement Science, 1966