Aarhus University Seal

Hongyan Jenny Li

Capacitated dynamic lot sizing with capacity acquisition

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Hongyan Li
  • Joern Meissner, Lancaster University, United Kingdom
One of the fundamental problems in operations management is determining the optimal investment in capacity. Capacity investment consumes resources and the decision, once made, is often irreversible. Moreover, the available capacity level affects the action space for production and inventory planning decisions directly. In this article, we address the joint capacitated lot-sizing and capacity-acquisition problems. 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 is 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 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 experiments show that our method is a good trade-off between solution quality and running time.
Original languageEnglish
JournalInternational Journal of Production Research
Pages (from-to)4945-4963
Number of pages19
Publication statusPublished - 2011

    Research areas

  • supply chain management, lot sizing, capacity, approximation, heuristics

See relations at Aarhus University Citationformats

ID: 241724