The capacitated lot-sizing problem with linked lot sizes

Management Science

Volumn 49, Issue 8, 2003, Pages 1039-1054

  Suerie, Christopher ^a   Stadtler, Hartmut ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

CLSPL; Lot sizing; MIP; Valid inequalities

Indexed keywords

DECISION MAKING; HEURISTIC METHODS; INTEGER PROGRAMMING; INVENTORY CONTROL; MANAGEMENT SCIENCE; MATHEMATICAL MODELS; SCHEDULING; STRATEGIC PLANNING;

CAPACITATED LOT-SIZING PROBLEM WITH LINKED LOT SIZES; MIXED INTEGER PROGRAMMING; VALID INEQUALITIES;

PRODUCTION;

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

References (27)

1. Dash Associates. 2000. XPRESS-MP. Release 12 Supplement. Blisworth, Northants, U.K.
2. Dillenberger, C., L. F. Escudero, A. Wollensak, W. Zhang. 1993. On solving a large-scale resource allocation problem in production planning. G. Fandel, T. Gulledge, A. Jones, eds. Operations Research in Production Planning and Control. Springer, Berlin, Germany, 105-119.
3. Drexl, A., K. Haase. 1995. Proportional lotsizing and scheduling. Internat. J. Production Econom. 40 73-87.
4. Eppen, G. D., R. K. Martin. 1987. Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper. Res. 35 832-848.
5. Fisher, M., K. Ramdas, Y.-S. Zheng. 2001. Ending inventory valuation in multiperiod production scheduling. Management Sci. 47 679-692.
6. Fleischmann, B. 1990. The discrete lot-sizing and scheduling problem. Eur. J. Oper. Res. 44 337-348.
7. Gopalakrishnan, M. 2000. A modified framework for modelling set-up carryover in the capacitated lotsizing problem. Internat. J. Production Res. 38 3421-3424.
8. ____, D. M. Miller, C. P. Schmidt. 1995. A framework for modelling setup carryover in the capacitated lotsizing problem. Internat. J. Production Res. 33 1973-1988.
9. ____, K. Ding, J.-M. Bourjolly, S. Mohan. 2001. A tabu-search heuristic for the capacitated lot-sizing problem with set-up carryover. Management Sci. 47 851-863.
10. Haase, K. 1994. Lotsizing and Scheduling for Production Planning. Springer, Berlin, Germany.
11. ____. 1998. Capacitated lot-sizing with linked production quantities of adjacent periods. A. Drexl, A. Kimms., eds. Beyond Manufacturing Resource Planning (MRP II). Advanced Models and Methods for Production Planning. Springer, Berlin, Germany, 127-146.
12. Karmarkar, U., L. Schrage. 1985. The deterministic dynamic product cycling problem. Oper. Res. 33 326-345.
13. Maes, J., J. O. McClain, L. N. Van Wasenhove. 1991. Multilevel capacitated lotsizing complexity and LP-based heuristics. Eur. J. Oper. Res. 53 131-148.
14. Miller, A. J., G. L. Nemhauser, M. W. P. Savelsbergh. 2000. Solving multi-item capacitated lot-sizing problems with setup times by branch-and-cut. CORE discussion paper, No. 00/39, Louvain-la-Neuve, Belgium.
15. Pochet, Y., L. A. Wolsey. 1995. Algorithms and reformulations for lot sizing problems. W. J. Cook, L. Lovász, P. Seymour eds. Combinatorial Optimization. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 20. American Mathematical Society, Providence, RI, 245-294.
16. Rosling, K. 1986. Optimal lot-sizing for dynamic assembly systems. S. Axsäter, C. Schneeweiß, E. Silver, eds. Multi-Stage Production Planning and Inventory Control. Springer, Berlin, Germany, 119-131.
17. Salomon, M. 1991. Deterministic Lotsizing Models for Production Planning. Springer, Berlin, Germany.
18. Sox, C. R., Y. Gao. 1999. The capacitated lot sizing problem with setup carry-over. IIE Trans. 31 173-181.
19. Stadtler, H. 1996. Mixed integer model formulations for dynamic multi-item multi-level capacitated lotsizing. Eur. J. Oper. Res. 94 561-581.
20. ____. 2000. Improved rolling schedules for the dynamic single-level lot-sizing problem. Management Sci. 46 318-326.
21. ____. 2003. Multi-level lot-sizing with setup times and multiple constrained resources: Internally rolling schedules with lot-sizing windows. Oper. Res. 51 487-502.
22. Tempelmeier, H., M. Derstroff. 1996. A Lagrangean-based heuristic for dynamic multilevel multiitem constrained lotsizing with setup times. Management Sci. 42 738-757.
23. Thizy, J. M, L. N. Van Wassenhove. 1985. Lagrangean relaxation for the multi-item capacitated lot-sizing problem: A heuristic implementation. IIE Trans. 17 308-313.
24. Trigeiro, W. W., L. J. Thomas, J. O. McClain. 1989. Capacitated lot-sizing with setup times. Management Sci. 35 353-366.
25. Van Hoesel, C. P. M., A. P. M. Wagelmans, L. A. Wolsey. 1994. Polyhedral characterization of the economic lot-sizing problem with start-up costs. Siam J. Discrete Math. 7 141-151.
26. Wolsey, L. A. 1989. Uncapacitated lot-sizing problems with start-up costs. Oper. Res. 37 741-747.
27. ____. 1998. Integer Programming. Wiley, New York.