Online scheduling with rearrangement on two related machines

In this paper, we consider an online non-preemptive scheduling problem on two related machines with rearrangement to minimize the completion time, called online scheduling with bounded rearrangement, which is a semi-online problem. Jobs arrive one by one over list. When a new job arrives at most K already scheduled jobs can be removed from the schedule, then all removed jobs and the new job must be assigned to the machines. The problem is a relaxation of the similar problem online scheduling with a buffer [4]. Assume machine M"1 has speed 1 and M"2 has speed s>=1. With respect to the worst case ratio, we obtain that (i) for s>=3 or K>=2, the model of online scheduling with bounded rearrangement is equivalent to the model of online scheduling with a bounded buffer; (ii) the model of online scheduling with bounded rearrangement is more powerful than the model of online scheduling with a bounded buffer for [email protected]?s 1.618 the lower bound is improved.

[1]  Guangzhong Sun,et al.  Study on Parallel Machine Scheduling Problem with Buffer , 2007 .

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

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

[4]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[5]  Leah Epstein,et al.  Online scheduling with a buffer on related machines , 2010, J. Comb. Optim..

[6]  Rudolf Fleischer,et al.  Online Scheduling Revisited , 2000, ESA.

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

[8]  David S. Johnson,et al.  `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.

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

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

[11]  Leah Epstein,et al.  Preemptive Online Scheduling with Reordering , 2009, ESA.

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

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

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

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

[16]  Zhaohui Liu,et al.  Online scheduling with reassignment on two uniform machines , 2010, Theor. Comput. Sci..

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

[18]  Matthias Englert,et al.  The Power of Reordering for Online Minimum Makespan Scheduling , 2008, FOCS.