Using a hybrid Evolutionary-Taboo Algorithm to solve Job Shop Problem

Authors:
J. P. Caldeira;F. Melicio;A. Rosa
Affiliations:
Instituto Politécnico de Setúbal - Escola Superior de Tecnologia, R. Vale de Chaves-Estefanilha, Setúbal Portugal;I.S.E.L., R. Conselheiro Emidio Navarro, Lisboa, Portugal;LaSEEB-ISR-ISTA, Lisboa Codex, Portugal
Venue:
Proceedings of the 2004 ACM symposium on Applied computing
Year:
2004

Citing 4
Cited 0

A user's guide to tabu search

Annals of Operations Research - Special issue on Tabu search
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)

Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
A fast taboo search algorithm for the job shop problem

Management Science
Production scheduling and rescheduling with genetic algorithms

Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new hybrid algorithm to solve the Job Shop Problem. Our algorithm, called Evoluntionary-Taboo uses an Evolutionary Algorithm (EA) to enhance results obtained by one of the best Taboo algorithms for this problem. We tested the algorithm on the benchmark problems for which the taboo algorithm returned its worst results. On average, we improved taboo results by 2.9%. The results were under one percent from the best known results for these problems.