Heuristics for scheduling jobs in a permutation flow shop to minimize total earliness and tardiness with unforced idle time allowed

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

Autores

Schaller, J (Autor) Outra; Jorge M S Valente (Autor) FEP

Revista

Título: Expert Systems with Applications

Vol. 119

Páginas: 376-386

ISSN: 0957-4174

Editora: Elsevier

Indexação

ISI Web of Knowledge - 23 Citações

Scopus - 28 Citações

Outras Informações

ID Authenticus: P-00P-W46

DOI: 10.1016/j.eswa.2018.11.007

Abstract (EN): This paper considers the problem of scheduling jobs in a permutation flow shop with the objective of minimizing total earliness and tardiness. Unforced idle time is considered in order to reduce the earliness of jobs. It is shown how unforced idle time can be inserted on the final machine. Several dispatching heuristics that have been used for the problem without unforced idle time were modified and tested. Several procedures were also developed that conduct a second pass to develop a sequence using dispatching rules. These procedures were also tested and were found to result in better solutions.

Idioma: Inglês

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

Nº de páginas: 11