ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

SOLVING FLOWSHOP SCHEDULING PROBLEMS USING A DISCRETE AFRICAN WILD DOG ALGORITHM

Journal: ICTACT Journal on Soft Computing (IJSC) (Vol.3, No. 3)

Publication Date:

Authors : ; ;

Page : 555-558

Keywords : Scheduling; Flowshop; NP-Hard; Discrete African Wild Dog Algorithm; Makespan;

Source : Downloadexternal Find it from : Google Scholarexternal

Abstract

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.

Last modified: 2013-12-05 19:44:16