Please use this identifier to cite or link to this item: http://repositorio.unicamp.br/jspui/handle/REPOSIP/52799
Type: Artigo de periódico
Title: Lower bounding schemes for flowshops with blocking in-process
Author: Ronconi, DP
Armentano, VA
Abstract: While there is a considerable amount of research that deals with a flowshop with no storage constraints, few works have addressed the flowshop with blocking in-process. Scheduling problems with blocking arise in serial manufacturing processes where no intermediate buffer storage is available. This paper proposes a lower bound, which exploits the occurrence of blocking, on the total tardiness of the jobs. Its efficiency is evaluated using a branch-and-bound algorithm on several problems. A lower bound on the makespan is also derived and computational tests are presented.
Subject: flowshop
blocking in-process
tardiness
lower bound
branch-and-bound
Country: Inglaterra
Editor: Palgrave Publishers Ltd
Rights: fechado
Identifier DOI: 10.1057/palgrave.jors.2601220
Date Issue: 2001
Appears in Collections:Artigos e Materiais de Revistas Científicas - Unicamp

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.