Lot-sizing with start-up times

Management Science

Volumn 44, Issue 10, 1998, Pages 1409-1425

  Vanderbeck, François ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; DYNAMIC PROGRAMMING; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING;

MULTIITEM POLYHEDRA; PRODUCTION CAPACITY;

OPERATIONS RESEARCH;

EID: 0032179462     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.44.10.1409     Document Type: Article

References (28)

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