Flowshop-scheduling problems with makespan criterion: a review

By Young Hae Lee, Jung Woo Jung. 2005

355 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

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

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. J. Framiñán
5. Rainer Leisten
6. Morteza Mousakhani

Citations in the corpus

• Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (2008, background): “Without doubt, the most widely studied is the makespan objective (see, for example, Reza Hejazi and Saghafian 2005, or Ruiz and Maroto 2005 for recent reviews on this problem).”
• 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).”