SOLVING FLOWSHOP SCHEDULING PROBLEMS USING A DISCRETE AFRICAN WILD DOG ALGORITHM

ICTACT Journal on Soft Computing ( Volume: 3 , Issue: 3 )

Abstract

vioft2nntf2t|tblJournal|Abstract_paper|0xf4ffb0710f0000006f3b020001000700
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.

Authors

M. K. Marichelvam, M. Geetha
Kamaraj College of Engineering and Technology, India

Keywords

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
Pages
555-558

ICT Academy is an initiative of the Government of India in collaboration with the state Governments and Industries. ICT Academy is a not-for-profit society, the first of its kind pioneer venture under the Public-Private-Partnership (PPP) model

Contact Us

ICT Academy
Module No E6 -03, 6th floor Block - E
IIT Madras Research Park
Kanagam Road, Taramani,
Chennai 600 113,
Tamil Nadu, India

For Journal Subscription: journalsales@ictacademy.in

For further Queries and Assistance, write to us at: ictacademy.journal@ictacademy.in