Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 184643, 10 pages
http://dx.doi.org/10.1155/2015/184643
Research Article

A Modified Biogeography-Based Optimization for the Flexible Job Shop Scheduling Problem

School of Electrical Engineering, Shanghai Dianji University, Shanghai 200240, China

Received 20 May 2015; Accepted 28 September 2015

Academic Editor: George S. Dulikravich

Copyright © 2015 Yuzhen Yang. 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. P. Brucker and R. Schlie, “Job-shop scheduling with multi-purpose machines,” Computing, vol. 45, no. 4, pp. 369–375, 1990. View at Publisher · View at Google Scholar · View at Scopus
  2. P. Brandimarte, “Routing and scheduling in a flexible job shop by tabu search,” Annals of Operations Research, vol. 41, no. 3, pp. 157–183, 1993. View at Publisher · View at Google Scholar · View at Scopus
  3. M. Mastrolilli and L. M. Gambardella, “Effective neighbourhood functions for the flexible job shop problem,” Journal of Scheduling, vol. 3, no. 1, pp. 3–20, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. F. Pezzella, G. Morganti, and G. Ciaschetti, “A genetic algorithm for the flexible job-shop scheduling problem,” Computers and Operations Research, vol. 35, no. 10, pp. 3202–3212, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. N. B. Ho and J. C. Tay, “Evolving dispatching rules for solving the flexible job-shop problem,” in Proceedings of the IEEE Congress on Evolutionary Computation, vol. 3, pp. 2848–2855, Edinburgh, UK, September 2005.
  6. N. B. Ho and J. C. Tay, “GENACE: an efficient cultural algorithm for solving the flexible job-shop problem,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), vol. 2, pp. 1759–1766, IEEE, June 2004. View at Publisher · View at Google Scholar
  7. N. B. Ho and J. C. Tay, “LEGA: an architecture for learning and evolving flexible job-shop schedules,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '05), vol. 2, pp. 1380–1387, September 2005. View at Scopus
  8. M. Yazdani, M. Amiri, and M. Zandieh, “Flexible job-shop scheduling with parallel variable neighborhood search algorithm,” Expert Systems with Applications, vol. 37, no. 1, pp. 678–687, 2010. View at Publisher · View at Google Scholar · View at Scopus
  9. D. Lei, “Co-evolutionary genetic algorithm for fuzzy flexible job shop scheduling,” Applied Soft Computing Journal, vol. 12, no. 8, pp. 2237–2245, 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. D. Lei and X. Guo, “Swarm-based neighbourhood search algorithm for fuzzy flexible job shop scheduling,” International Journal of Production Research, vol. 50, no. 6, pp. 1639–1649, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. L. Wang and C. Fang, “An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem,” Computers and Operations Research, vol. 39, no. 2, pp. 449–460, 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. L. Wang, S. Wang, Y. Xu, G. Zhou, and M. Liu, “A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem,” Computers & Industrial Engineering, vol. 62, no. 4, pp. 917–926, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. Y. Yuan and H. Xu, “Flexible job shop scheduling using hybrid differential evolution algorithms,” Computers & Industrial Engineering, vol. 65, no. 2, pp. 246–260, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. I. Kacem, S. Hammadi, and P. Borne, “Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems,” IEEE Transactions on Systems, Man and Cybernetics Part C: Applications and Reviews, vol. 32, no. 1, pp. 1–13, 2002. View at Publisher · View at Google Scholar · View at Scopus
  15. I. Kacem, S. Hammadi, and P. Borne, “Pareto-optimality approach based on uniform design and fuzzy evolutionary algorithms for flexible job-shop scheduling problems (FJSPs),” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 7, pp. 1–7, IEEE, Hammamet, Tunisia, October 2002. View at Publisher · View at Google Scholar
  16. N. B. Ho, J. C. Tay, and E. M.-K. Lai, “An effective architecture for learning and evolving flexible job-shop schedules,” European Journal of Operational Research, vol. 179, no. 2, pp. 316–333, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  17. J. Gao, M. Gen, L. Sun, and X. Zhao, “A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems,” Computers & Industrial Engineering, vol. 53, no. 1, pp. 149–162, 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. J. Gao, L. Sun, and M. Gen, “A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems,” Computers & Operations Research, vol. 35, no. 9, pp. 2892–2907, 2008. View at Publisher · View at Google Scholar · View at Scopus
  19. G. Zhang, X. Shao, P. Li, and L. Gao, “An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem,” Computers & Industrial Engineering, vol. 56, no. 4, pp. 1309–1318, 2009. View at Publisher · View at Google Scholar · View at Scopus
  20. J.-Q. Li, Q.-K. Pan, and Y.-C. Liang, “An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems,” Computers & Industrial Engineering, vol. 59, no. 4, pp. 647–662, 2010. View at Publisher · View at Google Scholar · View at Scopus
  21. L. Wang, S. Y. Wang, and M. Liu, “A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem,” International Journal of Production Research, vol. 51, no. 12, pp. 3574–3592, 2013. View at Publisher · View at Google Scholar · View at Scopus
  22. D. Simon, “Biogeography-based optimization,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 6, pp. 702–713, 2008. View at Publisher · View at Google Scholar · View at Scopus
  23. H. Kundra and M. Sood, “Cross-country path finding using hybrid approach of PSO and BBO,” International Journal of Computer Applications, vol. 7, no. 6, pp. 15–19, 2010. View at Publisher · View at Google Scholar
  24. K. Jamuna and K. S. Swarup, “Multi-objective biogeography based optimization for optimal PMU placement,” Applied Soft Computing, vol. 12, no. 5, pp. 1503–1510, 2012. View at Publisher · View at Google Scholar · View at Scopus
  25. S. Singh, E. Mittal, and G. Sachdeva, “Multi-objective gain-impedance optimization of Yagi-Uda antenna using NSBBO and NSPSO,” International Journal of Computer Applications, vol. 56, no. 15, pp. 1–6, 2012. View at Google Scholar
  26. R. MacArthur and E. Wilson, The Theory of Biogeography, Princeton University Press, Princeton, NJ, USA, 1967.
  27. R. Nakano and T. Yamada, “Conventional genetic algorithm for job shop problems,” in Proceedings of the 4th International Conference on Genetic Algorithms (ICGA '91), pp. 474–479, San Diego, Calif, USA, July 1991.
  28. H. P. Ma, X. Li, and S. D. Lin, “Analysis of migratorate models for biogeography-based optimization,” Journal of Southeast University (Natural Science Edition), vol. 39, supplement, pp. 16–21, 2009 (Chinese). View at Google Scholar
  29. C. Y. Zhang, Y. Q. Rao, P. G. Li, and X. Shao, “Bilevel genetic algorithm for the flexible job-shop scheduling problem,” Chinese Journal of Mechanical Engineering, vol. 43, no. 4, pp. 119–124, 2007 (Chinese). View at Publisher · View at Google Scholar · View at Scopus
  30. I. Kacem, S. Hammadi, and P. Borne, “Pareto-optimality approach based on uniform design and fuzzy evolutionary algorithms for flexible job-shop scheduling problems (FJSPs),” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 7, pp. 1–7, Yasmine Hammamet, Tunisia, October 2002. View at Publisher · View at Google Scholar
  31. S. H. A. Rahmati and M. Zandieh, “A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem,” International Journal of Advanced Manufacturing Technology, vol. 58, no. 9–12, pp. 1115–1129, 2012. View at Publisher · View at Google Scholar · View at Scopus
  32. S. Habib, A. Rahmati, and M. Zandieh, “A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem,” International Journal of Advanced Manufacturing Technology, vol. 58, no. 9-12, pp. 1115–1129, 2012. View at Publisher · View at Google Scholar · View at Scopus