A BAT ALGORITHM FOR REALISTIC HYBRID FLOWSHOP SCHEDULING PROBLEMS TO MINIMIZE MAKESPAN AND MEAN FLOW TIME
Journal: ICTACT Journal on Soft Computing (IJSC) (Vol.3, No. 1)Publication Date: 2012-10-01
Authors : M. K. Marichelvam; T. Prabaharan;
Page : 428-433
Keywords : Scheduling; Hybrid Flowshop; NP-Hard; Bat Algorithm; Makespan; 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.
Other Latest Articles
- OPINION MINING AND SENTIMENT CLASSIFICATION: A SURVEY
- DERIVING USER ACCESS PATTERNS AND MINING WEB COMMUNITY WITH WEB-LOG DATA FOR PREDICTING USER SESSIONS WITH PAJEK
- STATE ADEQUACY EVALUATION USING GENERALIZED REGRESSION NEURAL NETWORK FOR NON-SEQUENTIAL MONTE CARLO SIMULATION BASED COMPOSITE POWER SYSTEM RELIABILITY ANALYSIS
- APPLICATION OF RESTART COVARIANCE MATRIX ADAPTATION EVOLUTION STRATEGY (RCMA-ES) TO GENERATION EXPANSION PLANNING PROBLEM
- BEHAVIOR BASED CREDIT CARD FRAUD DETECTION USING SUPPORT VECTOR MACHINES
Last modified: 2013-12-05 19:18:56