Enhanced NEH method in solving permutation flow shop problem

Journal of Shanghai Jiaotong University (Science)

Volumn 12 E, Issue 1, 2007, Pages 47-52

  Gao, Shou Wei ^a   Lin, Chen ^b   Zhang, Wei Dong ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b LULEÅ UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Constructive heuristic; Critical path; Flow shop; Makespan

Indexed keywords

COSTS; CRITICAL PATH ANALYSIS; EXPERIMENTS; FLOW CONTROL; SCHEDULING;

CONSTRUCTIVE HEURISTIC; FLOW SHOP; MAKESPAN; TIME COMPLEXITY;

FLOWCHARTING;

EID: 34247334245     PISSN: 10071172     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Nawaz M, Enscore E, Ham I. A heuristic algorithm for the m machine, n job flow shop [J]. OMEGA: The International Journal of Management Sciences, 1983, 11 (1): 91-95.
2. Taillard E. Some efficient heuristic methods for the flow shop sequencing problem [J]. European Journal of Operational Research, 1990, 47 (1): 65-74.
3. Nagano M S, Moccellin J V. A high quality solution constructive heuristic for flow shop sequencing [J]. Journal of the Operational Research Society, 2002, 53 (12): 1374-1379.
4. Framinan J M, Leisten R, Rajendran C. Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem [J]. International Journal of Production Research, 2003, 41 (1): 121-148.
5. Ruiz R, Maroto C. A comprehensive review and evaluation of permutation flowshop heuristics [J]. Eurovean Journal of Operational Research, 2005, 165: 479-494.
6. Nowicki E, Smutnicki C. A fast tabu search algorithm for the permutation flow-shop problem [J]. European Journal of Operational Research, 1996, 91: 160-175.
7. Grabowski J, Pempera J. New block properties for the permutation flow shop problem with application in tabu search [J]. Journal of the Operational Research Society, 2001, 52 (2): 210-220.
8. Taillard E. Benchmarks for basic scheduling problems [J]. European Journal of Operational Research, 1993, 64 (2): 278-285.