Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work

We study the scheduling problem with a common due date on two parallel identical machines and the total early work criterion. The problem is known to be NP-hard. We prove a few dominance properties of optimal solutions of this problem. Their proposal was inspired by the results of some auxiliary computational experiments. Test were performed with the dynamic programming algorithm and list algorithms. Then, we propose the polynomial time approximation scheme, based on structuring problem input. Moreover, we discuss the relationship between the early work criterion and the related late work criterion. We compare the computational complexity and approximability of scheduling problems with both mentioned objective functions.

[1]  Jacek Blazewicz,et al.  Handbook on Scheduling: From Theory to Applications , 2014 .

[2]  Dujuan Wang,et al.  A two-agent single-machine scheduling problem with late work criteria , 2017, Soft Comput..

[3]  Malgorzata Sterna,et al.  Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect , 2017, Comput. Ind. Eng..

[4]  Malgorzata Sterna,et al.  A survey of scheduling problems with late work criteria , 2011 .

[5]  Mohammad Ranjbar,et al.  Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays , 2014 .

[7]  Malgorzata Sterna,et al.  Dominance relations for two-machine flow shop problem with late work criterion , 2007 .

[8]  Yunqiang Yin,et al.  Using a branch-and-bound and a genetic algorithm for a single-machine total late work scheduling problem , 2015, Soft Computing.

[9]  Wang Yong,et al.  Two-agent scheduling problems on a single-machine to minimize the total weighted late work , 2017, J. Comb. Optim..

[10]  Malgorzata Sterna,et al.  Late work minimization in a small flexible manufacturing system , 2007, Comput. Ind. Eng..

[11]  Hung-Ming Chen,et al.  Simulated annealing approach for the single-machine total late work scheduling problem with a position-based learning , 2011, 2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management.

[12]  Chris N. Potts,et al.  A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work , 1994, Math. Oper. Res..

[13]  Malgorzata Sterna,et al.  Late work minimization in flow shops by a genetic algorithm , 2009, Comput. Ind. Eng..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Malgorzata Sterna,et al.  A comparison of solution procedures for two-machine flow shop scheduling with late work criterion , 2005, Comput. Ind. Eng..

[16]  Min Chen,et al.  A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable , 2017, J. Comb. Optim..

[17]  Saeed Hosseinabadi,et al.  Minimizing total weighted late work in the resource-constrained project scheduling problem , 2013 .

[18]  Jacek Blazewicz,et al.  A note on the two machine job shop with the weighted late work criterion , 2007, J. Sched..

[19]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Weighted Late Work , 1995, INFORMS J. Comput..

[20]  Malgorzata Sterna,et al.  Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date , 2005, KI.

[21]  Chris N. Potts,et al.  Approximation algorithms for scheduling a single machine to minimize total late work , 1992, Oper. Res. Lett..

[22]  Gerd Finke,et al.  Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors , 1987, Inf. Process. Lett..

[23]  Sartaj Sahni,et al.  Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

[24]  Dachuan Xu,et al.  The complexity of two supply chain scheduling problems , 2013, Inf. Process. Lett..

[25]  Alessandro Agnetis,et al.  Multiagent Scheduling - Models and Algorithms , 2014 .

[26]  Hadas Shachnai,et al.  Polynomial Time Approximation Schemes , 2018, Handbook of Approximation Algorithms and Metaheuristics.

[27]  Stanislaw Gawiejnowicz,et al.  Time-Dependent Scheduling , 2008, Monographs in Theoretical Computer Science. An EATCS Series.

[28]  Malgorzata Sterna,et al.  Total Late Work Criteria for Shop Scheduling Problems , 2000 .

[29]  Gur Mosheiov,et al.  A single machine scheduling problem to minimize total early work , 2016, Comput. Oper. Res..

[30]  Jacek Blazewicz,et al.  Scheduling preemptible tasks on parallel processors with information loss , 1984 .

[31]  Kuan Yew Wong,et al.  Job shop scheduling problem with late work criterion , 2015 .

[32]  N. Alon,et al.  Approximation schemes for scheduling on parallel machines , 1998 .

[33]  Malgorzata Sterna,et al.  Flow Shop Scheduling with Late Work Criterion - Choosing the Best Solution Strategy , 2004, AACC.

[34]  Xin Chen,et al.  Scheduling on parallel identical machines with late work criterion: Offline and online cases , 2016, J. Sched..

[35]  Chris N. Potts,et al.  Single Machine Scheduling to Minimize Total Late Work , 1992, Oper. Res..

[36]  Malgorzata Sterna,et al.  Open shop scheduling problems with late work criteria , 2004, Discret. Appl. Math..

[37]  Sau-ming Lau,et al.  The effectiveness of a smart school bag system for reminding students of forgotten items and reducing the weight of their bags , 2015, SpringerPlus.

[38]  Javad Rezaeian,et al.  Design of high-performing hybrid meta-heuristics for unrelated parallel machine scheduling with machine eligibility and precedence constraints , 2016 .

[39]  Xiangjie Kong,et al.  Meta-heuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date , 2015, SpringerPlus.

[40]  Malgorzata Sterna,et al.  Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date , 2008, Comput. Oper. Res..

[41]  T.C.E. Cheng,et al.  Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work , 2016 .

[42]  Malgorzata Sterna,et al.  The two-machine flow-shop problem with weighted late work criterion and common due date , 2005, Eur. J. Oper. Res..

[43]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[44]  B. M. T. Lin,et al.  Two-machine flow-shop scheduling to minimize total late work , 2006 .