Improved approximation algorithms for parallel machine scheduling with release dates and job rejection

In this paper we study a parallel machine scheduling model with different job release dates, where each job is either accepted and processed by a machine at or after its release date, or it is rejected and a certain penalty cost is paid. The objective is to minimize the makespan of the accepted job plus the total penalty of all rejected jobs. The scheduling problem is NP-hard in the strong sense. Zhang and Lu (4OR A Q J Oper Res 14:165–172, 2016) have proposed a 2-approximation for the problem, and a fully polynomial time approximation scheme (FPTAS) for the special case when the number of machines m is fixed. In this paper we present an improved 2-approximation and a polynomial time approximation scheme for the problem. We also propose an improved FPTAS for the case when m is fixed.

[1]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[2]  Monaldo Mastrolilli,et al.  Efficient Approximation Schemes for Scheduling Problems with Release Dates and Delivery Times , 2003, J. Sched..

[3]  Xueling Zhong,et al.  Scheduling with release times and rejection on two parallel machines , 2017, J. Comb. Optim..

[4]  Xuejie Zhang,et al.  Penalty cost constrained identical parallel machine scheduling problem , 2015, Theor. Comput. Sci..

[5]  Dan Gusfield,et al.  Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines , 1984, J. Algorithms.

[6]  Dvir Shabtay,et al.  A survey on offline scheduling with rejection , 2013, J. Sched..

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

[8]  Guoqing Wang,et al.  An improved heuristic for parallel machine scheduling with rejection , 2015, Eur. J. Oper. Res..

[9]  Jinjiang Yuan,et al.  Single machine scheduling with release dates and rejection , 2009, Eur. J. Oper. Res..

[10]  Chung-Lun Li,et al.  Faster algorithms for single machine scheduling with release dates and rejection , 2016, Inf. Process. Lett..

[11]  Jinwen Ou,et al.  Order acceptance and scheduling with consideration of service level , 2016, Annals of Operations Research.

[12]  Joseph Y.-T. Leung,et al.  Improved algorithms for single machine scheduling with release dates and rejections , 2016, 4OR.

[13]  Klaus Jansen,et al.  Grouping Techniques for Scheduling Problems: Simpler and Faster , 2008, Algorithmica.

[14]  Leen Stougie,et al.  Multiprocessor scheduling with rejection , 1996, SODA '96.

[15]  Bo Chen,et al.  Scheduling on identical machines: How good is LPT in an on-line setting? , 1997, Oper. Res. Lett..

[16]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[17]  David B. Shmoys,et al.  Approximation schemes for constrained scheduling problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[18]  Susan A. Slotnick,et al.  Order acceptance and scheduling: A taxonomy and review , 2011, Eur. J. Oper. Res..

[19]  Lingfa Lu,et al.  Parallel-machine scheduling with release dates and rejection , 2016, 4OR.