An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem

Baykasoglu, 2004, Using multiple objective tabu search and grammars to model and solve multi-objective flexible job-shop scheduling problems, Journal of Intelligent Manufacturing, 15, 777, 10.1023/B:JIMS.0000042663.16199.84 Brandimarte, 1993, Routing and scheduling in a flexible job shop by taboo search, Annals of Operations Research, 41, 157, 10.1007/BF02023073 Chen, H., Ihlow, J., & Lehmann, C. (1999). A genetic algorithm for flexible job-shop scheduling. In Proceedings of IEEE international conference on robotics and automation (pp.1120–1125). Detroit. Deb, 2001 Garey, 1976, The complexity of flow shop and job-shop scheduling, Mathematics of Operations Research, 1, 117, 10.1287/moor.1.2.117 Glover, 1997 Hsu, T., Dupas, R., Jolly, D., & Goncalves, G. (2002). Evaluation of mutation heuristics for the solving of multiobjective flexible job shop by an evolutionary algorithm. In Proceedings of the 2002 IEEE international conference on systems, man and cybernetics (Vol. 5, pp. 655–660). Hurink, 1994, Tabu search for the job shop scheduling problem with multi-purpose machine, Operations Research Spektrum, 15, 205, 10.1007/BF01719451 Kacem, 2002, Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems, IEEE transactions on systems, man, and cybernetics, Part C, 32, 1, 10.1109/TSMCC.2002.1009117 Kacem, 2002, Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic, Mathematics and Computers in Simulation, 60, 245, 10.1016/S0378-4754(02)00019-8 Kennedy, 1997, Particle swarm: social adaptation of knowledge, 303 Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of the 1995 IEEE international conference on neural network (Vol. IV, No. 4, pp. 1942–1948). Lawler, 1993, Sequencing and scheduling: Algorithms and complexity, 445 Mastrolilli, 2000, Effective neighborhood functions for the flexible job shop problem, Journal of Scheduling, 3, 3, 10.1002/(SICI)1099-1425(200001/02)3:1<3::AID-JOS32>3.0.CO;2-Y Mesghouni, K., Hammadi, S., & Borne, P. (1997). Evolution programs for job-shop scheduling. In Proceedings of the 1997 IEEE international conference on systems, man and cybernetics (Vol. 1, pp. 720–725). Parsopoulos, 2002, Recent approaches to global optimization problems through particle swarm optimization, Natural Computing, 1, 235, 10.1023/A:1016568309421 Rigao, 2004, Tardiness minimization in a flexible job shop: A tabu search approach, Journal of Intelligent Manufacturing, 15, 103, 10.1023/B:JIMS.0000010078.30713.e9 Sonmez, 1998, A new dynamic programming formulation of (n∗m) flow shop sequencing problems with due dates, International Journal of Production Research, 36, 2269, 10.1080/002075498192896 Xia, 2005, An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems, Computers and Industrial Engineering, 48, 409, 10.1016/j.cie.2005.01.018