An Enumeration Algorithm for the No-Wait Flow Shop Problem with Due Date Constraints

Abstract This paper develops an enumeration algorithm for the no-wait flow shop scheduling problem with due date constraints. In this problem, waiting time is not allowed between successive operations of jobs. Plus, each job is accompanied by a due date which is dealt with as a hard constraint. The considered performance criterion is makespan. The problem is strongly NP-hard. In this research, a new modelling approach is developed for the problem. This new modelling technique and the resulting observations are incorporated into a new exact algorithm to solve the problem to optimality. To investigate the performance of the algorithm, a number of test problems are solved and the results are reported. Computational results demonstrate that the developed algorithm is significantly faster than the mathematical models.

[1]  Shaukat A. Brah,et al.  A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors , 1996 .

[2]  Hai Bo Tang,et al.  A New Hybrid Particle Swarm Optimization for Solving Flow Shop Scheduling Problem with Fuzzy due Date , 2011 .

[3]  Christos Koulamas,et al.  An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines , 2012, Eur. J. Oper. Res..

[4]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[5]  Tarek Y. ElMekkawy,et al.  Solving the no-wait flow-shop problem with sequence-dependent set-up times , 2014, Int. J. Comput. Integr. Manuf..

[6]  S.M.T. Fatemi Ghomi,et al.  Hybrid flow shop scheduling with sequence dependent family setup time and uncertain due dates , 2014 .

[7]  King-Wah Pang,et al.  A genetic algorithm based heuristic for two machine no-wait flowshop scheduling problems with class setup times that minimizes maximum lateness , 2013 .

[8]  Hamed Samarghandi,et al.  A particle swarm optimisation for the no-wait flow shop problem with due date constraints , 2015 .

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

[10]  Laya Olfat,et al.  Heuristic rules for tardiness problem in flow shop with intermediate due dates , 2014 .

[11]  Hüseyin Sarper,et al.  Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem , 1995 .

[12]  Chandrasekharan Rajendran,et al.  Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date , 2001, Eur. J. Oper. Res..

[13]  Kut C. So,et al.  A due-date assignment model for a flow shop with application in a lightguide cable shop , 1991 .

[14]  Pankaj Chandna,et al.  Hybrid genetic algorithm for SDST flow shop scheduling with due dates: a case study , 2010, Int. J. Adv. Oper. Manag..

[15]  Rubén Ruiz,et al.  No-wait flowshop with separate setup times to minimize maximum lateness , 2007 .

[16]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[17]  Ali Allahverdi,et al.  No-Wait Flowshops to Minimize Total Tardiness with Setup Times , 2015 .

[18]  Marcelo Seido Nagano,et al.  Review and classification of constructive heuristics mechanisms for no-wait flow shop problem , 2016 .

[19]  T. Elmekkawy,et al.  A meta-heuristic approach for solving the no-wait flow-shop problem , 2012 .

[20]  J. R. Shah,et al.  Performance of priority rules in a due date flow shop , 1992 .

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

[22]  Amir Hasanzadeh,et al.  A GRASP algorithm for the two-machine flow-shop problem with weighted late work criterion and common due date , 2009, 2009 IEEE International Conference on Industrial Engineering and Engineering Management.

[23]  Jatinder N. D. Gupta,et al.  On the Solution of 2-Machine Flow Shop Problems With a Common Due Date , 2000 .