Algorithms for the two-stage production-capacitated lot-sizing problem
From MaRDI portal
Publication:312482
DOI10.1007/S10898-015-0392-2zbMATH Open1353.90119OpenAlexW2213850920MaRDI QIDQ312482FDOQ312482
Philip Kaminsky, Hyun-Soo Ahn, Hark-Chin Hwang
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
Recommendations
- An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels
- Uncapacitated two-level lot-sizing
- Algorithms for Capacitated, Multi-Item Lot-Sizing without Set-Ups
- Basis paths and a polynomial algorithm for the multistage production-capacitated lot-sizing problem
- An effective algorithm for the capacitated single item lot size problem
Nonconvex programming, global optimization (90C26) Inventory, storage, reservoirs (90B05) Transportation, logistics and supply chain management (90B06)
Cites Work
- A Polyhedral Study of Multiechelon Lot Sizing with Intermediate Demands
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Uncapacitated two-level lot-sizing
- Dynamic version of the economic lot size model
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Minimum concave cost flow over a grid network
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- Integrated Lot Sizing in Serial Supply Chains with Production Capacities
- Relaxations for two-level multi-item lot-sizing problems
- Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem
Cited In (3)
This page was built for publication: Algorithms for the two-stage production-capacitated lot-sizing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312482)
