论文信息 - Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems

Tight Mip Formulation for Multi-Item Discrete Lot-Sizing Problems

This paper discusses mixed-integer programming formulations of variants of the discrete lot-sizing problem. Our approach is to identify simple mixed-integer sets within these models and to apply tight formulations for these sets. This allows us to define integral linear programming formulations for the discrete lot-sizing problem in which backlogging and/or safety stocks are present, and to give extended formulations for other cases. The results help significantly to solve test cases arising from an industrial application motivating this research.

Laurence A. Wolsey | Andrew J. Miller | L. Wolsey | Andrew J. Miller

[1] van Ca Cleola Eijl. A polyhedral approach to the discrete lot-sizing and scheduling problem , 1996 .

[2] B. Fleischmann. The discrete lot-sizing and scheduling problem , 1990 .

[3] Laurence A. Wolsey,et al. Tight formulations for some simple mixed integer programs and convex objective integer programs , 2003, Math. Program..

[4] Marc Salomon,et al. The Single-Item Discrete Lotsizing and Scheduling Problem: Optimization by Linear and Dynamic Programming , 1994, Discret. Appl. Math..

[5] Laurence A. Wolsey,et al. Polyhedra for lot-sizing with Wagner—Whitin costs , 1994, Math. Program..

[6] B. Fleischmann. The discrete lot-sizing and scheduling problem with sequence-dependent setup costs , 1994 .

[7] Stan P. M. van Hoesel,et al. On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs , 1997, Oper. Res. Lett..

[8] J. George Shanthikumar,et al. Convex separable optimization is not much harder than linear optimization , 1990, JACM.

[9] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[10] Valerie Tardif,et al. Diagnostic scheduling in finite-capacity production environments , 1997 .

[11] Oktay Günlük,et al. Mixing mixed-integer inequalities , 2001, Math. Program..