Iterative heuristics for permutation flow shops with total flowtime minimization

IFIP International Federation for Information Processing

Volumn 220, Issue , 2006, Pages 349-356

  Li, Xiaoping ^a   Wang, Qian ^a  

^a SOUTHEAST UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; ECONOMIC AND SOCIAL EFFECTS; HEURISTIC METHODS; MACHINE SHOP PRACTICE;

COMPUTATIONAL RESULTS; EFFECTIVENESS AND EFFICIENCIES; FLOW SHOP SCHEDULING PROBLEM; INITIAL SOLUTION; ITERATIVE HEURISTICS; PAIR-WISE EXCHANGES; PERMUTATION FLOW SHOPS; TOTAL FLOWTIME;

MANUFACTURE;

EID: 33947175093     PISSN: 15715736     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-36594-7_37     Document Type: Article

References (19)

1. 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.
2. Baker KR. Introduction to sequencing and scheduling. New York: Wiley, 1974.
3. Framinan JM, 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 ofProduction Research 2003; 41(1): 121-148.
4. Framinan JM, Leisten R, Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers & Operations Research 2005; 32(5): 1237-1254.
5. Framinan JM, Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flowshops. Omega 2003; 31(4): 311-317.
6. French S. Sequencing and scheduling: An introduction to the mathematics of the job-shop. Chichester: Ellis Horwood, 1982.
7. Gray MR, Johnson DS, Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1976; 1(2): 117-129.
8. Gupta JND. Heuristic algorithms for multistage flow shop problem. AIIE Transaction 1972; 4(1): 11- 18
9. Ho JC. Flowshop sequencing with mean flowtime objective. European Journal of Operational Research 1995; 81(3): 571-578.
10. Liu J, Reeves CR. Constructive and composite heuristic solutions to the P//∑ Ci scheduling problem. European Journal of Operational Research 2001; 132(2): 439-452.
11. Nawaz M, Enscore EE, Ham I. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. OMEGA 1983; 11(1): 91-95.
12. 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.
13. 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.
14. Rajendran C, Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan total flowtime of jobs. European Journal of Operational Research 2004; 155(2): 426-438.
15. Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal ofProduction Research 1994; 32(11): 2541-2558.
16. Rajendran C. Heuristic algorithm for scheduling in a flowshop to minimise total flowtime. International Journal of Production Economics 1993; 29(1): 65-73.
17. Tailard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 1993; 64(1): 278-285.
18. i scheduling problems. European Journal of Operational Research 1997; 96(3): 636-644.
19. Woo DS, Yim HS. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers & Operations Research 1998; 25(3): 175-182.