A General Variable Neighborhood Search Algorithm for the No-Idle Permutation Flowshop Scheduling Problem

In this study, a general variable neighborhood search (GVNS) is presented to solve no-idle permutation flowshop scheduling problem (NIPFS), where idle times are not allowed on machines. GVNS is a metaheuristic, where inner loop operates a variable neighborhood descend (VND) algorithm whereas the outer loop carries out some perturbations on the current solution. We employ a simple insert and swap moves in the outer loop whereas iterated greedy (IG) and iterated local search (ILS) algorithms are employed in the VND as neighborhood structures. The results of the GVNS algorithm are compared to those generated by the variable iterated greedy algorithm with differential evolution (vIG_DE). The performance of the proposed algorithm is tested on the Ruben Ruiz’ benchmark suite that is presented in http://soa.iti.es/rruiz. Computational results showed that the GVNS algorithm further improved 85 out of 250 best solutions found so far in the literature.

[1]  Pierre Hansen,et al.  Variable neighborhood search and local branching , 2004, Comput. Oper. Res..

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

[3]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for no-idle permutation flow-shop scheduling problems , 2008 .

[4]  C. R. Woollam.  Flowshop with no idle machine time allowed , 1986 .

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

[6]  Porpan Vachajitpan,et al.  Job sequencing with continuous machine operation , 1982 .

[7]  Ceyda Oguz,et al.  A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine , 2012, Comput. Oper. Res..

[8]  Jerzy Kamburowski,et al.  On no-wait and no-idle flow shops with makespan criterion , 2007, Eur. J. Oper. Res..

[9]  D. Pohoryles,et al.  Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times , 1982 .

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

[11]  Mehmet Fatih Tasgetiren,et al.  A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem , 2013, Comput. Oper. Res..

[12]  Alain Guinet,et al.  Three stage no-idle flow-shops , 2003 .

[13]  Rubén Ruiz,et al.  Scheduling in Flowshops with No-Idle Machines , 2009 .

[14]  Quan-Ke Pan,et al.  A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion , 2013 .