Setting a common due date in a constrained flowshop: A variable neighbourhood search approach

In this paper we study a due date setting problem in a flowshop layout. The problem consists of scheduling a set of jobs arriving to the system together with jobs already present (denoted as old jobs), in order to set a common due date for the new jobs. Since the old jobs have a common due date that must not be violated, our problem is a rescheduling problem with the objective of minimising the makespan of the new jobs (thus obtaining the tightest possible due date for the new jobs) and a constraint since the maximum tardiness of the old jobs must be equal to zero. This approach leads to an interesting scheduling problem in which two different objectives are considered, each one for a subset of the jobs that must be scheduled. To the best of our knowledge, this type of problems have been scarcely considered in the literature, and only for very specific purposes. Since our problem is clearly NP-hard, a new heuristic based on variable neighbourhood search (VNS) has been designed. The computational results show that our proposed heuristic outperforms two existing heuristic methods for similar problems in the literature.

[1]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[2]  Rainer Leisten,et al.  Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm , 2008 .

[3]  Rainer Leisten,et al.  A heuristic for scheduling a permutation flowshop with makespan objective subject to maximum tardiness , 2006 .

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

[5]  Jose M Framinan,et al.  Handling variability for robust order promising and fulfilment , 2009, 2009 International Conference on Computers & Industrial Engineering.

[6]  V. T’kindt,et al.  Rescheduling for new orders on a single machine with setup times , 2009 .

[7]  Purushothaman Damodaran,et al.  Scheduling identical parallel batch processing machines to minimise makespan using genetic algorithms , 2009 .

[8]  Chandrasekharan Rajendran,et al.  Scheduling in flowshops to minimize total tardiness of jobs , 2004 .

[9]  Kevin J. Dooley,et al.  Dynamic rules for due-date assignment , 1991 .

[10]  F. Glover,et al.  Handbook of Metaheuristics , 2019, International Series in Operations Research & Management Science.

[11]  Ali Allahverdi,et al.  A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2004, Comput. Oper. Res..

[12]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[13]  Débora P. Ronconi,et al.  Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date , 2009, Comput. Oper. Res..

[14]  Chung-Yee Lee,et al.  Parallel machines scheduling with nonsimultaneous machine available time , 1991, Discret. Appl. Math..

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

[16]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[17]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[18]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[19]  R. Warburton,et al.  EOQ extensions exploiting the Lambert W function , 2009 .

[20]  Reha Uzsoy,et al.  Rescheduling on a single machine with part-type dependent setup times and deadlines , 1997, Ann. Oper. Res..

[21]  Scott Turner,et al.  Comparison of heuristics for flow shop sequencing , 1987 .

[22]  Sanjay Sharma,et al.  On price increases and temporary price reductions with partial backordering , 2009 .

[23]  Rubén Ruiz,et al.  A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem , 2008, INFORMS J. Comput..

[24]  Bibo Yang,et al.  Single machine rescheduling with new jobs arrivals and processing time compression , 2007 .

[25]  William G. Ferrell,et al.  Dynamic rescheduling that simultaneously considers efficiency and stability , 2004, Comput. Ind. Eng..

[26]  Xueping Li,et al.  Restricted job completion time variance minimisation on identical parallel machines , 2009 .

[27]  Patrick R. Philipoom.  The choice of dispatching rules in a shop using internally set due-dates with quoted leadtime and tardiness costs , 2000 .

[28]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[29]  Chris N. Potts,et al.  Rescheduling for New Orders , 2004, Oper. Res..

[30]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[31]  G. Ragatz,et al.  A simulation analysis of due date assignment rules , 1984 .

[32]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[33]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[35]  Jose M. Framinan,et al.  Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics , 2009, Comput. Oper. Res..

[36]  Mehmet Fatih Tasgetiren,et al.  A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem , 2008, Comput. Oper. Res..

[37]  Débora P. Ronconi,et al.  Tabu search for total tardiness minimization in flowshop scheduling problems , 1999, Comput. Oper. Res..

[38]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[39]  T.C.E. Cheng,et al.  Job shop scheduling for missed due-date performance , 1998 .

[40]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization , 1999 .

[41]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

[42]  Rainer Leisten,et al.  Available-to-promise (ATP) systems: a classification and framework for analysis , 2010 .

[43]  R. L. Daniels,et al.  Multiobjective flow-shop scheduling , 1990 .

[44]  Joachim Breit,et al.  An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint , 2004, Inf. Process. Lett..

[45]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[46]  Rubén Ruiz,et al.  Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness , 2009, Comput. Oper. Res..

[47]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[48]  Pierre Hansen,et al.  Variable neighborhood search: Principles and applications , 1998, Eur. J. Oper. Res..

[49]  Thomas Stützle,et al.  A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem , 2007, Eur. J. Oper. Res..

[50]  L. Gelders,et al.  Four simple heuristics for scheduling a flow-shop , 1978 .

[51]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[52]  Om Pal Singh,et al.  Supply chain design in the electronics industry incorporating JIT purchasing , 2009 .

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

[54]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[55]  Paz Pérez González.  Common due date setting in permutation flowshops: analysis of problems and solution procedures , 2009 .