Tight MIP formulations for multi-item discrete lot-sizing problems

Operations Research

Volumn 51, Issue 4, 2003, Pages 557-565

  Miller, Andrew J ^a   Wolsey, Laurence A ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Integer programming: convex integer programming, facets, extended formulations; Inventory production: scale diseconomies lot sizing, discrete lot sizing; Production scheduling: planning

Indexed keywords

BACKLOGGING; CONVEX INTEGER PROGRAMMING; DISCRETE LOT-SIZING; EXTENDED FORMULATIONS; FACETS; INVENTORY; SCALE-DISECONOMIES;

FUNCTIONS; INVENTORY CONTROL; LINEAR PROGRAMMING; MATHEMATICAL MODELS; MATRIX ALGEBRA; PLANNING; PROBLEM SOLVING; PRODUCTION; SET THEORY; THEOREM PROVING;

INTEGER PROGRAMMING;

EID: 4344582377     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.51.4.557.16094     Document Type: Article

References (13)

1. Ahuja, R. K., T. L. Magnanti, J. B. Orlin. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Engle-wood Cliffs, NJ.
2. Dash Associates. 2000. XPRESS-MP Reference Manual. Release 12. Leamington Spa, U.K.
3. Fleischmann, B. 1990. The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 44 337-348.
4. _. 1994. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs. Eur. J. Oper. Res. 75 395-404.
5. Gomory, R. E. 1958. Outline of an algorithm for integer solutions to linear programs. Bull. Amer. Math. Soc. 64 275-278.
6. Günlük, O., Y. Pochet. 2001. Mixing MIR inequalities for mixed integer programs. Math. Programming 90 429-458.
7. Hochbaum, D. S., J. G. Shantikumar. 1990. Convex separable optimization is not much harder than linear optimization, J. ACM 37 843-862.
8. Miller, A. J., L. A. Wolsey. 2002. Tight formulations for some simple mixed integer programs and convex objective integer programs. Revised for Math. Progamming. CORE, Louvain-la-Neuve, Belgium.
9. Pochet, Y., L. A. Wolsey. 1994. Polyhedra for lot-sizing with Wagner-Whitin costs. Math. Programming 67 297-323.
10. Tardif, V., M. L. Spearman. 1997. Diagnostic scheduling in finite-capacity production environments. Comput. Indust. Engrg. 32 867-878.
11. Van Eijl, C. A. 1996. A polyhedral approach to the discrete lotsizing and scheduling problem. Ph.D. thesis, Technische Universiteit Eindhoven, Eindhoven, The Netherlands.
12. _, C. P. M. van Hoesel. 1997. On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. OR Lett. 20 7-13.
13. Van Hoesel, C. P. M., R. Kuik, M. Salomon, L. N. van Wassenhove. 1994. The single item discrete lot-sizing and scheduling problem: Optimization by linear and dynamic programming. Discrete Appl. Math. 48 289-303.