SOLVING FLOWSHOP SCHEDULING PROBLEMS USING A DISCRETE AFRICAN WILD DOG ALGORITHM
Journal: ICTACT Journal on Soft Computing (IJSC) (Vol.3, No. 3)Publication Date: 2013-04-01
Authors : M. K. Marichelvam; M. Geetha;
Page : 555-558
Keywords : Scheduling; Flowshop; NP-Hard; Discrete African Wild Dog Algorithm; Makespan;
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.
Other Latest Articles
- CLINICAL DATABASE ANALYSIS USING DMDT BASED PREDICTIVE MODELLING
- AN EFFECTIVE RECOMMENDATIONS BY DIFFUSION ALGORITHM FOR WEB GRAPH MINING
- A GIS-BASED ENVIRONMENTAL HEALTH INFORMATION SOURCE FOR MALAYSIAN CONTEXT
- AN ENHANCED MODEL TO ESTIMATE EFFORT, PERFORMANCE AND COST OF THE SOFTWARE PROJECTS
- SENSITIVITY-BASED LINEAR LEARNING METHOD AND EXTREME LEARNING MACHINES COMPARED FOR SOFTWARE MAINTAINABILITY PREDICTION OF OBJECT-ORIENTED SOFTWARE SYSTEMS
Last modified: 2013-12-05 19:44:16