A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility

By Rubén Ruiz, Concepción Maroto. European Journal of Operational Research, 2006

449 citations recorded by the source corpus.

How researchers see this paper

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

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).”
Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem (2012, methodology): “This assignment rule was adopted from the work of [28].”
The hybrid flow shop scheduling problem (2010, methodology): “In [159], a GA was employed to minimize makespan on an m-stage problem with unrelated parallel machines, sequence dependent setup times and machine eligibility.”
A survey of scheduling problems with setup times or costs (2008, methodology): “Ruiz and Maroto (2006) also studied the FFm/ST sd /C max problem, but in a more complex environment, where the machines in each stage are unrelated and some machines are not eligible to perform some jobs.”