Algorithms for the two-stage production-capacitated lot-sizing problem
From MaRDI portal
Publication:312482
DOI10.1007/s10898-015-0392-2zbMath1353.90119OpenAlexW2213850920MaRDI QIDQ312482
Hyun-Soo Ahn, Hark-Chin Hwang, Philip M. Kaminsky
Publication date: 15 September 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0392-2
Nonconvex programming, global optimization (90C26) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Cites Work
- Relaxations for two-level multi-item lot-sizing problems
- Uncapacitated two-level lot-sizing
- Minimum concave cost flow over a grid network
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- Dynamic Version of the Economic Lot Size Model
- Integrated Lot Sizing in Serial Supply Chains with Production Capacities
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
This page was built for publication: Algorithms for the two-stage production-capacitated lot-sizing problem