Aarhus University Seal

Hongyan Jenny Li

Capacitated Dynamic Lot Sizing with Capacity Acquisition

Research output: Working paper/Preprint Working paperResearch


  • L 2009 03

    Final published version, 298 KB, PDF document

  • Hongyan Li
  • Joern Meissner, Lancaster University, United Kingdom
  • CORAL - Centre for Operations Research Applications in Logistics
  • Department of Business Studies
One of the fundamental problems in operations management is to determine the optimal investment in capacity. Capacity investment consumes resources and the decision is often irreversible. Moreover, the available capacity level affects the action space for production and inventory planning decisions directly. In this paper, we address the joint capacitated lot sizing and capacity acquisition problem. The firm can produce goods in each of the finite periods into which the production season is partitioned. Fixed as well as variable production costs are incurred for each production batch, along with inventory carrying costs. The production per period limited by a capacity restriction. The underlying capacity must be purchased up front for the upcoming season and remains constant over the entire season. We assume that the capacity acquisition cost is smooth and convex. For this situation, we develop a model which combines the complexity of time-varying demand and cost functions and that of scale economies arising from dynamic lot-sizing costs with the purchase cost of capacity. We propose a heuristic algorithm that runs in polynomial time to determine a good capacity level and corresponding lot sizing plan simultaneously. Numerical experiements show that our method is a good trade-off between solution quality and running time.
Original languageEnglish
Place of publicationAarhus
PublisherAarhus School of Business, Aarhus University, Department of Business Studies
Number of pages31
ISBN (Electronic)9788778824356
Publication statusPublished - 2009

    Research areas

  • supply chain management, lot sizing, approximation, heuristics

See relations at Aarhus University Citationformats

Download statistics

No data available

ID: 225301