An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
Hybrid flow shop scheduling: a survey
Computers and Industrial Engineering
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
Expert Systems with Applications: An International Journal
A performance study of multiprocessor task scheduling algorithms
The Journal of Supercomputing
PSO with improved strategy and topology for job shop scheduling
ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II
Hybrid particle swarm optimization for flow shop scheduling with stochastic processing time
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Hi-index | 12.05 |
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.