Semi-Online Scheduling on Two Machines with GoS Levels and Partial Information of Processing Time

This paper investigates semi-online scheduling problems on two parallel machines under a grade of service (GoS) provision subject to minimize the makespan. We consider three different semi-online versions with knowing the total processing time of the jobs with higher GoS level, knowing the total processing time of the jobs with lower GoS level, or knowing both in advance. Respectively, for the three semi-online versions, we develop algorithms with competitive ratios of 3/2, 20/13, and 4/3 which are shown to be optimal.

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

[2]  Gerhard J. Woeginger.  A comment on parallel-machine scheduling under a grade of service provision to minimize makespan , 2009, Inf. Process. Lett..

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

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

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

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

[8]  Yong Wu,et al.  Optimal Semi-online Scheduling Algorithms on Two Parallel Identical Machines under a Grade of Service Provision , 2010, AAIM.

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

[10]  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..

[11]  T. C. Edwin Cheng,et al.  An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan , 2008, Inf. Process. Lett..

[12]  Neil Genzlinger.  A. and Q , 2006 .

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

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

[15]  W. Marsden.  I and J , 2012 .

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