Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem

DOI10.1287/opre.1120.1141zbMath1267.90045OpenAlexW2054728762MaRDI QIDQ5301140

Hark-Chin Hwang, Hyun-Soo Ahn, Philip M. Kaminsky

Publication date: 2 July 2013

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/309aee6d8dc086c33599a46309168b4ea09f2d4c

zbMATH Keywords

algorithmslot-sizinginventory and logisticsproduction capacity

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Production models (90B30) Inventory, storage, reservoirs (90B05)

Related Items (8)

Algorithms for the two-stage production-capacitated lot-sizing problem ⋮ Optimal production-inventory policy for an integrated multi-stage supply chain with time-varying demand ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ Multi-echelon supply chains with lead times and uncertain demands. A lot-sizing formulation and solutions ⋮ An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels ⋮ On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid

This page was built for publication: Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem