An efficient constructive heuristic for permutation flow shops to minimize total flowtime

Chinese Journal of Electronics

Volumn 14, Issue 2, 2005, Pages 203-208

  Li, Xiaoping ^a,b   Wu, Cheng ^a  

^a TSINGHUA UNIVERSITY   (China)

^b HARBIN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Flow shop; Heuristics; Sscheduling; Total flowtime

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; HEURISTIC METHODS; MATHEMATICAL MODELS; MATRIX ALGEBRA; OPTIMIZATION; SCHEDULING;

FLOW SHOP; HEURISTICS; STANDARD DEVIATION (STD); TOTAL FLOWTIME;

OPERATIONS RESEARCH;

EID: 17444426095     PISSN: 10224653     EISSN: 20755597     Source Type: Journal    
DOI: None     Document Type: Article

References (15)

1. K.R. Baker, Introduction to Sequencing and Scheduling, New York, Wiley, 1974.
2. M.R. Gray, D.S. Johnson, R. Sethi, "The complexity of flowshop and jobshop scheduling", Mathematics of Operations Research, Vol.1, pp.117-129, 1976.
3. J.M. Framinan, R. Leisten, "An efficient constructive heuristic for flowtime minimisation in permutation flow shops", OMEGA, Vol.31, pp.311-317, 2003.
4. D.S. Woo, H.S. Yim, "A heuristic algorithm for mean flowtime objective in flowshop scheduling", Computers Ops. Res., Vol.25, pp.175-182, 1998.
5. C. Rajendran, H. Ziegler, "An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs", European Journal of Operational Research, Vol.103, pp.129-138, 1997.
6. i scheduling problems", European Journal of Operational Research, Vol.96, pp.636-644, 1997.
7. J.C. Ho, "Flowshop sequencing with mean flowtime objective", European Journal of Operational Research, Vol.81, pp.571-578, 1995.
8. J.N.D. Gupta, "Heuristic algorithms for multistage flow shop problem", AUE Trans., Vol.4, pp.11-18, 1972.
9. A. Allahverdi, T. Aldowaisan, "New heuristics to minimize total completion time in m-machine flowshops", International Journal of Production Economics, Vol.77, pp.71-83, 2002.
10. Lixin Tang, Jiyin Liu, "Modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time" Journal of Intelligent Manufacturing, Vol.13, No.1, pp.61-67, 2002.
11. G.C. Onwubolu, "Manufacturing cell scheduling using genetic algorithms", Proceedings of the Institution of Mechanical Engineers Part B-Journal of Engineering Manufacture, Vol.214, No.2, pp.159-164, 2000.
12. M. Wodecki, W. Bozejko, "Solving the flow shop problem by parallel simulated annealing", Parallel Processing Applied Mathematics -Lecture Notes in Computer Science, Vol.2328, pp.236-244, 2002.
13. J.M. Framinan, R. Leisten, C. Rajendran, "Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem", International Journal of Production Research, Vol.41, pp.121-148, 2003.
14. Muhammad Nawaz, E. Emory Enscore Jr, Inyong Ham, "A heuristic algorithm for the m-machine n-job flow-shop sequencing problem", OMEGA, Vol.11, pp.91-95, 1983.
15. E. Tailard, "Benchmarks for basic scheduling problems", European Journal of Operational Research, Vol.64, No.1, pp.278-285, 1993.