Semi-online scheduling with GoS eligibility constraints

We consider semi-online scheduling problems on parallel machines to minimize the makespan subject to Grade of Service (GoS) eligibility constraints with different prior information: (1) the known total processing time, (2) the known largest processing time, (3) the known both total and largest processing times and (4) the known optimal makespan. For semi-online problems with different numbers of machines and information, we present a unified algorithm. Then we provide lower bounds of the competitive ratio for any algorithm and prove the competitive ratio of the proposed algorithm.

[1]  Chung-Lun Li,et al.  Scheduling parallel machines with inclusive processing set restrictions and job release times , 2010, Eur. J. Oper. Res..

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

[3]  Joseph Y.-T. Leung,et al.  Makespan minimization in online scheduling with machine eligibility , 2013, Ann. Oper. Res..

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

[5]  T. C. Edwin Cheng,et al.  Semi-on-line multiprocessor scheduling with given total processing time , 2005, Theor. Comput. Sci..

[6]  Yossi Azar,et al.  The competitiveness of on-line assignments , 1992, SODA '92.

[7]  He Yong,et al.  Optimal online algorithms for scheduling on two identical machines under a grade of service , 2006 .

[8]  Kangbok Lee,et al.  Improved bounds for online scheduling with eligibility constraints , 2011, Theor. Comput. Sci..

[9]  Kangbok Lee,et al.  Semi-online scheduling problems on a small number of machines , 2013, J. Sched..

[10]  Zhiyi Tan,et al.  Online hierarchical scheduling: An approach using mathematical programming , 2011, Theor. Comput. Sci..

[11]  Cai Sheng-yi.  Semi Online Scheduling on Three Identical Machines , 2002 .

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

[13]  Chung-Lun Li,et al.  Scheduling with processing set restrictions: A survey , 2008 .

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

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

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

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

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

[19]  Celia A. Glass,et al.  Parallel machine scheduling with job assignment restrictions , 2007 .

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