An efficient hybridized genetic algorithm architecture for the flexible job shop scheduling problem

Barnes JW, Chambers JB (1996) Flexible job shop scheduling by tabu search. Graduate Program in Operations Research and Industrial Engineering, The University of Texas, Austin, Technical Report Series, ORP 96-09 Bona B, Brandimarte P, Greco C, Menga G (1990) Hybrid hierarchical scheduling and control systems in manufacturing. IEEE Trans Robot Autom 6(6):673–686 Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157–183 Brucker P, Neyer J (1998) Tabu-search for the multi-mode job-shop problem. OR Spektrum 20:21–28 Chan FTS, Chung SH, Chan PLY (2006) Application of genetic algorithms with dominant genes in a distributed scheduling problem in flexible manufacturing systems. Int J Prod Res 44(3):523–543 Chen H, Ihlow J, Lehmann C (1999) A genetic algorithm for flexible job-shop scheduling. Proceedings of the 1999 IEEE international conference on robotics and automation, vol 2. Detroit, Michigan, pp 1120–1125 Cheng R, Gen M, Tsujimura Y (1996) A tutorial survey of job-shop scheduling problems using genetic algorithms–I. Representation. Comput Ind Eng 30(4):983–997 Dauzére-Pérés S, Paulli J (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann Oper Res 70:281–306 Falkenauer E, Bouffouix S (1991) A genetic algorithm for job shop. Proceedings of the 1991 IEEE international conference on robotics and automation. Sacramento-California, pp 824–829 French S (1982) Sequencing and scheduling: an introduction to the mathematics of the job-shop. John Wiley, Ellis Horwood Limited, West Sussex Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35:2892–2907 Garey MR, Johnson DS, Sethi R (1976) The complexity of flow shop and job-shop scheduling. Math Oper Res 1–2:117–129 Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley series in engineering design and automation. Wiley, New York Giovanni LD, Pezzella F (2010) An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur J Oper Res 200:395–408 Girish BS, Jawahar N (2008) Scheduling job shop associated with multiple routings with genetic and ant colony heuristic. Int J Prod Res 99999(2):1–27. doi:10.1080/00207540701824845 Girish BS, Jawahar N (2009) A particle swarm optimization algorithm for flexible job shop scheduling problem. 5th Annual IEEE conference on automation science and engineering. Bangalore, India, 22–25 Aug, pp 298–303 Hart E, Ross P, Corne D (2005) Evolutionary scheduling: a review. Genet Programm Evol Mach 6:191–220 Hmida AB, Haouari M, Huguet M-J, Lopez P (2010) Discrepancy search for the flexible job shop scheduling problem. Comput Oper Res 37:2192–2201 Ho NB, Tay JC (2004) GENACE: an efficient cultural algorithm for solving the flexible job-shop problem. Proceedings of the congress on evolutionary computation CEC2004, pp 1759–1766 Ho NB, Tay JC, EMK Lai (2007) An effective architecture for learning and evolving flexible job-shop schedules. Eur J Oper Res 179:316–333 Hurink E, Jurisch B, Thole M (1994) Tabu search for the job shop scheduling problem with multi-purpose machines. Oper Res Spektrum 15:205–215 Hussain MF, Joshi SB (1998) A genetic algorithm for job shop scheduling problem with alternate routing. IEEE Int Conf Syst Man Cybern 3:2225–2230 Jia HZ, Nee AYC, Fuh JYH, Zhang YF (2003) A modified genetic algorithm for distributed scheduling problems. J Int Manuf 14:351–362 Kacem I (2003) Genetic algorithm for the flexible job-shop scheduling problem. IEEE Int Conf Syst Man Cybern 4:3464–3469 Kacem I, Hammadi S, Borne P (2002a) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybern 32–1:1–13 Kacem I, Hammadi S, Borne P (2002b) Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60(3):245–276 Kumar R, Tiwari MK, Shankar R (2003) Scheduling of flexible manufacturing systems: an ant colony optimization approach. IMechE 217(B):1443–1453 Lee DY, DiCesare F (1994) Scheduling flexible manufacturing systems using petri nets and heuristic search. IEEE Trans Robot Autom 10(2):123–132 Lee EJ, Mirchandani PB (1988) Concurrent routing, sequencing, and setups for a two-machine flexible manufacturing cell. IEEE J Robot Autom 4(3):256–264 Ling QI, Jian-dong Y, Bao LI, Han-cheng YU (2010) Flexible job-shop scheduling problem based on adaptive ant colony algorithm. J Mech Electrical Eng. doi:CNKI:SUN:JDGC.0.2010-02-016 Liu H, Abraham A, Wang Z (2009) A multi-swarm approach to multi-objective flexible job-shop scheduling problems. Fundam Informaticae 95:465–489 Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Schedul 3:3–20 Mattfeld DC (1996) Evolutionary search and the job shop: investigations on genetic algorithms for production scheduling. Physica-Verlag, Germany, Heidelberg Mellor P (1966) A review of job shop scheduling. Operat Res Q 17(2):161–171 Mesghouni K, Hammadi S, Borne P (1997) Evolution programs for job-shop scheduling. IEEE international conference on systems, man, and cybernetics, vol 1. Orlando, Florida, pp 720–725 Mirchandani P, Lee EJ, Vasquez A (1988) Concurrent scheduling in flexible automation. Proceedings of the 1988 IEEE international conference on systems, man, and cybernetics, vol 2(8–12), pp 868–872 Murovec B, Šuhel P (2004) A repairing technique for the local search of the job-shop problem. Eur J Oper Res 153:220–238 Najid NM, Dauzére-Pérés S, Zaidat A (2002) A modified simulated annealing method for flexible job shop scheduling problem. IEEE Int Conf Syst Man Cyber 5(6):1–6 Paulli J (1995) A hierarchical approach for the FMS scheduling problem. Eur J Oper Res 86(1):32–42 Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the flexible job-shop scheduling problem. Comput Oper Res 35:3202–3212 Pinedo M (2002) Scheduling: theory, algorithms and systems. Prentice-Hall, Englewood cliffs, NJ Tay JC, Wibowo D (2004) An effective chromosome representation for evaluating flexible job shop schedules. Genet Evol Comput 3103:210–221 Wei Q, Qiaoyun L (2009) Solving the flexible job shop scheduling problem based on the adaptive genetic algorithm. Int Forum Comput Sci Technol Appl 1:97–100 White T, Oppacher F (1994) Adaptive crossover using automata. Lecture notes in computer science, Springer Berlin, Heidelberg, vol 866, pp 229–238 Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48(2):409–425 Xing L-N, Chen Y-W, Yang K-W (2009) An efficient search method for multi-objective flexible job shop scheduling problems. J Intell Manuf 20:283–293 Xing L-N, Chen Y-W, Wang P, Zhao Q-S, Xiong J (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10:888–896 Xu D-S, Ai X-Y, Xing L-N, (2009) An improved ant colony optimization for flexible job shop scheduling problems. Proceedings of the 2009 international joint conference on computational sciences and optimization, vol 1, pp 517–519 Yang J-B (2001) GA-based discrete dynamic programming approach for scheduling in FMS environments. IEEE Trans Syst Man Cybernetics B 31(5):824–835 Zhang GH, Shao XY, Li PG, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multiobjective flexible job-shop scheduling problems. Comput Ind Eng 56(4):1309–1318 Zribi N, Kacem I, Kamel AE (2007) Assignment and scheduling in flexible job-shops by hierarchical optimization. IEEE Trans Syst Man Cybernetics C Appl Rev 37(4):652–661