Table of Contents Author Guidelines Submit a Manuscript
Modelling and Simulation in Engineering
Volume 2016 (2016), Article ID 5071654, 15 pages
http://dx.doi.org/10.1155/2016/5071654
Research Article

Forward VNS, Reverse VNS, and Multi-VNS Algorithms for Job-Shop Scheduling Problem

Industrial Engineering Program, Faculty of Engineering, Thai-Nichi Institute of Technology, Bangkok 10250, Thailand

Received 19 April 2016; Revised 3 July 2016; Accepted 11 August 2016

Academic Editor: Farouk Yalaoui

Copyright © 2016 Pisut Pongchairerks. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. R. Baker and D. Trietsch, Principles of Sequencing and Scheduling, John Wiley & Sons, Hoboken, NJ, USA, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, Springer, New York, NY, USA, 4th edition, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. M. Gen and R. Cheng, Genetic Algorithms and Engineering Design, John Wiley & Sons, New York, NY, USA, 1996.
  4. E. Nowicki and C. Smutnicki, “An advanced tabu search algorithm for the job shop problem,” Journal of Scheduling, vol. 8, no. 2, pp. 145–159, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. C. Y. Zhang, P. Li, Z. Guan, and Y. Rao, “A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem,” Computers & Operations Research, vol. 34, no. 11, pp. 3229–3242, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. R. K. Suresh and K. M. Mohanasundaram, “Pareto archived simulated annealing for job shop scheduling with multiple objectives,” International Journal of Advanced Manufacturing Technology, vol. 29, no. 1-2, pp. 184–196, 2006. View at Publisher · View at Google Scholar · View at Scopus
  7. M. F. Tasgetiren, M. Sevkli, Y.-C. Liang, and M. M. Yenisey, “A particle swarm optimization and differential evolution algorithms for job shop scheduling problem,” International Journal of Operations Research, vol. 3, no. 2, pp. 120–135, 2006. View at Google Scholar · View at MathSciNet
  8. J. F. Gonçalves and M. G. C. Resende, “An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling,” International Transactions in Operational Research, vol. 21, no. 2, pp. 215–246, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. J. F. Gonçalves, J. J. Mendes, and M. G. Resende, “A hybrid genetic algorithm for the job shop scheduling problem,” European Journal of Operational Research, vol. 167, no. 1, pp. 77–95, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. M. Watanabe, K. Ida, and M. Gen, “A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem,” Computers and Industrial Engineering, vol. 48, no. 4, pp. 743–752, 2005. View at Publisher · View at Google Scholar · View at Scopus
  11. M. F. N. Maghfiroh, A. Darnawan, and V. F. Yu, “Genetic algorithm for job shop scheduling problem: a case study,” International Journal of Innovation, Management and Technology, vol. 4, no. 1, pp. 137–140, 2013. View at Google Scholar
  12. N. H. Moin, O. C. Sin, and M. Omar, “Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems,” Mathematical Problems in Engineering, vol. 2015, Article ID 210680, 12 pages, 2015. View at Publisher · View at Google Scholar · View at Scopus
  13. M. Gen, Y. Tsujimura, and E. Kubota, “Solving job-shop scheduling problem using genetic algorithms,” in Proceedings of the 16th International Conference on Computers and Industrial Engineering, pp. 576–579, Ashikaga, Japan, 1994.
  14. P. Pongchairerks and V. Kachitvichyanukul, “A two-level particle swarm optimization algorithm on job-shop scheduling problems,” International Journal of Operational Research, vol. 4, no. 4, pp. 390–411, 2009. View at Publisher · View at Google Scholar · View at Scopus
  15. P. Pongchairerks, “Particle swarm optimization algorithm applied to scheduling problems,” ScienceAsia, vol. 35, no. 1, pp. 89–94, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Pongchairerks, “A self-tuning PSO for job-shop scheduling problems,” International Journal of Operational Research, vol. 19, no. 1, pp. 96–113, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. P. Pongchairerks and V. Kachitvichyanukul, “A comparison between algorithms VNS with PSO and VNS without PSO for job-shop scheduling problems,” International Journal of Computational Science, vol. 1, no. 2, pp. 179–191, 2007. View at Google Scholar
  18. M. Sevkli and M. E. Aydin, “Variable neighbourhood search for job shop scheduling problems,” Journal of Software, vol. 1, no. 2, pp. 34–39, 2006. View at Google Scholar · View at Scopus
  19. P. Pongchairerks, “Variable neighbourhood search algorithms applied to job-shop scheduling problems,” International Journal of Mathematics in Operational Research, vol. 6, no. 6, pp. 752–774, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. L.-L. Liu, R.-S. Hu, X.-P. Hu, G.-P. Zhao, and S. Wang, “A hybrid PSO-GA algorithm for job shop scheduling in machine tool production,” International Journal of Production Research, vol. 53, no. 19, pp. 5755–5781, 2015. View at Publisher · View at Google Scholar · View at Scopus
  21. J.-Q. Li, S.-X. Xie, Q.-K. Pan, and S. Wang, “A hybrid artificial bee colony algorithm for flexible job shop scheduling problems,” International Journal of Computers, Communications and Control, vol. 6, no. 2, pp. 286–296, 2011. View at Publisher · View at Google Scholar · View at Scopus
  22. A. Udomsakdigool and V. Kachitvichyanukul, “Two-way scheduling approach in ant algorithm for solving job shop problem,” Industrial Engineering and Management Systems, vol. 5, no. 2, pp. 68–75, 2007. View at Google Scholar
  23. L. Gao, G. Zhang, L. Zhang, and X. Li, “An efficient memetic algorithm for solving the job shop scheduling problem,” Computers and Industrial Engineering, vol. 60, no. 4, pp. 699–705, 2011. View at Publisher · View at Google Scholar · View at Scopus
  24. C. Zhang, P. Li, Y. Rao, and S. Li, “A new hybrid GA/SA algorithm for the job shop scheduling problem,” in Proceedings of the 5th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP '05), pp. 246–259, Lausanne, Switzerland, April 2005. View at Scopus
  25. N. Mladenović and P. Hansen, “Variable neighborhood search,” Computers and Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997. View at Publisher · View at Google Scholar · View at MathSciNet
  26. P. Hansen and N. Mladenović, “Variable neighborhood search: principles and applications,” European Journal of Operational Research, vol. 130, no. 3, pp. 449–467, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. J. A. Moreno-Pérez, P. Hansen, and N. Mladenović, “Parallel variable neighborhood searchs,” Tech. Rep., Group of Intelligent Computing, Universidad de La Laguna, La Laguna, Spain, 2004. View at Google Scholar
  28. M. M. Gargari and M. S. F. Niasar, “A dynamic discrete berth allocation problem for container terminals,” in Proceedings of the Conference on Maritime-Port Technology, Trondheim, Norway, 2014.
  29. I. Piriyaniti and P. Pongchairerks, “Variable neighbourhood search algorithms for asymmetric travelling salesman problems,” International Journal of Operational Research, vol. 18, no. 2, pp. 157–170, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  30. T. Davidovic, T. G. Crainic, and T. Davidović, “Parallelization strategies for variable neighborhood search,” Tech. Rep., CIRRELT, Université de Montréal, Montreal, Canada, 2013. View at Google Scholar
  31. T. Yamada and R. Nakano, “Fusion of crossover and local search,” in Proceedings of the IEEE International Conference on Industrial Technology, pp. 426–430, Shanghai, China, December 1994. View at Scopus
  32. J. Alcaraz and C. Maroto, “A robust genetic algorithm for resource allocation in project scheduling,” Annals of Operations Research, vol. 102, no. 1–4, pp. 83–109, 2001. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. E. J. Anderson, C. A. Glass, and C. N. Potts, “Machine scheduling,” in Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, Eds., pp. 361–414, Princeton University Press, Princeton, NJ, USA, 2003. View at Google Scholar
  34. H. Fisher and G. L. Thompson, “Probabilistic learning combinations of local job-shop scheduling rules,” in Industrial Scheduling, J. F. Muth and G. L. Thompson, Eds., pp. 225–251, Prentice-Hall, Englewood Cliffs, NJ, USA, 1963. View at Google Scholar
  35. S. Lawrence, Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pa, USA, 1984.