A hybrid iterated greedy algorithm for total tardiness minimization in permutation flowshops

Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness

“…In addition, Framinan and Leisten (2008) have also proposed a speed up mechanism to decrease the complexity of the evaluation. 3 Recently, Karabulut (2016) have found around 50% time saving when applying it to the NEH.…”

“…Recently, Karabulut (2016) propose KIG, an iterated greedy algorithm that incorporates a random local search method instead of the traditional insertion local search method. The search randomly performs insertion and exchanges using the speed up mechanism proposed by Framinan and Leisten (2008) , until no more im-provement is achieved in n iterations.…”

“…Some metaheuristics are tested either under different com puter conditions or versus non-state-of-the-art metaheuristics (see e.g. Cura, 2015;Karabulut, 2016 ).…”

“…The phase is stopped after a complete iteration without any improvement. Finally, the simulated annealing-like acceptance criterion proposed by Karabulut (2016) is applied due to its excellent performance. This simple criterion is a variation of the proposal of Ruiz and Stützle (2007) for F m | prmu | C max , which has been successfully applied to other several objectives and/or scheduling problems (see e.g.…”

“…Since this problem is known to be NP-hard ( Du & Leung, 1990 ), during the last years several approximate algorithms -heuristics and metaheuristics-have been proposed in the literature (see e.g. Karabulut, 2016;Li, Chen, Xu, & Gupta, 2015;Vallada, Ruiz, & Minella, 2008 ). However, these proposals have not been compared against themselves, or the comparison has not been carried out under the same conditions, so the state-of-the-art regarding approximate algorithms for the problem remains unclear.…”