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

A Bee Colony Optimization Approach for Mixed Blocking Constraints Flow Shop Scheduling Problems

1Department of Mathematical Sciences, Shiraz University of Technology, Shiraz 71555-313, Iran
2Department of Industrial Engineering, Shiraz University of Technology, Shiraz 71555-313, Iran

Received 11 June 2015; Revised 21 September 2015; Accepted 20 October 2015

Academic Editor: Marco Mussetta

Copyright © 2015 Mostafa Khorramizadeh and Vahid Riahi. 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. J. N. D. Gupta and E. F. Stafford, “Flowshop scheduling research after five decades,” European Journal of Operational Research, vol. 169, no. 3, pp. 699–711, 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. L. Wang, Q.-K. Pan, P. N. Suganthan, W.-H. Wang, and Y.-M. Wang, “A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems,” Computers & Operations Research, vol. 37, no. 3, pp. 509–520, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  3. L. Wang, L. Zhang, and D.-Z. Zheng, “An effective hybrid genetic algorithm for flow shop scheduling with limited buffers,” Computers & Operations Research, vol. 33, no. 10, pp. 2960–2971, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. L. Wang, Q.-K. Pan, and M. F. Tasgetiren, “A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem,” Computers and Industrial Engineering, vol. 61, no. 1, pp. 76–83, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. I. Ribas, R. Companys, and X. Tort-Martorell, “An iterated greedy algorithm for the flowshop scheduling problem with blocking,” Omega, vol. 39, no. 3, pp. 293–301, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. S. Dauzere-Peres, C. Pavageau, and N. Sauer, “Modelisation et resolution par PLNE dun probleme reel dordonnancement avec contraintes de blocage,” in 3eme Congres ROADEF, Nantes, France, January 2000.
  7. S. Martinez, Ordonnancement de systems de production avec contraintes de blocage [Ph.D. thesis], University of Nantes, Nantes, France, 2005.
  8. G. I. Zobolas, C. D. Tarantilis, and G. Ioannou, “Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm,” Computers and Operations Research, vol. 36, no. 4, pp. 1249–1267, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. W. Trabelsi, C. Sauvey, and N. Saur, “Heuristic methods for problems with blocking constraints solving jobshop scheduling,” in Proceedings of the 8th International Conference on Modeling and Simulation (MOSIM '10), Hammamet, Tunisia, May 2010.
  10. W. Trabelsi, C. Sauvey, and N. Sauer, “Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems,” Computers and Operations Research, vol. 39, no. 11, pp. 2520–2527, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. S. Martinez, S. Dauzère-Pérès, C. Guéret, Y. Mati, and N. Sauer, “Complexity of flowshop scheduling problems with a new blocking constraint,” European Journal of Operational Research, vol. 169, no. 3, pp. 855–864, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. D. Karaboga and B. Basturk, “A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm,” Journal of Global Optimization, vol. 39, no. 3, pp. 459–471, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. M. Nawaz, E. E. Enscore Jr., and I. Ham, “A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem,” Omega, vol. 11, no. 1, pp. 91–95, 1983. View at Publisher · View at Google Scholar · View at Scopus
  14. B. Jarboui, M. Eddaly, and P. Siarry, “An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems,” Computers & Operations Research, vol. 36, no. 9, pp. 2638–2646, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. J.-T. Tsai, T.-K. Liu, and J.-H. Chou, “Hybrid Taguchi-genetic algorithm for global numerical optimization,” IEEE Transactions on Evolutionary Computation, vol. 8, no. 4, pp. 365–377, 2004. View at Publisher · View at Google Scholar · View at Scopus
  16. E. Taillard, “Benchmarks for basic scheduling problems,” European Journal of Operational Research, vol. 64, no. 2, pp. 278–285, 1993. View at Publisher · View at Google Scholar · View at Scopus
  17. Y.-Y. Han, Q.-K. Pan, J.-Q. Li, and H.-Y. Sang, “An improved artificial bee colony algorithm for the blocking flowshop scheduling problem,” International Journal of Advanced Manufacturing Technology, vol. 60, no. 9–12, pp. 1149–1159, 2012. View at Publisher · View at Google Scholar · View at Scopus