论文信息 - Randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors

Randomized On-Line Scheduling Similar Jobs to Minimize Makespan on Two Identical Processors

In this paper we consider an on-line scheduling problem, where jobs with similar processing times within [1, r] arrive one by one to be scheduled in an on-line setting on two identical parallel processors without preemption. The objective is to minimize makespan. We devise a randomized on-line algorithm for this problem along with a lower bound.

Donglei Du | D. Du

[1] Gerhard J. Woeginger,et al. A Lower Bound for Randomized On-Line Scheduling Algorithms , 1994, Information Processing Letters.

[2] Gerhard J. Woeginger,et al. An Optimal Algorithm for Preemptive On-line Scheduling , 1994, ESA.

[3] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .

[4] Guochuan Zhang,et al. Semi On-Line Scheduling on Two Identical Machines , 1999, Computing.

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

[6] Jeffrey B. Sidney,et al. Ordinal algorithms for parallel machine scheduling , 1996, Oper. Res. Lett..

[7] Eugene L. Lawler,et al. Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[8] Zsolt Tuza,et al. Semi on-line algorithms for the partition problem , 1997, Oper. Res. Lett..

[9] Eugene L. Lawler,et al. Sequencing and Scheduling: Algorithms and Complexity, in Logistics of production and inventory , 1993 .

[10] N. S. Barnett,et al. Private communication , 1969 .

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

[12] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .