A New Constructive Heuristic for the No-Wait Flowshop Scheduling Problem

Constructive heuristics have a great interest as they manage to find in a very short time, solutions of relatively good quality. Such solutions may be used as initial solutions for metaheuristics for example. In this work, we propose a new efficient constructive heuristic for the No-Wait Flowshop Scheduling Problem. This proposed heuristic is based on observations on the structure of best solutions of small instances as well as on analyzes of efficient constructive heuristics principles of the literature. Experiments have been conducted and results show the efficiency of the proposed heuristic compared to ones from the literature.

[1]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

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

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

[4]  M. F. Tasgetiren,et al.  A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion , 2008 .

[5]  Thomas Stützle,et al.  A review of metrics on permutations for search landscape analysis , 2007, Comput. Oper. Res..

[6]  Yuri Malitsky,et al.  Non-Model-Based Search Guidance for Set Partitioning Problems , 2012, AAAI.

[7]  Lucio Bianco,et al.  Flow Shop No-Wait Scheduling With Sequence Dependent Setup Times And Release Dates , 1999 .

[8]  Xiaoping Li,et al.  Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion , 2010, Eur. J. Oper. Res..

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

[10]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

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

[12]  J. Grabowski,et al.  The permutation flow shop problem with blocking. A tabu search approach , 2007 .

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

[14]  Marcelo Seido Nagano,et al.  New heuristics for the no-wait flowshop with sequence-dependent setup times problem , 2015 .

[15]  Meinolf Sellmann,et al.  Streamlined Constraint Reasoning , 2004, CP.

[16]  Egon Balas,et al.  A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering , 1992, Oper. Res..

[17]  Edy Bertolissi,et al.  Heuristic algorithm for scheduling in the no-wait flow-shop , 2000 .