论文信息 - Online scheduling with reassignment

Online scheduling with reassignment

This paper studies online scheduling problems with reassignment on two identical machines. We can reassign some jobs under certain rules after all the jobs have been assigned. Three different versions are studied and optimal algorithms are proposed.

Shaohua Yu | Zhiyi Tan

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

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

[3] Ramaswamy Chandrasekaran,et al. Improved Bounds for the Online Scheduling Problem , 2003, SIAM J. Comput..

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

[5] Martin Skutella,et al. Online Scheduling with Bounded Migration , 2004, ICALP.

[6] Rudolf Fleischer,et al. On‐line scheduling revisited , 2000 .

[7] Susanne Albers,et al. On randomized online scheduling , 2002, STOC '02.

[8] Yossi Azar,et al. On-line bin-stretching , 1998, Theor. Comput. Sci..

[9] Guochuan Zhang,et al. A Simple Semi On-Line Algorithm for P2//C_{max} with a Buffer , 1997, Inf. Process. Lett..

[10] Gerhard J. Woeginger,et al. Semi-online scheduling with decreasing job sizes , 2000, Oper. Res. Lett..

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