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: |
Web page: http://www.informs.org/Email:
More information through EDIRC
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 references are entirely missing, you can add them using this form.