Semi-Online Algorithms for Parallel Machine Scheduling Problems

This paper considers two semi-online versions of scheduling problem P2||Cmax where one type of partial information is available and one type of additional algorithmic extension is allowed simultaneously. For the semi-online version where a buffer of length 1 is available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 5/4. We also show that it does not help that the buffer length is greater than 1. For the semi-online version where two parallel processors are available and the total size of all jobs is known in advance, we present an optimal algorithm with competitive ratio 6/5.

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

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

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

[4]  Yong He,et al.  Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times , 2002 .

[5]  Leah Epstein,et al.  Bin stretching revisited , 2003, Acta Informatica.

[6]  Gerhard J. Woeginger,et al.  A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

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

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

[9]  Susanne Albers.  Better Bounds for Online Scheduling , 1999, SIAM J. Comput..

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

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

[12]  Yong He,et al.  Semi-on-line scheduling with ordinal data on two uniform machines , 2001, Oper. Res. Lett..

[13]  Guochuan Zhang,et al.  A note on on-line scheduling with partial information , 2002 .

[14]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

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

[16]  Yong He,et al.  Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time , 2002, J. Comb. Optim..

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

[18]  Yong He,et al.  Semi-on-line problems on two identical machines with combined partial information , 2002, Oper. Res. Lett..