A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion

By J. Grabowski, M. Wodecki. Computers & Operations Research, 2004

302 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/54c0ba9cd49ba1c3a767dd1499a168baa1336a84

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Industrial and Manufacturing Engineering

Citations in the corpus

A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (2007, methodology): “To achieve a better solution quality, modern metaheuristics have been presented for the PFSP with makespan minimization such as simulated annealing in [30,28], tabu search in [38,27,54,14], genetic algorithms in [39,40], ant colony optimization in [45,37], and iterated local search in [44].”
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (2007, methodology): “Keywords: Iterated Greedy, Flowshop Scheduling, Metaheuristics.”
TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM (2006, methodology): “However, the comparison does not consider some of the state of the art metaheuristics like for example the tabu search algorithm of Nowicki and Smutnicki [29] (referred to as TSAB), the recent tabu search of Grabowski and Wodecki [16] (TSGW) or the well known genetic algorithm with path relinking of”
A performance evaluation of permutation vs. non-permutation schedules in a flowshop (2006, background): “It has been suggested that the use of a dynamic tabu size usually produces better results (Grabowski and Wodecki 2004).”
A discrete differential evolution algorithm for the permutation flowshop scheduling problem (2007, methodology): “To achieve a better solution quality, modern meta-heuristics have been presented for the PFSP with makespan minimization such as Ant Colony Optimization in [10, 11], Genetic Algorithm in [12, 13, 14], Iterated Local Search in [15], Simulated Annealing in [16, 17], Tabu Search in [18, 19, 20 ].”
Flowshop-scheduling problems with makespan criterion: a review (2005, methodology): “(2002, 2003) and Gupta et al. (1999–2002). Nagar et al. (1995) proposed a branch-and-bound approach to solve the twomachine flowshop problem with makespan and total flow time objectives.”