论文信息 - A lower bound for on-line scheduling on uniformly related machines

A lower bound for on-line scheduling on uniformly related machines

We consider the problem of on-line scheduling of jobs arriving one by one on uniformly related machines, with or without preemption. We prove a lower bound of 2, both with and without preemption, for randomized algorithms working for an arbitrary number of machines. For a constant number of machines we give new lower bounds for the preemptive case.

Jirí Sgall | Leah Epstein | J. Sgall | L. Epstein

[1] Gerhard J. Woeginger,et al. Developments from a June 1996 seminar on Online algorithms: the state of the art , 1998 .

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

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

[4] Teofilo F. Gonzalez,et al. Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[5] Gerhard J. Woeginger,et al. An optimal algorithm for preemptive on-line scheduling , 1995, Oper. Res. Lett..

[6] Marek Karpinski,et al. On-line Load Balancing for Related Machines , 1997, WADS.

[7] Jirí Sgall. A Lower Bound for Randomized On-Line Multiprocessor Scheduling , 1997, Inf. Process. Lett..

[8] Donglei Du,et al. Preemptive on-line scheduling for two uniform processors , 1998, Oper. Res. Lett..

[9] Yossi Azar,et al. On-line load balancing , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[10] Susanne Albers,et al. Better bounds for online scheduling , 1997, STOC '97.

[11] Gerhard J. Woeginger,et al. Online Algorithms , 1998, Lecture Notes in Computer Science.

[12] Shui Lam,et al. A Level Algorithm for Preemptive Scheduling , 1977, J. ACM.

[13] Gerhard J. Woeginger,et al. Randomized online scheduling on two uniform machines , 2001, SODA '99.

[14] Jirí Sgall,et al. On-line Scheduling , 1996, Online Algorithms.