Lot-Sizing with Start-Up Times

References

• Aggarwal A., Park J. K. Improved algorithms for economic lot size problems. Oper. Res. (1993) 41:549–571Link, Google Scholar
• Barany I., Van Roy T., Wolsey L. A. Strong formulations for multi-item capacitated lot-sizing. Management Sci. (1984) 30:1255–1261Link, Google Scholar
• Bitran G. R., Yanasse H. H. Computational complexity of the capacitated lot size problem. Management Sci. (1982) 28(10):1174–1186Link, Google Scholar
• Cattryse D., Salomon M., Kuik R., Van Wassenhove L. N. A dual ascent and column generation heuristic for the discrete lotsizing and scheduling problem with set-up times. Management Sci. (1993) 39(4):477–486Link, Google Scholar
• Constantino M. F. A polyhedral approach to production planning models: Start-up costs and times upper and lower bounds on production. (1995) . Ph.D. thesis, Département de Mathé-matique, Université Catholique de Louvain, Louvain-la-Neuve, BelgiumGoogle Scholar
• Constantino M. F. A polyhedral approach to a production planning problem. (1996) . Research paper Departamento de Estatistica e Investigacao Operacional, Universidade de Lisboa, PortugalGoogle Scholar
• CPLEX Using the CPLEX linear optimizer. (1994) . Version 3.0, CPLEX Optimization, Inc., Suite 279, 930 Tahoe Blvd., Bldg. 802, Incline Village, NV 89451-9436. (702) 831-7744Google Scholar
• du Merle O., Goffin J.-L., Trouiller C., Vial J.-P. A Lagrangian relaxation of the capacitated multi-item lot sizing problem solved with an interior point cutting plane algorithm. (1997) . Les Cahiers du GERADGoogle Scholar
• Federgruen A., Tzur M. A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(n log n) or O(n) time. Management Sci. (1991) 37(8):909–925Link, Google Scholar
• Fleischmann B. The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. (1990) 44:337–348Crossref, Google Scholar
• Florian M., Lenstra J. K., Rinnooy Kan A. H. G. Deterministic production planning: Algorithms and complexity. Management Sci. (1980) 26(7):669–679Link, Google Scholar
• Florian M., Klein M. Deterministic production planning with concave costs and capacity constraints. Management Sci. (1971) 18(1):12–20Link, Google Scholar
• Leung Magnanti, Vachani. Facet and algorithms for capacitated lot sizing. Math. Programming (1989) 45:331–359Crossref, Google Scholar
• Magnanti T. L., Vachani R. A strong cutting plane algorithm for production scheduling with changeover costs. Oper. Res. (1990) 38(3):456–473Link, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley & Sons, Inc., New York) Crossref, Google Scholar
• Pochet Y., Wolsey L. A. Lot-sizing with constant batches: Formulation and valid inequalities. Math. Oper. Res. (1993) 18(4):767–785Link, Google Scholar
• Pochet Y., Wolsey L. A. Algorithms and reformulations for lot sizing problems. DIMACS Ser. in Discrete Math. and Theoret. Comput. Sci. (1995) 20Crossref, Google Scholar
• Salomon M., Kroon L. G., Kuik R., Van Wassenhove L. N. Some extensions of the discrete lot-sizing and scheduling problem. Management Sci. (1991) 37(7):801–812Link, Google Scholar
• Trigeiro W. W., Thomas L. J., McClain J. O. Capacitated lot sizing with set-up times. Management Sci. (1989) 35(3):353–366Link, Google Scholar
• van Hoesel S., Kolen A. A linear description of the discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. (1994) 75:342–353Crossref, Google Scholar
• van Hoesel C. P. M., Wagelmans A. P. M. An O(T3) algorithm for the economic lot-sizing problem with constant capacities. Management Sci. (1996) 42(1):142–150Link, Google Scholar
• Vanderbeck F. Decomposition and column generation for integer programs. (1994) . Ph.D. thesis Faculté des Sciences Appliqées, Université Catholique de Louvain, Louvain-la-Neuve, BelgiumGoogle Scholar
• Vanderbeck F. On integer programming decomposition and ways to enforce integrality in the master. Research Papers in Management Studies (1995) . University of Cambridge 1994–1995, no. 29 (revised in May 1996). To appear in Oper. Res.Google Scholar
• Vanderbeck F. Computational study of a column generation algorithm for bin packing and cutting stock problems. Research Papers in Management Studies (1996) (University of Cambridge). no. 14Google Scholar
• Vanderbeck F., Wolsey L. A. An exact algorithm for IP column generation. Oper. Res. Lett. (1996) 19(4):151–159Crossref, Google Scholar
• van Eijl Cleola. A polyhedral approach to the discrete lot-sizing and scheduling problem. (1996) . Ph.D. thesis, Technische Universiteit Eindhoven, NetherlandsGoogle Scholar
• Wagelmans A., van Hoesel S., Kolen A. Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Oper. Res. (1996) 40:S145–S156Link, Google Scholar
• Wolsey L. A. MIP modelling of changeovers in production planning and scheduling problems. Eur. J. Oper. Res. (1997) . To appear in theGoogle Scholar