Weconsider the following non-preemptive semi-online scheduling problem. Jobs with non-increasing sizes arrive one by one to be scheduled on two uniformly related machines, with the goal of minimizing the makespan. We analyze both the optimal overall competitive ratio, and the optimal competitive ratio as a function of the speed ratio (q ≥ 1) between the two machines. We show that the greedy algorithm LPT has optimal competitive ratio ¼ (1 + √17) ≈ 1.28 overall, but does not have optimal competitive ratio for every value of q. Wedetermine the intervals of q where LPT is an algorithm of optimal competitive ratio, and design different algorithms of optimal competitive ratio for the intervals where it fails to be the best algorithm. As a result, we give a tight analysis of the competitive ratio for every speed ratio.
|Title of host publication||Mathematical Foundations of Computer Science 2002 - 27th International Symposium, MFCS 2002, Proceedings|
|Editors||Krzysztof Diks, Wojciech Rytter, Wojciech Rytter|
|Number of pages||12|
|ISBN (Print)||3540440402, 9783540440406|
|State||Published - 2002|
|Event||27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002 - Warsaw, Poland|
Duration: 26 Aug 2002 → 30 Aug 2002
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002|
|Period||26/08/02 → 30/08/02|
Bibliographical noteFunding Information:
– The research of Lene M. Favrholdt was supported in part by the Danish Natural Sci-ence Research Council (SNF) and in part by the Future and Emerging Technologies program of the EU under contract number IST-1999-14186 (ALCOM-FT).
– The research of Leah Epstein was supported in part by the Israel Science Foundation, (grant no. 250/01).
© Springer-Verlag Berlin Heidelberg 2002.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)