Allocating Fibers in Cable Manufacturing
We study the problem of allocating stocked fibers to made-to-order cables with the goals of satisfying due dates and reducing the costs of scrap, setup, and fiber circulation. These goals are achieved by generating remnant fibers either long enough to satisfy future orders or short enough to scrap with little waste. They are also achieved by manufacturing concatenations, in which multiple cable orders are satisfied by the production of a single cable that is afterwards cut into the constituent cables ordered. We use a function that values fibers according to length, and which can be viewed as an approximation to the optimal value function of an underlying dynamic programming problem. The daily policy that arises under this approximation is an integer program with a simple linear objective function that uses changes in fiber value to take into account the multi-period consequences of decisions. We describe our successful implementation of this integer program in the factory, summarizing our computational experience as well as realized operational improvements.
Volume (Year): 1 (1999)
Issue (Month): 1 ()
|Contact details of provider:|| Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA|
Web page: http://www.informs.org/
More information through EDIRC
References listed on IDEAS
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.:
- Gregory Dobson & Uday S. Karmarkar & Jeffrey L. Rummel, 1987. "Batching to Minimize Flow Times on One Machine," Management Science, INFORMS, vol. 33(6), pages 784-799, June.
- Richard Bellman, 1957. "On a Dynamic Programming Approach to the Caterer Problem--I," Management Science, INFORMS, vol. 3(3), pages 270-278, April.
- Hau L. Lee & Christopher S. Tang, 1997. "Modelling the Costs and Benefits of Delayed Product Differentiation," Management Science, INFORMS, vol. 43(1), pages 40-53, January.
When requesting a correction, please mention this item's handle: RePEc:inm:ormsom:v:1:y:1999:i:1:p:21-35. 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: (Mirko Janc)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.