A network flow model for the capacitated lot-sizing problem
The lot-sizing problem considered in this paper consists in planning the production of multiple items on a single machine over a finite planning horizon divided into time periods. The objective of the problem is to determine a minimum cost production plan that meets the forecast demand for the items. The mathematical model considers setup time and setup cost, and is represented as a minimum cost network flow problem. A branch-and-bound method is proposed for solving the model. The performance of the method is evaluated by using numerical experiments for various demand patterns and values of cost parameters.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 27 (1999)
Issue (Month): 2 (April)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
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.:
- William W. Trigeiro & L. Joseph Thomas & John O. McClain, 1989. "Capacitated Lot Sizing with Setup Times," Management Science, INFORMS, vol. 35(3), pages 353-366, March.
- Moustapha Diaby & Harish C. Bahl & Mark H. Karwan & Stanley Zionts, 1992. "A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing," Management Science, INFORMS, vol. 38(9), pages 1329-1340, September.
- Marc Salomon & Leo G. Kroon & Roelof Kuik & Luk N. Van Wassenhove, 1991. "Some Extensions of the Discrete Lotsizing and Scheduling Problem," Management Science, INFORMS, vol. 37(7), pages 801-812, July.
- Maes, Johan & McClain, John O. & Van Wassenhove, Luk N., 1991. "Multilevel capacitated lotsizing complexity and LP-based heuristics," European Journal of Operational Research, Elsevier, vol. 53(2), pages 131-148, July.
- Salah E. Elmaghraby, 1978. "The Economic Lot Scheduling Problem (ELSP): Review and Extensions," Management Science, INFORMS, vol. 24(6), pages 587-598, February.
- Lozano, Sebastian & Larraneta, Juan & Onieva, Luis, 1991. "Primal-dual approach to the single level capacitated lot-sizing problem," European Journal of Operational Research, Elsevier, vol. 51(3), pages 354-366, April.
- Drexl, A. & Kimms, A., 1997. "Lot sizing and scheduling -- Survey and extensions," European Journal of Operational Research, Elsevier, vol. 99(2), pages 221-235, June.
- Diaby, M. & Bahl, H. C. & Karwan, M. H. & Zionts, S., 1992. "Capacitated lot-sizing and scheduling by Lagrangean relaxation," European Journal of Operational Research, Elsevier, vol. 59(3), pages 444-458, June.
- M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:27:y:1999:i:2:p:275-284. 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: (Dana Niculescu)
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.