Efficient Reformulations for Uncapacitated and Capacitated Lot-Sizing with Substitutions and Initial Inventories

Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 636)


This section considers extensions of two well-known single-level lot-sizing models, namely the Wagner–Whitin Problem (WWP) and the Capacitated Lot-Sizing Problem (CLSP), that incorporate product substitution options.

The literature published on lot-sizing models with substitution until now does not cover two aspects that are important in real-world production planning problems: Initial inventories are not taken into account. While these can be neglected easily without loss of generality in standard lot-sizing models by netting demands, this cannot be done if substitutions are possible, as the net demands depend on substitution decisions which are part of the optimization problem. E.g., consider a lot-sizing problem with two products A and B whose initial inventory is 60 and 20 units, respectively. In addition, assume that A can substitute B, and the gross demand for A and B in period 1 is 40 and 30, respectively. In this case one cannot say that the net demand of B in period 1 is 30 − 20 = 10, because it could be optimal due to the cost parameters and demand in subsequent periods to partially substitute B by A in period 1, so that B is not set up in period 1. In addition, no models and algorithms for lot-sizing with substitution and capacitated resources have been developed. If production bottlenecks exist, it is necessary to consider production capacities in combination with substitutions: Capacitated resources can on the one hand be the reason for substitutions, on the other hand limit the amount of substitutions (e.g., if a machine that could produce substitutes is working almost to full capacity).


Valid Inequality General Substitution Initial Inventory Substitution Instance Capacitate Facility Location Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Alfieri, A., Brandimarte, P., & D’Orazio, S. (2002). LP-based heuristics for the capacitated lot-sizing problem: The interaction of model formulation and solution algorithm. International Journal of Production Research, 40(2), 441–458.CrossRefGoogle Scholar
  2. Balakrishnan, A., & Geunes, J. (2000). Requirements planning with substitutions: Exploiting bill-of-materials flexibility in production planning. Manufacturing & Service Operations Management, 2(2), 166–185.CrossRefGoogle Scholar
  3. Bowman, E. (1956). Production scheduling by the transportation method of linear programming. Operations Research, 4(1), 100–103.CrossRefGoogle Scholar
  4. Geunes, J. (2003). Solving large-scale requirements planning problems with component substitution options. Computers & Industrial Engineering, 44(3), 475–491.CrossRefGoogle Scholar
  5. Hsu, V. N., Li, C. L., & Xiao, W. Q. (2005). Dynamic lot size problems with one-way product substitution. IIE Transactions, 37, 201–215.CrossRefGoogle Scholar
  6. Krarup, J., & Bilde, O. (1977). Plant location, set covering and economic lot size: An O(mn)-algorithm for structured problems. In L. Collatz, G. Meinardus, & W. Wetterling (Eds.), Numerische Methoden bei Optimierungsaufgaben, Band 3: Optimierung bei graphentheoretischen und ganzzahligen Problemen (pp. 155–180). Birkhäuser: Stuttgart.Google Scholar
  7. Lang, J. C., & Domschke, W. (2008). Efficient reformulations for dynamic lot-sizing problems with product substitution. OR Spectrum. doi:10.1007/s00291-008-0148-1.Google Scholar
  8. Maes, J., McClain, J., & Van Wassenhove, L. (1991). Multilevel capacitated lotsizing complexity and LP-based heuristics. European Journal of Operational Research, 53(2), 131–148.CrossRefGoogle Scholar
  9. Pochet, Y., & Wolsey, L. (2006). Production planning by mixed integer programming. Berlin: Springer.Google Scholar
  10. Sridharan, R. (1995). The capacitated plant location problem. European Journal of Operational Research, 87(2), 203–213.CrossRefGoogle Scholar
  11. Stadtler, H. (1996). Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing. European Journal of Operational Research, 94(3), 561–581.CrossRefGoogle Scholar
  12. Stadtler, H. (1997). Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing. OR Spectrum, 19(2), 87–96.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.Department of Law, Business and Economics Chair of Operations ResearchTechnische Universität DarmstadtDarmstadtGermany

Personalised recommendations