An improved genetic algorithm for the flowshop scheduling problem

International Journal of Production Research

Volumn 47, Issue 1, 2009, Pages 233-249

  Rajkumar, R ^a   Shahabudeen, P ^b  

^a MEPCO SCHLENK ENGINEERING COLLEGE   (India)

^b ANNA UNIVERSITY   (India)

Author keywords

Flowshop scheduling; Genetic algorithm; Makespan

Indexed keywords

ALGORITHMS; GENETIC ALGORITHMS; GLOBAL OPTIMIZATION; HEURISTIC ALGORITHMS; LEARNING SYSTEMS; OPTIMIZATION; SCHEDULING; SCHEDULING ALGORITHMS;

BENCHMARK PROBLEMS; COMPLEX SEARCH SPACES; CROSSOVER OPERATORS; FLOW SHOPS; FLOWSHOP PROBLEMS; FLOWSHOP SCHEDULING; GA OPERATORS; GLOBAL OPTIMIZATION PROBLEMS; HYPERMUTATION; IMPROVED GENETIC ALGORITHMS; MAKESPAN; MINIMIZING MAKESPAN; MUTATION OPERATORS; PERMUTATION FLOWSHOP SCHEDULING; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; SCHEDULING PROBLEMS; SEARCH HEURISTICS;

PROBLEM SOLVING;

EID: 56349160073     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701523041     Document Type: Article

References (27)

1. Baker, K.R., Introduction to Sequencing and Scheduling, 1974 (Wiley: New York).
2. Ben-Daya, M. and Al-Fawzan, M., A tabu search approach for the flow shop scheduling problem. European J. Operat. Resarch., 1998, 109, 88-95.
3. Campbell, H.G., Dudek, R.A. and Smith, M.L., A heuristic algorithm for the n-job, m-machine sequencing problem. Manag. Sci., 1970, 16/B, 630-637.
4. Carlier, J., Ordonnancements a contraintes disjonctives. RAIRO Recherche Operationelle/ Operat. Resear., 1978, 12, 333-351.
5. Chinyao, L., Jinn-Yi, Y. and Kai-I, H., A robust simulated annealing heuristic for flow shop scheduling problems. The Inter. J. Advanc Manuf act. Tech., 2004, 23, 762-767.
6. Falkenauer, E. and Bouffouix, S., A genetic algorithm for job shop, in Proceedings of the IEEE International Conference on Robotics and Automation, 1991, 824-829.
7. Garey, E.L., Johnson, D.S. and Sethi, R., The complexity of flowshop and job-shop scheduling. Math. Operat. Resear., 1976, 1, 117-129.
8. Goldberg, D.E., Genetic Algorithms in Search, Optimization and Machine Learning, 1989 (Addison Wesley: Reading, MA).
9. Ignall, E. and Schrage, L.E., Application of branch-and-bound techniques to some flow shop problems. Operat. Resear., 1965, 13, 400-412.
10. Ishibuchi, H., Misaki, S. and Tanaka, H., Modified simulated annealing algorithms for the flow shop sequencing problem. European J. Operat. Resarch., 1995, 81, 388-398.
11. Johnson, S.M., Optimal two and three-stage production schedules with setup times included. Nav Res Log, 1954, 1, 61-68.
12. Koulamas, C., A new constructive heuristic for the flow shop scheduling problem. European J. Operat. Resear., 1998, 105, 66-71.
13. Leung, Y., Gao, Y. and Xu, Z.B., Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov-chain analysis. IEEE Trans. Neural Networks, 1997, 8, 1165-1176.
14. Lomnicki, Z., A branch-and-bound for the exact solution of the three machine scheduling problem. Operat. Resear., 1965, 16, 89-107.
15. Murata, T. and Ishibuchi, H., Performance evaluation of genetic algorithms for flowshop scheduling problems, in IEEE world congress on computational intelligence, proceedings of the first IEEE conference, 1994, 2, 812-817.
16. Murata, T., Ishibuchi, H. and Tanaka, H., Algorithms for flowshop scheduling problems. Comput. Indust. Eng., 1996, 30, 1061-1701.
17. Nawaz, M., Enscore, E. and Ham, I., A heuristic algorithm for the m- machine, n- machine flow shop sequencing problem. Omega, 1983, 11, 91-95.
18. Nowicki, E. and Smutnicki, C., A fast tabu search algorithm for the permutation flow-shop problem. European J. Operat. Resarch., 1996, 91, 160-175.
19. Ogbu, F.A. and Smith, D.K., The applications of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem. Comput. Operat. Resear., 1990, 17, 243-253.
20. Palmer, D.S., Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Operat. Resear., 1965, 16, 101-107.
21. Rajendran, C., A heuristic for scheduling on flow shop and flow line based manufacturing cell with multicriteria. Inter. J. Prod. Resear., 1994, 32, 2541-2558.
22. Reeves, C.R., A genetic algorithm for flowshop sequencing. Comput. Operat. Resear., 1995, 22, 5-13.
23. Ruben, R., Concepcion, M. and Javier, A., New genetic algorithms for the permutation flowshop scheduling problem, in Proceedings of the Fifth Metaheuristics International Conference, Kyoto, Japan, August 25-28, 20003, pp. 63.1-63.8.
24. Rudolph, G., Convergence properties of canonical genetic algorithms. IEEE Transa. Neural Networks, 1994, 5, 96-101.
25. Venkata Ranga Neppalli, C.-L.C. and Jatinder, N.D. Gupta, Genetic algorithms for the two-stage bicriteria flowshop problem. European J. Operat. Resarch., 1996, 95, 356-373.
26. Wang, L. and Zheng, D.Z., An effective hybrid heuristic for flow shop scheduling. The Inter. J. Advanc. Manufact. Tech., 2003a, 21, 38-44.
27. Wang, L. and Zheng, D.Z., A modified evolutionary programming for flow shop scheduling. The Inter. J. Advanc. Manufact. Tech., 2003b, 22, 522-527.