TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM

By Rubén Ruiz, Concepción Maroto, Javier Alcaraz. 2006

402 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/6520027a3f78a24f926a1a748c30a458365d4866

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

The distributed permutation flowshop scheduling problem (2010, methodology): “Algorithms are presented in Reeves (1995) and in Ruiz, Maroto and Alcaraz (2006) .”
No-wait flowshop with separate setup times to minimize maximum lateness (2007, neutral): “[23] or Onwubolu and Davendra [18].”
Permutation flowshops in group scheduling with sequence-dependent setup times (2012, background): “This crossover has been shown to be very high performing in permutation flowshops against many other crossover operators (Ruiz et al., 2006).”
Scheduling job shop problems with sequence-dependent setup times (2009, background): “Much research in production scheduling with SDST is restricted to the flow shop and its extensions, such as that of Kurz and Askin (2003, 2004), Riuz et al. (2005), Ruiz and Maroto (2006) and Zandieh et al. (2006).”
An improved NSGA-II algorithm for multi-objective lot-streaming flow shop scheduling problem (2014, methodology): “To overcome the above problem, when the diversity falls below a given threshold, c, adopting a restart strategy based on the ideas adopted by the authors in (Pan and Ruiz 2012 and Ruiz et al. 2006) is much more necessary.”
A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times (2011, methodology): “This kind of generational scheme was firstly applied in Ruiz et al. (2006) providing very good results.”
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (2007, methodology): “…techniques like the genetic algorithm with local search or simulated annealing of Murata et al. (1996), the genetic algorithm with local search of Ruiz et al. (2004b), the tabu search and simulated annealing of Moccellin and dos Santos (2000), the parallel simulated annealing algorithm of…”
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].”