Online Minimum makespan Scheduling with a Buffer

In this paper we study an online minimum makespan scheduling problem with a reordering buffer. We obtain the following results: (i) for m > 51 identical machines, we give a 1.5-competitive online algorithm with a buffer of size ⌈1.5m⌉; (ii) for three identical machines, we give an optimal online algorithm with a buffer size six, better than the previous nine; (iii) for m uniform machines, using a buffer of size m, we improve the competitive ratio from 2 + e to 2 − 1/m+ e, where e > 0 is sufficiently small and m is a constant.

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

[2]  Rui Fan,et al.  Improved semi-online makespan scheduling with a reordering buffer , 2013, Inf. Process. Lett..

[3]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

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

[5]  Marek Karpinski,et al.  On-Line Load Balancing for Related Machines , 1997, J. Algorithms.

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

[7]  Leah Epstein,et al.  Optimal preemptive semi-online scheduling to minimize makespan on two related machines , 2002, Oper. Res. Lett..

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

[9]  Yin-Feng Xu,et al.  Online scheduling on two uniform machines to minimize the makespan , 2009, Theor. Comput. Sci..

[10]  Xin Chen,et al.  Optimal algorithms for online scheduling with bounded rearrangement at the end , 2011, Theor. Comput. Sci..

[11]  Shaohua Yu,et al.  Online scheduling with reassignment , 2008, Oper. Res. Lett..

[12]  Donald K. Friesen,et al.  Tighter Bounds for LPT Scheduling on Uniform Processors , 1987, SIAM J. Comput..

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

[14]  Yuxin Wang,et al.  Online scheduling with rearrangement on two related machines , 2011, Theor. Comput. Sci..

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

[16]  Martin Skutella,et al.  Online Scheduling with Bounded Migration , 2004, Math. Oper. Res..

[17]  David B. Shmoys,et al.  A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach , 1988, SIAM J. Comput..