LP-based online scheduling: from single to parallel machines
- 4 January 2008
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 119 (1) , 109-136
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release datesMathematical Programming, 2005
- On-line scheduling to minimize average completion time revisitedOperations Research Letters, 2004
- An experimental study of online scheduling algorithmsACM Journal of Experimental Algorithmics, 2002
- Randomized algorithms for on-line scheduling problems: how low can't you go?Operations Research Letters, 2002
- The power of?-points in preemptive single machine schedulingJournal of Scheduling, 2002
- Single Machine Scheduling with Release DatesSIAM Journal on Discrete Mathematics, 2002
- Scheduling Unrelated Machines by Randomized RoundingSIAM Journal on Discrete Mathematics, 2002
- Approximation Techniques for Average Completion Time SchedulingSIAM Journal on Computing, 2001
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956