A comparison of metaheuristic procedures to schedule jobs in a permutation flow shop to minimise total earliness and tardiness

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

Autores

Jeffrey Schaller (Autor) Outra; Jorge M S Valente (Autor) FEP

Revista

Título: International Journal of Production Research

Vol. 51 Nº 3

Páginas: 772-779

ISSN: 0020-7543

Editora: Taylor & Francis

Indexação

ISI Web of Knowledge - 33 Citações

Scopus - 38 Citações

Classificação Científica

FOS: Ciências da engenharia e tecnologias > Engenharia civil

Outras Informações

ID Authenticus: P-002-0R4

DOI: 10.1080/00207543.2012.663945

Abstract (EN): This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimising total earliness and tardiness. A genetic algorithm is proposed for the problem. This procedure and five other procedures were tested on problem sets that varied in terms of number of jobs, machines and the tightness and range of due dates. It was found that the genetic algorithm procedure was consistently effective in generating good solutions relative to the other procedures.

Idioma: Inglês

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

Nº de páginas: 8