Semi-online scheduling with decreasing job sizes

  • Authors:

  • Steve Seiden;Jiřı Sgall;Gerhard Woeginger

  • Affiliations:

  • Department of Computer Science, Louisiana State University, 298 Coates Hall, Baton Rouge, LA 70803, USA;Mathematical Institute, AS CR, itná 25, CZ-11567 Praha 1, Czech Republic and Department of Applied Mathematics, Faculty of Mathematics and Physics, Charles University, Praha, Czech Republic;Institut für Mathematik, Technische Universität Graz, Steyrergasse 30, A-8010 Graz, Austria

  • Venue:
  • Operations Research Letters
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

Abstract

We investigate the problem of semi-online scheduling jobs on m identical parallel machines where the jobs arrive in order of decreasing sizes. We present a complete solution for the preemptive variant of semi-online scheduling with decreasing job sizes. We give matching lower and upper bounds on the competitive ratio for any fixed number m of machines; these bounds tend to (1+3)/2~1.36603, as the number of machines goes to infinity. Our results are also the best possible for randomized algorithms. For the non-preemptive variant of semi-online scheduling with decreasing job sizes, a result of Graham (SIAM J. Appl. Math. 17 (1969) 263-269) yields a (4/3-1/(3m))-competitive deterministic non-preemptive algorithm. For m=2 machines, we prove that this algorithm is the best possible (it is 7/6-competitive). For m=3 machines we give a lower bound of (1+37)/6~1.18046. Finally, we present a randomized non-preemptive 8/7-competitive algorithm for m=2 machines and prove that this is optimal.