Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 612604, 10 pages
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.


The flow shop scheduling problems with mixed blocking constraints with minimization of makespan are investigated. The Taguchi orthogonal arrays and path relinking along with some efficient local search methods are used to develop a metaheuristic algorithm based on bee colony optimization. In order to compare the performance of the proposed algorithm, two well-known test problems are considered. Computational results show that the presented algorithm has comparative performance with well-known algorithms of the literature, especially for the large sized problems.