Buffer location and sizing to optimize cost and quality in semi-continuous manufacturing processes: Methodology and application

Kumar Rajaram and Zhili Tian

IISE Transactions, 2009, vol. 41, issue 12, 1035-1048

Abstract: The problem of optimizing the location and size of buffers in semi-continuous manufacturing processes is considered. This problem is formulated as a non-linear integer program that determines the optimal buffer size for individual stages and allocates tanks to those stages in order to minimize total tank inclusion, holding, quality, process overshoot and undershoot costs. Heuristics are developed to solve the problem and bounds are derived to evaluate the quality of the heuristics. This method has been implemented at three glucose and three sorbitol production processes at a leading food processing company. This has resulted in total annual cost savings of around 6.4% or $9000 000. In addition, this work has had a significant impact on several strategic operational decisions at this company.[Supplementary materials are available for this article. Go to the publisher's online edition of IIE Transactions for the following free supplemental resource: Appendix]

Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1080/07408170902889694 (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:taf:uiiexx:v:41:y:2009:i:12:p:1035-1048

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/07408170902889694

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().