Semi-online scheduling with two GoS levels and unit processing time

In this paper, we consider two semi-online scheduling problems of parallel machines with two GoS (grade of service) levels and unit processing time, in which the objective is to minimize the makespan. Assume that the GoS levels of the first s machines are 2 and that of the last (m-s) machines are 1 where m is the number of machines. The first problem is the lookahead version where an online algorithm is able to foresee the information of the next k jobs. The second problem is the buffer version where a buffer is available for storing at most g jobs. For the both versions, we prove that the lookahead ability or the buffer is useless for designing algorithm when k

[1]  Yiwei Jiang,et al.  Online scheduling on parallel machines with two GoS levels , 2006, J. Comb. Optim..

[2]  Zhiyi Tan,et al.  Online parallel machines scheduling with two hierarchies , 2009, Theor. Comput. Sci..

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

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

[5]  Rex K. Kincaid,et al.  A look-ahead heuristic for scheduling jobs with release dates on a single machine , 1994, Comput. Oper. Res..

[6]  Haitao Wang,et al.  New algorithms for online rectangle filling with k-lookahead , 2011, J. Comb. Optim..

[7]  Xin Chen,et al.  Semi-online hierarchical scheduling problems with buffer or rearrangements , 2013, Inf. Process. Lett..

[8]  Joseph Naor,et al.  On-Line Load Balancing in a Hierarchical Server Topology , 2002, SIAM J. Comput..

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

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

[11]  Kangbok Lee,et al.  Parallel machine scheduling under a grade of service provision , 2004, Comput. Oper. Res..

[12]  Chung-Lun Li,et al.  Scheduling parallel machines with inclusive processing set restrictions , 2008 .

[13]  Lidan Fan,et al.  Optimal online algorithms on two hierarchical machines with tightly-grouped processing times , 2015, J. Comb. Optim..

[14]  Yin-Feng Xu,et al.  Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times , 2011, J. Comb. Optim..

[15]  Zhaohui Liu,et al.  Semi-online scheduling problems on two uniform machines under a grade of service provision , 2013, Theor. Comput. Sci..

[16]  Yong Wu,et al.  Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision , 2012 .

[17]  Kangbok Lee,et al.  Online and semi-online scheduling of two machines under a grade of service provision , 2006, Oper. Res. Lett..

[18]  Liu Chen.  Schedule Unit-length Jobs on Parallel Machines with GOS Levels , 2008 .

[19]  Dvir Shabtay,et al.  Online scheduling of two job types on a set of multipurpose machines with unit processing times , 2012, Comput. Oper. Res..

[20]  Ning Ding,et al.  Online Minimum Makespan Scheduling with a Buffer , 2012, FAW-AAIM.