A BAT ALGORITHM FOR REALISTIC HYBRID FLOWSHOP SCHEDULING PROBLEMS TO MINIMIZE MAKESPAN AND MEAN FLOW TIME

Abstract
This paper addresses the multistage hybrid flow shop (HFS) scheduling problems. The HFS is the special case of flowshop problem. Multiple parallel machines are considered in each stage in the HFS. The HFS scheduling problem is known to be strongly NP-hard. Hence, many researchers proposed metaheuristic algorithms for solving the HFS scheduling problems. This paper develops a bat algorithm (BA) to the HFS scheduling problem to minimize makespan and mean flow time. To verify the developed algorithm, computational experiments are conducted and the results are compared with other metaheuristic algorithms from the literature. The computational results show that the proposed BA is an efficient approach in solving the HFS scheduling problems.

Authors
M. K. Marichelvam1 and T. Prabaharan2
1Kamaraj College of Engineering and Technology, India,2Mepco Schlenk Engineering College, India

Keywords
Scheduling, Hybrid Flowshop, NP-Hard, Bat Algorithm, Makespan, Mean Flow Time
Published By :
ICTACT
Published In :
ICTACT Journal on Soft Computing
( Volume: 3 , Issue: 1 )
Date of Publication :
October 2012

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.