Minimizing total earliness and tardiness in a nowait flow shop

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

Autores

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

Revista

Título: International Journal of Production Economics

Vol. 224 Nº 107542

ISSN: 0925-5273

Editora: Elsevier

Indexação

ISI Web of Knowledge - 11 Citações

Scopus - 15 Citações

Outras Informações

ID Authenticus: P-00R-DME

DOI: 10.1016/j.ijpe.2019.107542

Abstract (EN): This paper considers the problem of scheduling jobs in a no-wait flow shop with the objective of minimizing total earliness and tardiness. An exact branch-and-bound algorithm is developed for the problem. Several dispatching heuristics used previously for other environments and two new heuristics were tested under a variety of conditions. It was found that one of the new heuristics consistently performed well compared to the others. An insertion search improvement procedure with speed up methods based on the structure of the problem was proposed and was found to deliver much improved solutions in a reasonable amount of time.

Idioma: Inglês

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

Nº de páginas: 11