Skip to Main content Skip to Navigation
New interface
Conference papers

Semi-Online Preemptive Scheduling: One Algorithm for All Variants

Abstract : We present a unified optimal semi-online algorithm for preemptive schedul- ing on uniformly related machines with the objective to minimize the makespan. This algorithm works for all types of semi-online restrictions, including the ones studied before, like sorted (decreasing) jobs, known sum of processing times, known maximal processing time, their combinations, and so on. Based on the analysis of this algorithm, we derive some global relations between various semi-online restrictions and tight bounds on the approximation ratios for a small number of machines.
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Monday, February 9, 2009 - 9:16:10 AM
Last modification on : Friday, February 13, 2009 - 10:44:51 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 8:29:24 PM


Files produced by the author(s)


  • HAL Id : inria-00359630, version 1



Tomas Ebenlendr, Jiri Sgall. Semi-Online Preemptive Scheduling: One Algorithm for All Variants. 26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009, Feb 2009, Freiburg, Germany. pp.349-360. ⟨inria-00359630⟩



Record views


Files downloads