Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
From MaRDI portal
Publication:5388050
DOI10.1287/moor.1070.0257zbMath1341.90010OpenAlexW2150710113MaRDI QIDQ5388050
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.1070.0257
Related Items (16)
Subcontracting and lot-sizing with constant capacities ⋮ Single item lot-sizing with non-decreasing capacities ⋮ Discrete multi-module capacitated lot-sizing problems with multiple items ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Economic lot sizing problem with tank scheduling ⋮ Multiechelon Lot Sizing: New Complexities and Inequalities ⋮ A polynomial time algorithm to the economic lot sizing problem with constant capacity and piecewise linear concave costs ⋮ Capacitated lot sizing problems with inventory bounds ⋮ Improved algorithms for dynamic lot sizing problems with incremental discount ⋮ Production lot-sizing with dynamic capacity adjustment ⋮ NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract ⋮ An efficient algorithm for the 2-level capacitated lot-sizing problem with identical capacities at both levels ⋮ Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost ⋮ The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
This page was built for publication: Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size
