An Efficient Artificial Fish Swarm Model with Estimation of Distribution for Flexible Job Shop Scheduling

References

• M.R. Garey, D.S. Johnson, and R. Sethi, The complexity of flow shop and job shop scheduling, Math. Oper. Res. 1(2) (1976) 117–129.
   Google Scholar
• P. Bruker, and R. Schlie, Job-shop scheduling with multipurpose machines, Computing. 45(4) (1991) 369–375. doi: 10.1007/BF02238804
   Web of Science ®Google Scholar
• M. Singer and M. Pinedo, A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops, IIE trans. 30(2) (1998) 109–118.
   Web of Science ®Google Scholar
• N. Zribi, I. Kacem, A.E. Kamel, and P. Borne, Assignment and scheduling in flexible job-shops by hierarchical optimization, IEEE T. Syst. Man Cy. C. 37(4) (2007) 652–661. doi: 10.1109/TSMCC.2007.897494
   Web of Science ®Google Scholar
• J.B. Yang, GA-based discrete dynamic programming approach for scheduling in FMS environments, IEEE T. Syst. Man. Cy. B. 31(5) (2001) 824–835. doi: 10.1109/3477.956045
   PubMed Web of Science ®Google Scholar
• C.R. Scrich, V.A. Armentano, and M. Laguna, Tardiness minimization in a flexible job shop: a tabu search approach, J. Intell. Manuf. 15(1) (2004) 103–115. doi: 10.1023/B:JIMS.0000010078.30713.e9
   Web of Science ®Google Scholar
• B. Barzegar, H. Motameni, and H. Bozorgi, Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net, J. Appl. Math. 9 (2012) 701–708.
   Google Scholar
• K. Kianfar, S.M.T. Fatemi Ghomi, and B. Karimi: New dispatching rules to minimize rejection and tardiness costs in a dynamic flexible flow shop, Int. J. Adv. Manuf. Technol. 45(7–8) (2009) 759–771. doi: 10.1007/s00170-009-2015-x
   Web of Science ®Google Scholar
• M. Pinedo and M. Singer, A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop, Nav. Res. Log, 46(1) (1999) 1–17. doi: 10.1002/(SICI)1520-6750(199902)46:1<1::AID-NAV1>3.0.CO;2-#
   Web of Science ®Google Scholar
• C.A. Kaskavelis and M.C. Caramanis, Efficient Lagrangian relaxation algorithms for industry size jobshop scheduling problems, IIE transactions. 30(11) (1998) 1085–1097.
   Web of Science ®Google Scholar
• P. Brandimarte, Routing and scheduling in a flexible job shop by tabu search, Ann. Oper. Res, 41(3) (1993) 157–183. doi: 10.1007/BF02023073
   Google Scholar
• M. Mastrolilli and L. Gambardella, Effective neighbourhood functions for the flexible job shop problem. J. Scheduling. 3(1) (2000), 3–20. doi: 10.1002/(SICI)1099-1425(200001/02)3:1<3::AID-JOS32>3.0.CO;2-Y
   Google Scholar
• W. Bozejko, M. Uchronski, and M. Wodecki, Parallel hybrid metaheuristics for the flexible job shop problem, Comput. Ind. Eng. 59(2) (2010) 323–333. doi: 10.1016/j.cie.2010.05.004
   Web of Science ®Google Scholar
• J. Li, Q. Pan, P. Suganthan, and T. Chua, A hybrid tabu search algorithm with an efficient neighborhood structure for the flexiblejob shop scheduling problem, Int. J. Adv. Manuf. Technol. 52(5–8) (2011) 683–697. doi: 10.1007/s00170-010-2743-y
   Web of Science ®Google Scholar
• H. Chen, J. Ihlow, and C. Lehmann, A genetic algorithm for flexible job-shop scheduling, Proc. of the International Conference on Robotics and Automation, (Detroit, Michigan, 1999), pp.1120–1125.
   Google Scholar
• I. Kacem, S. Hammadi, and P. Borne, Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems, IEEE T. Syst. Man. Cy. C. 32(1) (2002) 1–13. doi: 10.1109/TSMCC.2002.1009117
   Web of Science ®Google Scholar
• F. Pezzella, G. Morganti, and G. Ciaschetti, A genetic algorithm for the flexible job-shop scheduling problem, Comput. Oper. Res. 35(10) (2008) 3202–3212. doi: 10.1016/j.cor.2007.02.014
   Web of Science ®Google Scholar
• J. Gao, L. Sun, and M. Gen, A hybrid genetic and variable neighborhood descent algorithm for flexiblejob shop scheduling problems, Comput. Oper. Res. 35(9) (2008) 2892–2907. doi: 10.1016/j.cor.2007.01.001
   Web of Science ®Google Scholar
• N.M. Najid, S. Dauzere-Peres, and A. Zaidat, A modified simulated annealing method for Flexible Job Shop Scheduling Problem, IEEE Sys. Man. Cy. A. 5 (2002) 117–123.
   Google Scholar
• P. Fattahi, A hybrid multi objective algorithm for flexible job shop scheduling, Int. J. Comput. Math. Sci. 3 (2009) 215–220.
   Google Scholar
• N. Shivasankaran, P. Senthilkumar, and K. Venkatesh Raja K, Hybrid non-dominated sorting simulated annealing algorithm for flexible job shop scheduling problems, Proc. of the 48th Annual Convention of Computer Society ˄ Visakhapatnam, India, 2014 ˅ , vol.248, pp.101–107.
   Google Scholar
• B.S. Girish and N. Jawahar, A particle swarm optimization algorithm for flexible job shop scheduling problem, Proc. of the IEEE International Conference on Automation Science and Engineering (Bangalore, India, 2009), pp.298–303.
   Google Scholar
• G. Zhang, X. Shao, P. Li, and L. Gao, An effective hybrid particle swarm optimization algorithm for multiobjective flexible job-shop scheduling problem, Comput. Ind. Eng. 56(4) (2009) 1309–1318. doi: 10.1016/j.cie.2008.07.021
   Web of Science ®Google Scholar
• X. Shao, W. Liu, Q. Liu, and C. Zhang, Hybrid discrete particle swarm optimization for multi-objective flexible job-shop scheduling problem, Int. J. Adv. Manuf. Technol. 67(9–12) (2013) 2885–2901. doi: 10.1007/s00170-012-4701-3
   Web of Science ®Google Scholar
• B.Z. Yao, C.Y. Yang, J.J. Hu, J.B. Yao, and J. Sun, An improved ant colony optimization for flexible job shop scheduling problems, Adv. Sci. Lett. 4(6–7) (2011) 2127–2131. doi: 10.1166/asl.2011.1601
   Google Scholar
• S.K. Sim, K.T. Yeo, and W.H. Lee, An expert neural network system for dynamic job-shop scheduling, Int. J. Prod. Res. 32(8) (1994) 1759–1773. doi: 10.1080/00207549408957040
   Web of Science ®Google Scholar
• A. Bagheri, M. Zandieh, I. Mahdavi, and M. Yazdani, An artificial immune algorithm for the flexible job-shop scheduling problem, Future Gener. Comp. Sy. 26(4) (2010) 533–541. doi: 10.1016/j.future.2009.10.004
   Web of Science ®Google Scholar
• X.S. Han, Y.C. Liang, and Z.G. Li, An efficient genetic algorithm for optimization problems with timeconsuming fitness evaluation, Int. J. Comp. Meth.-Sing, 12(1) (2015) 13501061–24.
   Google Scholar
• X. Li, Z. Shao, and J. Qian, An optimizing method based on autonomous animates: fish-swarm algorithm, Syst. Eng. Theory. Prac. 22(11) (2002): 32–38.
   Google Scholar
• M. Neshat, G. Sepidnam, M. Sargolzaei, and A.N. Toosi, Artificial fish swarm algorithm: a survey of the state-ofthe-art, hybridization, combinatorial and indicative applications, Artif. Intell. Rev. 42(4) (2002) 965–997.
   Google Scholar
• M. Jiang and K. Zhu, Multiobjective optimization by artificial fish swarm algorithm. Proc. of the IEEE 1. International Conference on Automation Science and Engineering, (Trieste, Italy, 2011), pp.506–511.
   Google Scholar
• K. Zhu and M. Jiang, The optimization of job shop scheduling problem based on artificial fish swarm algorithm with tabu search strategy, Proc. of International Workshop on Advanced Computational Intelligent (Hangzhou, China, 2013), pp.323–327.
   Google Scholar
• S. He, N. Belacel, H. Hamam, and Y. Bouslimani Fuzzy clustering with improved artificial fish swarm algorithm, Proc. of the Int. Joint Conf. on Computational Sciences and Optimization (Hainan, Sanya, China, 2009), vol.2, pp.317–321.
   Google Scholar
• H.W. Ge, L. Sun, Y.C. Liang, and F. Qian, An effective PSO-and-AIS-based hybrid intelligent algorithm for jobshop scheduling, IEEE T. Syst. Man. Cy. A., 38(2) (2008) 358–368. doi: 10.1109/TSMCA.2007.914753
   Web of Science ®Google Scholar
• J.W. Barnes and J.B. Chambers, Flexible job shop scheduling by tabu search, Graduate program in operations research and industrial engineering, the University of Texas at Austin, Technical Report Series (1996), ORP96–09.
   Google Scholar
• J. Hurink, B. Jurisch, and M. Thole, Tabu search for the job-shop scheduling problem with multi-purpose machines, OR. Spectrum. 15(4) (1994) 205–215. doi: 10.1007/BF01719451
   Google Scholar
• A. Ben Hmida, M. Haouari, M.J. Huguet, and P. Lopez, Discrepancy search for the flexible job shop scheduling problem, Comput. Oper. Res. 37(12) (2010) 2192–2201. doi: 10.1016/j.cor.2010.03.009
   Web of Science ®Google Scholar
• B. Jurisch, Scheduling jobs in shops with multi-purpose machines. Thesis PhD. Fachbereich Mathematik Informatik (Universitat Osnabruck, 1992).
   Google Scholar
• L. Wang, G. Zhou, Y. Xu, S. Wang, and M. Liu, An effective artificial bee colony algorithm for the flexible job-shop scheduling problem, Int. J. Adv. Manuf. Technol. 60(1–4) (2012) 303–315. doi: 10.1007/s00170-011-3610-1
   Web of Science ®Google Scholar
• Y. Yuan, H. Xu, and J. Yang, A hybrid harmony search algorithm for the flexible job shop scheduling problem, Appl. Soft. Comput. 13(7) (2013) 3259–3272. doi: 10.1016/j.asoc.2013.02.013
   Web of Science ®Google Scholar
• M. Yazdani, M. Amiri, and M. Zandieh, Flexible jobshop scheduling with parallel variable neighborhood search algorithm, Expert Syst. Appl. 37(1) (2010) 678–687. doi: 10.1016/j.eswa.2009.06.007
   Web of Science ®Google Scholar
• L. Wang, S. Wang, Y. Xu, G. Zhou, and M. Liu, A bipopulation based estimation of distribution algorithm for the flexible job-shop scheduling problem, Comput. Ind. Eng. 62(4) (2012) 917–926. doi: 10.1016/j.cie.2011.12.014
   Web of Science ®Google Scholar
• Y. Yuan and H. Xu, Flexible job shop scheduling using hybrid differential evolution algorithms, Comput. Ind. Eng. 65(2) (2013) 246–260. doi: 10.1016/j.cie.2013.02.022
   Web of Science ®Google Scholar
• A. Oddi, R. Rasconi, A. Cesta, and S. Smith, Iterative flattening search for the flexible job shop scheduling problem, Proc. of the International Joint Conferences on Artificial Intelligence (Barcelona, Catalonia, Span, 2011), 22(3): 1991-1996.
   Google Scholar