Improved semi-online makespan scheduling with a reordering buffer

Abstract We study semi-online scheduling with a reordering buffer for identical parallel machines. In this problem, jobs arrive one by one and the online algorithm is equipped with a buffer of limited size, which can be used to reorder the jobs when making scheduling decisions. When the buffer is full, one of the jobs in the buffer must be irrevocably assigned to a machine before the next job can be revealed. No preemption is allowed and the objective is to minimize the makespan. We propose an optimal online algorithm using a buffer size of 2.068m for large m and a 1.5-competitive algorithm using a buffer size of 1.477m, where m is the number of machines. Both results improve upon the best existing buffer sizes for the corresponding competitive ratios by a constant fraction of m.

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

[2]  Matthias Englert,et al.  An overview of some results for reordering buffers , 2011, Computer Science - Research and Development.

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

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

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

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

[7]  Matthias Englert,et al.  The Power of Reordering for Online Minimum Makespan Scheduling , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[8]  Ning Ding,et al.  Online Minimum makespan Scheduling with a Buffer , 2012, Int. J. Found. Comput. Sci..

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

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

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