An application of effective genetic algorithms for solving hybrid flow shop scheduling problems

International Journal of Computational Intelligence Systems

Volumn 1, Issue 2, 2008, Pages 134-147

  Kahraman, Cengiz ^a   Engin, Orhan ^b   Kaya, Ihsan ^a   Yilmaz, Mustafa Kerim ^b  

^a ISTANBUL TECHNICAL UNIVERSITY   (Turkey)

^b SELCUK UNIVERSITY   (Turkey)

Author keywords

Completion time; Genetic algorithm; Hybrid flow shop scheduling

Indexed keywords

BENCH-MARK PROBLEMS; COMPLETION TIME; COMPUTATIONAL RESULTS; EFFICIENT GENETIC ALGORITHMS; HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; MAKESPAN; SCHEDULING PROBLEM; SEARCH TECHNIQUE; TOTAL COMPLETION TIME;

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; INFORMATION ANALYSIS; MACHINE SHOP PRACTICE; SCHEDULING ALGORITHMS;

COMPUTATIONAL EFFICIENCY;

EID: 73849108250     PISSN: 18756891     EISSN: 18756883     Source Type: Journal    
DOI: 10.2991/ijcis.2008.1.2.4     Document Type: Article

References (34)

1. R. Linn, and W. Zhang, Hybrid Flow shop scheduling: A Survey, Computers and Industrial Engineering. 37 (1999) 57-61.
2. O. Engin, and A. Döyen, A New approach to solve hybrid flow shop scheduling problems by artificial immune system, Future generation computer systems. 20 (2004) 1083-1095.
3. J. N. D. Gupta, Two-stage hybrid flowshop scheduling problem, Operational Research Society, 39 (1988) 359-364.
4. M. A. Hong Wang, A new model in designing neural network in optimization: A hybrid neural network approach to machine scheduling, (Business Administration Graduate Program, The Ohio State University, Thesis, 1998).
5. T. S. Arthanari and K.G. Ramamurthy, An extension of two machines sequencing problem, Opsearch. 8 (1971) 10-22.
6. J. A. Hoogeveen, J. K. Lenstra, and B. Vettman, Minimizing the Makespan in a multiprocessor flow shop is strongly NP-Hard, European Journal of Operational Research. 89 (1996) 172-175.
7. L. Wang, L. Zhang, and D. Zhenga, An effective hybrid genetic algorithm for flow shop scheduling with limited buffers, Computers & Operations Research. 33 (2006) 2960-2971.
8. C. Oǧuz, and M. F. Ercan, A Genetic Algorithm for Hybrid Flow-Shop Scheduling With Multiprocessor Tasks, Journal of Scheduling. 8 (2005) 323-351.
9. T. Li-Xin, W. Y. P. Source, and Z. Xuebao, Genetic descent algorithm for hybrid flow shop scheduling, Automatica Sinica. 28(4) (2002) 637-641.
10. W. Xia, P. Hao, S. Zhang, and X. Xu, Hybrid flow shop scheduling using genetic algorithm, Proceedings of the 3nd world congress on Intelligent control and Automation. (2000) 537-541.
11. J. Carlier, and E. Neron, An exact method for solving the multiprocessor flowshop, R.A.I.R.O-R.O. 34 (2000) 1-25.
12. S. A. Brah, and J.L. Hunsucker, Branch and bound algorithm for flow shop with multiple processors, European Journal of operations Research. 51 (1991) 88-89.
13. D. L. Santos, J. L. Hunsucker, and D. E. Deal, Global lower bounds for flow shops with multiple processors, European Journal of Operational Research. 80 (1995) 112-120.
14. F. Riane, A. Artibs, and S.E. Elmaghraby, A Hybrid three stage flow shop problem: Efficient heuristics to minimize makespan, European Journal of Operational Research 109 (1998), 321-329
15. M. C. Portman, A. Vignier, D. Dardilhac, and D. Dezalay, Branch and Bound crossed with GA to solve hybrid flowshops, European Journal of Operational Research. 107 (1998) 389-400.
16. H. T. Jessen, and M. Weizhen, On-line algorithms for hybrid flow shop scheduling, International conference on computer science and informatics. (1998) 134-137.
17. O. Moursli and Y. Pochet, A branch and bound algorithm for the hybrid flow shop, International journal of production economics. 64 (2000) 113-125.
18. H. Soewandi, and S.E. Elmaghraby, Sequencing three stage flexible flowshops with identical machines to minimize makespan, IIE Transactions. 33 (2001) 985-983
19. E. Neron, P. Baptiste, and J. N. D. Gupta, Solving hybrid flow shop problem using energetic reasoning and global operations, Omega The international journal of management science, 29 (2001) 501-511.
20. L. Tang, W. Liu, and J. Liu, A Neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment, Journal of Intelligent Manufacturing. 16 (2005) 361-370.
21. L. Yang, H.G. Yu, and X.Y. Geng, Planning and scheduling algorithm based on TOC for complex hybrid flow shop problems, Computer integrated manufacturing systems. 11(1) (2005) 97-103.
22. M. Zandieh, S. M. T. F. Ghami, and S. M. M., Husseini, An Immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Applied Mathematics and Computation. 180 (2006) 111-127
23. W. Zhong, X.F. Xu, and S. Deng, Evolutionary algorithm for solving multi-objective hybrid flowshop scheduling problem, Computer Integrated Manufacturing Systems. 12(8) (2006) 1227-1234.
24. H. Allaoui and A. Artiba Scheduling two stage hybrid flow shop with availability constraints, Computers and Operations Research. 33 (2006) 1399-1419.
25. M. Haouari, L. Hidri, and A. Gharbi 2006, Optimal Scheduling of a two stage hybrid flow shop, Math. Meth. Oper. Res. 64 (2006) 107-124.
26. K. Alayki{dotless}ran, O. Engin, and A. Döyen, Using ant colony optimization to solve hybrid flow shop scheduling problems, Int. J. Adv. Manuf. Technol. (2007) Article in press.
27. P. Caricato, A. Grieco, and D. Serino, TSP-based scheduling in a batch-wise hybrid flow shop, Robotics and Computer-Integrated Manufacturing. 23 (2007) 234-241.
28. A. Janiak, E. Kozan, M. Lichtenstein and C. Oǧuz Metaheuristic approaches to hybrid flow shop scheduling problem with a cost related criterion, International journal of production economics. 105 (2007) 407-424.
29. S. Vob, and A. Witt, Hybrid flow shop scheduling as a multi-mode multi project scheduling problem with batching requirements: A real world application, Int. J. Production Economics. 105 (2007) 445-458.
30. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, (Addison Wesley Publishing, The University of Alabama, 1989)
31. S. H. Yoon, J. A. Ventura, An application of genetic algorithms to lot-streaming flow shop scheduling, IEE Transactions 34 (2002) 77-787.
32. M. Gen, and R. Cheng, Genetic Algorithms & Engineering Optimization, (John Wiley & Sons, New York, 2000)
33. T. Yamada, and R. Nakano, A Genetic Algorithm Applicable To Large Scale Job Shop Problems, Proceedings of The Second International Conference on Parallel Problem Solving from Nature, (Elsevier Science Publishers, 1992).
34. İ. Kaya, O. Engin, A new approach to define sample size at attributes control chart in multistage process: An application in engine piston manufacturing process, Journal of Materials Processing Technology. 183 (2007) 38-48.