A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems

Article history: Received 23 January 2010 Received in revised form 23 April 2010 Accepted 26 April 2010 Available online 26 April 2010 During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer programming and it is classified as NP-Hard problem. Therefore, a direct solution is not available and metaheuristic approaches need to be used to find the near-optimal solutions. In this paper, we present a new discrete firefly meta-heuristic to minimize the makespan for the permutation flow shop scheduling problem. The results of implementation of the proposed method are compared with other existing ant colony optimization technique. The preliminary results indicate that the new proposed method performs better than the ant colony for some well known benchmark problems. © 2010 Growing Science Ltd. All rights reserved.