Better bounds for online scheduling

We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goal is to minimize the makespan. Bartal et al. (J. Comput. System Sci., 51 (1995), pp. 359{366) gave a deterministic online algorithm that is 1.986-competitive. Karger, Phillips, and Torng (J. Algorithms, 20 (1996), pp. 400{430) generalized the algorithm and proved an upper bound of 1.945. The best lower bound currently known on the competitive ratio that can be achieved by deterministic online algorithms is equal to 1.837. In this paper we present an improved deterministic online scheduling algorithm that is 1.923-competitive; for all m 2. The algorithm is based on a new scheduling strategy, i.e., it is not a generalization of the approach by Bartal et al. Also, the algorithm has a simple structure. Furthermore, we develop a better lower bound. We prove that, for general m, no deterministic online scheduling algorithm can be better than 1.852-competitive.

[1]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[2]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[3]  David R. Karger,et al.  A better algorithm for an ancient scheduling problem , 1994, SODA '94.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Amos Fiat,et al.  New algorithms for an ancient scheduling problem , 1992, STOC '92.

[6]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[7]  Amos Fiat,et al.  On-line routing of virtual circuits with applications to load balancing and machine scheduling , 1997, JACM.

[8]  B. Awerbuch,et al.  Load Balancing in the Lp Norm , 1995, FOCS 1995.

[9]  Leen Stougie,et al.  Multiprocessing scheduling with rejection. Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms (SODA), January 28-30, Atlanta, Georgia, USA, 1996 , 1996 .

[10]  Ming-Yang Kao,et al.  Load balancing in the L/sub p/ norm , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[11]  Gerhard J. Woeginger,et al.  An On-Line Scheduling Heuristic With Better Worst Case Ratio Than Graham's List Scheduling , 1993, SIAM J. Comput..

[12]  György Turán,et al.  On the performance of on-line algorithms for partition problems , 1989, Acta Cybern..

[13]  Gerhard J. Woeginger,et al.  New lower and upper bounds for on-line scheduling , 1994, Oper. Res. Lett..

[14]  David P. Williamson,et al.  Scheduling Parallel Machines On-Line , 1995, SIAM J. Comput..

[15]  Yuval Rabani,et al.  A Better Lower Bound for On-Line Scheduling , 1994, Inf. Process. Lett..

[16]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.