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

Production Planning and Control

Volumn 12, Issue 7, 2001, Pages 648-653

  Pour, Hamid Davoud ^a,b,c  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b Industrial Engineering Dept   (Iran)

^c IE and Productivity Research Center   (Iran)

Author keywords

CDS algorithm; Efficiency index; Flow shop, heuristics; NEH algorithm; Palmer algorithm; Relative error index

Indexed keywords

FLOW-SHOP PROBLEMS;

ALGORITHMS; ERROR ANALYSIS; HEURISTIC METHODS; PROBLEM SOLVING;

SCHEDULING;

EID: 0035497226     PISSN: 09537287     EISSN: None     Source Type: Journal    
DOI: 10.1080/09537280152582995     Document Type: Article

References (6)

1. CAMPBELL, H. G., DUDEK, R. A., and SMITH, M. L., 1970, A heuristic algorithm for the n job, m machine sequencing problem. Management Science, 16, 630-637.
2. DANNENBRING, D. G., 1977, An evaluation of flow shop sequencing heuristic. Management Science, 23, 1174-1182.
3. NAWAZ, M., ENSCORE, E., and HAM, I., 1983, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA, The International Journal of Management Science, 11, 91-95.
4. PALMER, D. S., 1965, Sequencing jobs through a multi-stage process in the minimal total time - A quick method of obtaining a near optimum. Operations Research Quarterly, 16, 101-107.
5. PARK, R., 1989, Search and selection of flow shop sequencing rules. Management Science, March 21.
6. SETIAPURTA, W., 1989, An experimental investigation and comparative evaluation of flow shop heuristics. Industrial Engineering, Oct.