A hybrid genetic algorithm for the early/tardy scheduling problem

• Tipo: Artigo em Revista Científica Internacional
• Data: 2006

Autores

Jorge M S Valente (Autor) FEP; Jose Fernando Goncalves (Autor) FEP; Rui A F S Alves (Autor) FEP

Revista

Título: Asia-Pacific Journal of Operational Research

Vol. 23 Nº 3

Páginas: 393-405

ISSN: 0217-5959

Editora: World Scientific

Indexação

ISI Web of Knowledge - 12 Citações

ISI Web of Science

Scopus - 18 Citações

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Biotecnologia industrial

CORDIS: Ciências Sociais > Economia > Estudos de gestão

Outras Informações

ID Authenticus: P-004-HC2

DOI: 10.1142/s0217595906000978

Abstract (EN): In this paper, we present a hybrid genetic algorithm for a version of the early/tardy scheduling problem in which no unforced idle time may be inserted in a sequence. The chromosome representation of the problem is based on random keys. The genetic algorithm is used to establish the order in which the jobs are initially scheduled, and a local search procedure is subsequently applied to detect possible improvements. The approach is tested on a set of randomly generated problems and compared with existing efficient heuristic procedures based on dispatch rules and local search. The computational results show that this new approach, although requiring slightly longer computational times, is better than the previous algorithms in terms of solution quality.

Idioma: Inglês

Tipo (Avaliação Docente): Científica

Nº de páginas: 13