Modelling Practical Lot-Sizing Problems as Mixed-Integer Programs
In spite of the remarkable improvements in the quality of general purpose mixed-integer programming software, the effective solution of a variety of lot-sizing problems depends crucially on the development of tight formulations for the special problem features occurring in practice. After reviewing some of the basic preprocessing techniques for handling safety stocks and multilevel problems, we discuss a variety of aspects arising particularly in small and large bucket (time period) models such as start-ups, changeovers, minimum batch sizes, choice of one or two set-ups per period, etc. A set of applications is described that contains one or more of these special features, and some indicative computational results are presented. Finally, to show another technique that is useful, a slightly different (supply chain) application is presented, for which the a priori addition of some simple mixed-integer inequalities, based on aggregation, leads to important improvements in the results.
Volume (Year): 47 (2001)
Issue (Month): 7 (July)
|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.:
- François Vanderbeck, 1998. "Lot-Sizing with Start-Up Times," Management Science, INFORMS, vol. 44(10), pages 1409-1425, October.
- Dirk Cattrysse & Marc Salomon & Roelof Kuik & Luk N. Van Wassenhove, 1993. "A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times," Management Science, INFORMS, vol. 39(4), pages 477-486, April.
- Horst Tempelmeier & Matthias Derstroff, 1996. "A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times," Management Science, INFORMS, vol. 42(5), pages 738-757, May.
- Andrew J. Clark & Herbert Scarf, 2004.
"Optimal Policies for a Multi-Echelon Inventory Problem,"
INFORMS, vol. 50(12_supple), pages 1782-1790, December.
- Andrew J. Clark & Herbert Scarf, 1960. "Optimal Policies for a Multi-Echelon Inventory Problem," Management Science, INFORMS, vol. 6(4), pages 475-490, July.
- 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.
- Fleischmann, Bernhard, 1994. "The discrete lot-sizing and scheduling problem with sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 75(2), pages 395-404, June.
- Cattrysse, Dirk & Maes, Johan & Van Wassenhove, Luk N., 1990. "Set partitioning and column generation heuristics for capacitated dynamic lotsizing," European Journal of Operational Research, Elsevier, vol. 46(1), pages 38-47, May.
- Yves Pochet & Laurence A. Wolsey, 1991. "Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes," Management Science, INFORMS, vol. 37(1), pages 53-67, January.
- Sungmin Kang & Kavindra Malik & L. Joseph Thomas, 1999. "Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs," Management Science, INFORMS, vol. 45(2), pages 273-289, February.
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:47:y:2001:i:7:p:993-1007. 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.