Lower bounding schemes for flowshops with blocking in-process

D P Ronconi () and V A Armentano
Additional contact information
D P Ronconi: Universidade de São Paulo
V A Armentano: Universidade Estadual de Campinas

Journal of the Operational Research Society, 2001, vol. 52, issue 11, 1289-1297

Abstract: 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.

Keywords: flowshop; blocking in-process; tardiness; lower bound; branch-and-bound (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601220 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:52:y:2001:i:11:d:10.1057_palgrave.jors.2601220

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601220

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().