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

References

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