Flowshop scheduling research after five decades

By Jatinder N. D. Gupta, E. Stafford. European Journal of Operational Research, 2006

350 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

View Paper: https://www.semanticscholar.org/paper/b3e78de663defbcadcddeebf285ba3f2f44e32d8

How researchers see this paper

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

In Computer Networks and Communications

1. Quan-Ke Pan
2. Bahman Naderi
3. Rubén Ruiz

In Industrial and Manufacturing Engineering

1. Quan-Ke Pan
2. Bahman Naderi
3. Rubén Ruiz
4. Morteza Mousakhani

Citations in the corpus

• Iterated Greedy methods for the distributed permutation flowshop scheduling problem (2019, methodology): “A rather convoluted 91 Electromagnetism Method (EM) procedure combining several local search 92 neighborhoods was presented in Liu and Gao (2010). A Hybrid Genetic Algo93 rithm (HGA) was proposed by Gao and Chen (2011a).”
• The distributed permutation flowshop scheduling problem (2010, background): “The literature of the PFSP is extensive, recent reviews are those of Framinan, Gupta and Leisten (2004), Hejazi and Saghafian (2005), Ruiz and Maroto (2005) and Gupta and Stafford (2006).”
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (2013, background): “The vast majority of research on flowshop scheduling deals with makespan minimization and several survey papers have been published like those of Framinan et al. (2004), Ruiz and Maroto (2005), Hejazi and Saghafian (2005) and Gupta and Stafford (2006).”