A heuristic to minimize total flow time in permutation flow shop

By D. Laha, S. Sarin. 2009

83 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Industrial and Manufacturing Engineering

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

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. Rubén Ruiz

In Industrial and Manufacturing Engineering

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

Citations in the corpus

• A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0 (2016, unknown): “Since the problems of this class, with a few exceptions, have been proved to be NP-hard (Gonzalez and Sahni 1978), heuristic solutions are predominantly applied in practice (Jungwattanakit et al. 2008, 2009; Laha and Sarin 2009; Martin 2009; Werner 2013).”
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (2013, methodology): “More recently, Laha and Sarin (2009) have presented a modification of the FL heuristic, denoted as FL-LS.”