Setting Inventory Levels of CONWIP Flow Lines via Linear Programming
This paper treats the problem of setting the inventory level and optimizing the buffer allocation of closed-loop flow lines operating under the constant-work-in-process (CONWIP) protocol. We solve a very large but simple linear program that models an entire simulation run of a closed-loop flow line in discrete time to determine a production rate estimate of the system. This approach introduced in Helber, Schimmelpfeng, Stolletz, and Lagershausen (2011) for open flow lines with limited buffer capacities is extended to closed-loop CONWIP flow lines. Via this method, both the CONWIP level and the buffer allocation can be optimized simultaneously. The first part of a numerical study deals with the accuracy of the method. In the second part, we focus on the relationship between the CONWIP inventory level and the short-term profit. The accuracy of the method turns out to be best for such configurations that maximize production rate and/or short-term profit.
Volume (Year): 4 (2011)
Issue (Month): 1 (March)
|Contact details of provider:|| Web page: http://www.vhbonline.org|
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Helber, Stefan & Schimmelpfeng, Katja & Stolletz, Raik & Lagershausen, Svenja, 2008. "Using linear programming to analyze and optimize stochastic flow lines," Hannover Economic Papers (HEP) dp-389, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
When requesting a correction, please mention this item's handle: RePEc:vhb:journl:v:4:y:2011:i:1:p:98-115. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Tina Osteneck)
If references are entirely missing, you can add them using this form.