Fast method for heuristics in large-scale flow shop scheduling

Tsinghua Science and Technology

Volumn 11, Issue 1, 2006, Pages 12-18

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

^a TSINGHUA UNIVERSITY   (China)

^b HARBIN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Flow shop; Heuristics; Scheduling; Total completion time

Indexed keywords

COMPUTATIONAL METHODS; GENETIC ALGORITHMS; HEURISTIC METHODS; LARGE SCALE SYSTEMS; MACHINING; MATHEMATICAL MODELS; SCHEDULING;

FLOW SHOP; JOB INSERTION; PAIR WISE EXCHANGE; TOTAL COMPLETION TIME;

MANUFACTURE;

EID: 33645788366     PISSN: 10070214     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1007-0214(06)70148-1     Document Type: Article

References (12)

1. Baker K R. Introduction to Sequencing and Scheduling. New York: Wiley, 1974.
2. French S. Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Chichester: Ellis Horwood, 1982.
3. Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research, 1994, 32(11): 2541-2558.
4. Rajendran C, Chaudhuri D. An efficient heuristic approach to the scheduling of jobs in a flowshop. European Journal of Operational Research, 1991, 61(2): 318-325.
5. Nawaz M, Enscore E E, Ham I. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. OMEGA, 1983, 11(1): 91-95.
6. 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. International Journal of Production Research, 2003, 41(1): 121-148.
7. Framinan J M, Leisten R. An efficient constructive heuristic for flowtime minimization in permutation flow shops. OMEGA, 2003, 31(4): 311-317.
8. Woo D S, Yim H S. A heuristic algorithm for mean flow-time objective in flowshop scheduling. Computers and Operations Research, 1998, 25(3): 175-182.
9. Rajendran C, Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research, 1997, 103(1): 129-138.
10. Allahverdi A, Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics, 2002, 77(1): 71-83.
11. Framinan J M, Eeisten R, Ruiz-Usano R. Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimization. European Journal of Operational Research, 2002, 141(3): 559-569.
12. Tailard E. Benchmarks for basic scheduling problems. European Journal of Operational Research, 1993, 64(1): 278-285.