An improved PSO algorithm with genetic and neighborhood-based diversity operators for the job shop scheduling problem

References

• Amirthagadeswaran, K. S., and V. P. Arunachalam. 2006. Improved solutions for job shop scheduling problems through genetic algorithm with a different method of schedule deduction. The International Journal of Advanced Manufacturing Technology 28(5–6):532–40. doi:10.1007/s00170-004-2403-1.
   Web of Science ®Google Scholar
• Arani, B. O., P. Mirzabeygi, and M. S. Panahi. 2013. An improved PSO algorithm with a territorial diversity-preserving scheme and enhanced exploration–Exploitation balance. Swarm and Evolutionary Computation 11:1–15. doi:10.1016/j.swevo.2012.12.004.
   Web of Science ®Google Scholar
• Banharnsakun, A., B. Sirinaovakul, and T. Achalakul. 2012. Job shop scheduling with the best-so-far ABC. Engineering Applications of Artificial Intelligence 25(3):583–93. doi:10.1016/j.engappai.2011.08.003.
   Web of Science ®Google Scholar
• Chen, H., and P. B. Luh. 2003. An alternative framework to Lagrangian relaxation approach for job shop scheduling. European Journal of Operational Research 149(3):499–512. doi:10.1016/S0377-2217(02)00470-8.
   Web of Science ®Google Scholar
• Chong, C. S., A. I. Sivakumar, M. Y. H. Low, and K. L. Gay. 2006. A bee colony optimization algorithm to job shop scheduling. Proceedings of the 38th conference on Winter simulation, 1954–61. Winter Simulation Conference. Monterey, CA, USA: IEEE.
   Google Scholar
• Eberhart, R. C., and J. Kennedy. 1995. A new optimizer using particle swarm theory. Proceedings of the sixth international symposium on micro machine and human science, vol. 1, 39–43. Piscataway NJ, United States: IEEE Press.
   Google Scholar
• Eberhart, R. C., and Y. Shi. 2001. Particle swarm optimization: Developments, applications and resources. Evolutionary Computation, 2001. Proceedings of the 2001 Congress on, vol. 1, 81–86. Seoul, South Korea: IEEE.
   Google Scholar
• Fisher, H., and G. L. Thompson. 1963. Probabilistic learning combinations of local job-shop scheduling rules. Industrial Scheduling 3:225–51.
   Google Scholar
• Gao, L., G. Zhang, L. Zhang, and X. Li. 2011. An efficient memetic algorithm for solving the job shop scheduling problem. Computers & Industrial Engineering 60(4):699–705. doi:10.1016/j.cie.2011.01.003.
   Web of Science ®Google Scholar
• Garey, M. R., D. S. Johnson, and R. Sethi. 1976. The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1(2):117–29. doi:10.1287/moor.1.2.117.
   Google Scholar
• Ge, H., W. Du, and F. Qian. 2007. A hybrid algorithm based on particle swarm optimization and simulated annealing for job shop scheduling. Natural Computation, 2007. ICNC 2007. Third International Conference on, vol. 3, 715–19. Haikou, China: IEEE.
   Google Scholar
• Ge, H. W., L. Sun, Y. C. Liang, and F. Qian. 2008. An effective PSO and AIS-based hybrid intelligent algorithm for job-shop scheduling. Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions On 38(2):358–68. doi:10.1109/TSMCA.2007.914753.
   Web of Science ®Google Scholar
• Geyik, F., and I. H. Cedimoglu. 2004. The strategies and parameters of Tabu search for job-shop scheduling. Journal of Intelligent Manufacturing 15(4):439–48. doi:10.1023/B:JIMS.0000034106.86434.46.
   Web of Science ®Google Scholar
• Heilmann, R. 2003. A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags. European Journal of Operational Research 144(2):348–65. doi:10.1016/S0377-2217(02)00136-4.
   Web of Science ®Google Scholar
• Kaskavelis, C. A., and M. C. Caramanis. 1998. Efficient Lagrangian relaxation algorithms for industry size job-shop scheduling problems. IIE Transactions 30(11):1085–97. doi:10.1080/07408179808966565.
   Web of Science ®Google Scholar
• Lawrence, S. 1984. Resource constrained project scheduling: An experimental investigation of heuristic scheduling techniques (supplement). Pittsburgh: Graduate School of Industrial Administration, Carnegie Mellon University.
   Google Scholar
• Lian, Z., B. Jiao, and X. Gu. 2006. A similar particle swarm optimization algorithm for job-shop scheduling to minimize makespan. Applied Mathematics and Computation 183(2):1008–17. doi:10.1016/j.amc.2006.05.168.
   Web of Science ®Google Scholar
• Liao, C. J., C. T. Tseng, and P. Luarn. 2007. A discrete version of particle swarm optimization for flowshop scheduling problems. Computers & Operations Research 34(10):3099–111. doi:10.1016/j.cor.2005.11.017.
   Web of Science ®Google Scholar
• Lin, T. L., S. J. Horng, T. W. Kao, Y. H. Chen, R. S. Run, R. J. Chen, and I. H. Kuo. 2010. An efficient job-shop scheduling algorithm based on particle swarm optimization. Expert Systems with Applications 37(3):2629–36. doi:10.1016/j.eswa.2009.08.015.
   Web of Science ®Google Scholar
• Liu, L. L., R. S. Hu, X. P. Hu, G. P. Zhao, and S. Wang. 2015. A hybrid PSO-GA algorithm for job shop scheduling in machine tool production. International Journal of Production Research, 53(19):5755–5781.
   Google Scholar
• Liu, L. L., G. P. Zhao, S. S. Ou’Yang, and Y. J. Yang. 2011. Integrating theory of constraints and particle swarm optimization in order planning and scheduling for machine tool production. The International Journal of Advanced Manufacturing Technology 57(1–4):285–96. doi:10.1007/s00170-011-3294-6.
   Web of Science ®Google Scholar
• Liu, T. K., J. T. Tsai, and J. H. Chou. 2006. Improved genetic algorithm for the job-shop scheduling problem. The International Journal of Advanced Manufacturing Technology 27(9–10):1021–29. doi:10.1007/s00170-004-2283-4.
   Web of Science ®Google Scholar
• Lorigeon, T., J. C. Billaut, and J. L. Bouquard. 2002. A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint. Journal of the Operational Research Society 53(11):1239–46. doi:10.1057/palgrave.jors.2601421.
   Web of Science ®Google Scholar
• Neto, R. T., and M. Godinho Filho. 2013. Literature review regarding Ant Colony Optimization applied to scheduling problems: Guidelines for implementation and directions for future research. Engineering Applications of Artificial Intelligence 26(1):150–61. doi:10.1016/j.engappai.2012.03.011.
   Web of Science ®Google Scholar
• Pezzella, F., and E. Merelli. 2000. A tabu search method guided by shifting bottleneck for the job shop scheduling problem. European Journal of Operational Research 120(2):297–310. doi:10.1016/S0377-2217(99)00158-7.
   Web of Science ®Google Scholar
• Qing-Dao-Er-Ji, R., and Y. Wang. 2012. A new hybrid genetic algorithm for job shop scheduling problem. Computers & Operations Research 39(10):2291–99. doi:10.1016/j.cor.2011.12.005.
   Web of Science ®Google Scholar
• Riget, J., and J. S. Vesterstrøm. 2002. A diversity-guided particle swarm optimizer-the ARPSO. Dept. Comput. Sci., Univ. of Aarhus, Aarhus, Denmark, Tech. Rep, 2, p.2002.
   Google Scholar
• Sha, D. Y., and C. Y. Hsu. 2006. A hybrid particle swarm optimization for job shop scheduling problem. Computers & Industrial Engineering 51(4):791–808. doi:10.1016/j.cie.2006.09.002.
   Web of Science ®Google Scholar
• Sun, J., W. Xu, and W. Fang. 2006. A diversity-guided quantum-behaved particle swarm optimization algorithm. In Wang TD. et al. (ed.), Simulated evolution and learning, SEAL 2006, 497–504. Springer, Berlin, Heidelberg.
   Google Scholar
• Suresh, R. K., and K. M. Mohanasundaram. 2006. Pareto archived simulated annealing for job shop scheduling with multiple objectives. The International Journal of Advanced Manufacturing Technology 29(1–2):184–96. doi:10.1007/s00170-004-2492-x.
   Web of Science ®Google Scholar
• Taillard, E. D. 1993. Benchmarks for basic scheduling problems. European Journal of Operational Research 64:278–85. doi:10.1016/0377-2217(93)90182-M.
   Web of Science ®Google Scholar
• Tang, J., G. Zhang, B. Lin, and B. Zhang. 2010. A hybrid PSO/GA algorithm for job shop scheduling problem. In Tan K.C. (ed.), Advances in Swarm Intelligence, ICSI 2010, 566–73. Springer, Berlin, Heidelberg.
   Google Scholar
• Tasgetiren, M. F., M. Sevkli, Y. C. Liang, and M. M. Yenisey. 2006. A particle swarm optimization and differential evolution algorithms for job shop scheduling problem. International Journal of Operations Research 3(2):120–35.
   Google Scholar
• Tseng, C. T., and C. J. Liao. 2008. A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks. International Journal of Production Research 46(17):4655–70. doi:10.1080/00207540701294627.
   Web of Science ®Google Scholar
• Tsujimura, Y., Y. Mafune, and M. Gen. 2001. Effects of symbiotic evolution in genetic algorithms for job-shop scheduling. Proceedings of the 34th IEEE Annual International Conference on System Sciences, Hawaii, 1–7.
   Google Scholar
• Watson, J. P., J. C. Beck, A. E. Howe, and L. D. Whitley. 2003. Problem difficulty for Tabu search in job-shop scheduling. Artificial Intelligence 143(2):189–217. doi:10.1016/S0004-3702(02)00363-6.
   Web of Science ®Google Scholar
• Xia, W. J., and Z. M. Wu. 2006. A hybrid particle swarm optimization approach for the job-shop scheduling problem. The International Journal of Advanced Manufacturing Technology 29(3–4):360–66. doi:10.1007/s00170-005-2513-4.
   Web of Science ®Google Scholar
• Yongxian, L., L. Xiaotian, and Z. Jinfu. 2008. Research on job-shop scheduling optimization method with limited resources. The International Journal of Advanced Manufacturing Technology 38(3–4):386–92. doi:10.1007/s00170-007-1345-9.
   Web of Science ®Google Scholar
• Yu, H., and W. Liang. 2001. Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling. Computers & Industrial Engineering 39(3):337–56. doi:10.1016/S0360-8352(01)00010-9.
   Web of Science ®Google Scholar
• Zhang, J., X. Hu, X. Tan, J. H. Zhong, and Q. Huang. 2006. Implementation of an ant colony optimization technique for job shop scheduling problem. Transactions of the Institute of Measurement and Control 28(1):93–108. doi:10.1191/0142331206tm165oa.
   Web of Science ®Google Scholar