New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness

In this work we study a flow shop scheduling problem in which jobs are not allowed to wait between machines, a situation commonly referred to as no-wait. The criterion is to minimise a weighted sum of makespan and maximum lateness. A dominance relation for the case of three machines is presented and evaluated using experimental designs. Several heuristics and local search methods are proposed for the general m-machine case. The local search methods are based on genetic algorithms and iterated greedy procedures. An extensive computational analysis is conducted where it is shown that the proposed methods outperform existing heuristics and metaheuristics in all tested scenarios by a considerable margin and under identical CPU times.

[1]  D. A. Wismer,et al.  Solution of the Flowshop-Scheduling Problem with No Intermediate Queues , 1972, Oper. Res..

[2]  C. V. Ramamoorthy,et al.  On the Flow-Shop Sequencing Problem with No Wait in Process † , 1972 .

[3]  Maurice Bonney,et al.  Solutions to the Constrained Flowshop Sequencing Problem , 1976 .

[4]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[5]  Chris N. Potts,et al.  A decomposition algorithm for the single machine total tardiness problem , 1982, Oper. Res. Lett..

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

[7]  Hans Röck,et al.  The Three-Machine No-Wait Flow Shop is NP-Complete , 1984, JACM.

[8]  Hans Röck,et al.  Some new results in flow shop scheduling , 1984, Z. Oper. Research.

[9]  C. Rajendran,et al.  Heuristic algorithms for scheduling in the no-wait flowshop , 1993 .

[10]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

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

[12]  Tariq A. Aldowaisan,et al.  No-wait and separate setup three-machine flowshop with total completion time criterion , 2000 .

[13]  Tariq Aldowaisan,et al.  No-wait flowshops with bicriteria of makespan and total completion time , 2002, J. Oper. Res. Soc..

[14]  Ali Allahverdi,et al.  New heuristics for no-wait flowshops to minimize makespan , 2003, Comput. Oper. Res..

[15]  C. Rajendran,et al.  Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .

[16]  Ali Allahverdi,et al.  No-wait flowshops with bicriteria of makespan and maximum lateness , 2004, Eur. J. Oper. Res..

[17]  Parthasarati Dileepan.  A note on minimizing maximum lateness in a two-machine no-wait flowshop , 2004, Comput. Oper. Res..

[18]  Ronald G. McGarvey,et al.  Total flowtime and makespan for a no-wait m-machine flowshop with set-up times separated , 2004, J. Oper. Res. Soc..

[19]  Józef Grabowski,et al.  Some local search algorithms for no-wait flow-shop problem with makespan criterion , 2005, Comput. Oper. Res..

[20]  T. C. Edwin Cheng,et al.  A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setups , 2006, Comput. Oper. Res..

[21]  Chelliah Sriskandarajah,et al.  A review of TSP based approaches for flowshop scheduling , 2006, Eur. J. Oper. Res..

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

[23]  V. Perdomo,et al.  Operating Theatre Scheduling Using Lagrangian Relaxation , 2006, 2006 International Conference on Service Systems and Service Management.

[24]  Xiaoyun Xu,et al.  Influencing factors of job waiting time variance on a single machine , 2007 .

[25]  O. V. Krishnaiah Chetty,et al.  Metaheuristics for solving economic lot scheduling problems (ELSP) using time-varying lot-sizes approach , 2007 .

[26]  Tarek Y. ElMekkawy,et al.  Bi-criteria scheduling of a flowshop manufacturing cell with sequence dependent setup times , 2007 .

[27]  Jorge M. S. Valente.  Heuristics for the single machine scheduling problem with early and quadratic tardy penalties , 2007 .

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

[29]  Bala Ram,et al.  Parameter setting in a bio-inspired model for dynamic flexible job shop scheduling with sequence-dependent setups , 2007 .

[30]  P. Lopez,et al.  Climbing depth-bounded discrepancy search for solving hybrid flow shop problems , 2007 .

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

[32]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..

[33]  Thomas Stützle,et al.  An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives , 2008, Eur. J. Oper. Res..

[34]  Ali Allahverdi,et al.  The significance of reducing setup times/setup costs , 2008, Eur. J. Oper. Res..

[35]  Emmanuel Neron,et al.  An unrelated parallel machines model for an industrial production resetting problem , 2008 .