Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization

European Journal of Operational Research

Volumn 196, Issue 3, 2009, Pages 869-876

  Zhang, Yi ^a,b   Li, Xiaoping ^a,b   Wang, Qian ^a,b  

^a SOUTHEAST UNIVERSITY   (China)

^b Ministry of Education   (China)

Author keywords

Genetic algorithm; Permutation flowshop; Scheduling; Total flowtime

Indexed keywords

ALGORITHMS; CHROMOSOMES; GENETIC ALGORITHMS; HEURISTIC METHODS; SCHEDULING;

ARTIFICIAL CHROMOSOMES; CROSSOVER OPERATORS; GENE STRUCTURES; GENETIC ALGORITHM; HYBRID GENETIC ALGORITHMS; INITIAL POPULATIONS; LOCAL SEARCHES; META-HEURISTIC; NP-HARD; PERMUTATION FLOWSHOP; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; TOTAL FLOWTIME;

SCHEDULING ALGORITHMS;

EID: 58849112643     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2008.04.033     Document Type: Article

References (29)

1. Allahverdi A., and Aldowaisan T. New heuristics to minimize total completion time in m-machine flowshops. International Journal of Production Economics 77 1 (2002) 71-83
2. Chang P.C., Wang Y.W., and Liu C.H. New operators for faster convergence and better solution quality in modified genetic algorithm. Lecture Notes in Computer Science 3611 (2005) 983-991
3. Chang P.-C., Chen S.-H., and Liu C.-H. Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems. Expert Systems with Applications 33 3 (2007) 762-771
4. Framinan J.M., and Leisten R. An efficient constructive heuristic for flowtime minimisation in permutation flow shops. Omega 31 4 (2003) 311-317
5. Framinan J.M., Leisten R., and Ruiz-Usano R. Comparison of heuristics for flowtime minimisation in permutation flowshops. Computers and Operations Research 32 (2005) 1237-1254
6. French S. Sequencing and Scheduling an Introduction to the Mathematics of the Job-shop (1982), Ellis Horwood, Chichester
7. Gray M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 2 (1976) 117-129
8. Ishibuchi H., and Murata T. A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems Man and Cybernetics Part C - Applications and Reviews 28 3 (1998) 392-403
9. Ishibuchi H., Yoshida T., and Murata T. Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation 7 2 (2003) 204-223
10. Johnson S.M. Optimal two-and three-state production schedules with setup times included. Naval Research Logistics Quarterly 1 (1954) 61-68
11. Kim Y.-D. Minimizing total tardiness in permutation flowshops. European Journal of Operational Research 85 3 (1995) 541-555
12. Li, Xiaoping, Wang, Qian, Wu, Cheng, in press. Efficient composite heuristics for total flowtime minimization in permutation flow shops. Omega (online available).
13. i scheduling problem. European Journal of Operational Research 132 (2001) 439-452
14. Murata T., Ishibuchi H., and Tanaka H. Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers and Industrial Engineering 30 4 (1996) 957-968
15. Murata T., Ishibuchi H., and Tanaka H. Genetic algorithms for flowshop scheduling problems. Computers and Industrial Engineering 30 4 (1996) 1061-1071
16. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine n-job flow-shop sequencing problem. Omega 11 1 (1983) 91-95
17. Nearchou A.C. The effect of various operators on the genetic search for large scheduling problems. International Journal of Production Economics 88 (2004) 191-203
18. Osman I.H., and Potts C.N. Simulated annealing for permutation flow-shop scheduling. Omega 17 6 (1989) 551-557
19. Potts C.N., and Van Wassenhove L.N. A branch-and-bound algorithm for the total weighted tardiness problem. Operations Research 33 2 (1985) 363-377
20. Rajendran C. A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria. International Journal of Production Research 32 (1994) 2541-2558
21. Rajendran C., and Ziegler H. An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs. European Journal of Operational Research 103 1 (1997) 129-138
22. Rajendran C., and Ziegler H. Ant-colony algorithms for permutation flowshop scheduling to minimize makespan total flowtime of jobs. European Journal of Operation Research 115 (2004) 426-438
23. Reeves C.R.A. genetic algorithms for flowshop sequencing. Computers and Operations Research 22 1 (1995) 5-13
24. Ruiz R., Maroto C., and Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34 (2006) 461-476
25. Tailard E. Some efficient heuristic methods for the flowshop sequencing problem. European Journal of Operational Research 47 1 (1990) 65-74
26. Tailard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 1 (1993) 278-285
27. Tan K.-C., Narasimhan R., Rubin Paul A., and Ragatz Gary L. A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega 28 (2000) 313-326
28. Tasgetiren M.F., Liang Y.-C., Sevkli M., and Gencyilmaz G. A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177 (2007) 1930-1947
29. Woo D.S., and Yim H.S. A heuristic algorithm for mean flowtime objective in flowshop scheduling. Computers and Operations Research 25 3 (1998) 175-182