A new heuristic for the n-job, m-machine flow-shop problem

By Hamid Davoud Pour. 2001

61 citations recorded by the source corpus.

Subfields: Industrial and Manufacturing Engineering

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

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

1. Rubén Ruiz
2. Javier Alcaraz
3. Jung Woo Jung
4. Young Hae Lee
5. Concepción Maroto
6. Bahman Naderi
7. Quan-Ke Pan
8. Eva Vallada

Citations in the corpus

• TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM (2006, methodology): “However, there are more recent methods published, for example the heuristics by Koulamas [22] and Davoud Pour [12].”
• Flowshop-scheduling problems with makespan criterion: a review (2005, methodology): “However, the procedure of Koulamas (1998) (not assuming permutation hypothesis), Sarin and Lefoka (1993) and Pour (2001) are claimed to be superior to NEH.”