Metaheuristic methods in hybrid flow shop scheduling problem


Choong, F. and Phon-Amnuaisuk, S. and Alias, M. Y. (2011) Metaheuristic methods in hybrid flow shop scheduling problem. Expert Systems with Applications, 38 (9). pp. 10787-10793. ISSN 0957-4174

[img] Text
1-s2.0-S0957417411002065-main.pdf - Published Version
Restricted to Repository staff only

Download (609kB)


Memetic algorithms are hybrid evolutionary algorithms that combine global and local search by using an evolutionary algorithm to perform exploration while the local search method performs exploitation. This paper presents two hybrid heuristic algorithms that combine particle swarm optimization (PSO) with simulated annealing (SA) and tabu search (TS), respectively. The hybrid algorithms were applied on the hybrid flow shop scheduling problem. Experimental results reveal that these memetic techniques can effectively produce improved solutions over conventional methods with faster convergence.

Item Type: Article
Subjects: T Technology > TA Engineering (General). Civil engineering (General)
Divisions: Faculty of Engineering (FOE)
Depositing User: Ms Suzilawati Abu Samah
Date Deposited: 20 Jan 2014 03:04
Last Modified: 20 Jan 2014 03:04


Downloads per month over past year

View ItemEdit (login required)