The problem of m-machine permutation flowshop scheduling is considered in this paper. The objective is to minimize the makespan. The flowshop scheduling problem is a typical combinatorial optimization problem and has been proved to be strongly NP-hard. Hence, several heuristics and meta-heuristics were addressed by the researchers. In this paper, a discrete African wild dog algorithm is applied for solving the flowshop scheduling problems. Computational results using benchmark problems show that the proposed algorithm outperforms many other algorithms addressed in the literature.
M. K. Marichelvam, M. Geetha
Kamaraj College of Engineering and Technology, India
Scheduling, Flowshop, NP-Hard, Discrete African Wild Dog Algorithm, Makespan | Published By :
ICTACT
Published In :
ICTACT Journal on Soft Computing
( Volume: 3 , Issue: 3 )
Date of Publication :
April 2013
|