An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
From MaRDI portal
Publication:2783984
DOI10.1287/mnsc.44.6.831zbMath0989.90051OpenAlexW2112368241MaRDI QIDQ2783984
Albert P. M. Wagelmans, Dong X. Shaw
Publication date: 17 April 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://repub.eur.nl/pub/1353
Production models (90B30) Dynamic programming (90C39) Complexity and performance of numerical algorithms (65Y20)
Related Items (30)
Optimising lot sizing and order scheduling with non-linear production rates ⋮ Inventory lot-sizing with supplier selection ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Capacitated lot size problems with fuzzy capacity ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Lot Sizing with Piecewise Concave Production Costs ⋮ Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time ⋮ Combined replenishment and warehousing with contract commitments and flexibilities ⋮ Planning for demand failure: a dynamic lot size model for clinical trial supply chains ⋮ Dynamic programming and heuristic for stochastic uncapacitated lot-sizing problems with incremental quantity discount ⋮ Modeling industrial lot sizing problems: a review ⋮ Economic lot sizing: the capacity reservation model ⋮ A graphical approach to solve an investment optimization problem ⋮ An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost ⋮ A new effective dynamic program for an investment optimization problem ⋮ Improved algorithms for dynamic lot sizing problems with incremental discount ⋮ Production lot-sizing with dynamic capacity adjustment ⋮ Improved exact algorithms to economic lot-sizing with piecewise linear production costs ⋮ NP-hard and polynomial cases for the single-item lot sizing problem with batch ordering under capacity reservation contract ⋮ An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem ⋮ A polynomial time algorithm for convex cost lot-sizing problems ⋮ Lot sizing with bounded inventory and lost sales ⋮ Polynomial cases of the economic lot sizing problem with cost discounts ⋮ Impact of Heat Storage Capacity on CHP Unit Commitment Under Power Price Uncertainties ⋮ Grouping in decomposition method for multi-item capacitated lot-sizing problem with immediate lost sales and joint and item-dependent setup cost ⋮ Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs ⋮ Single item lot sizing problems ⋮ A two-echelon inventory optimization model with demand time window considerations ⋮ A Lagrangian heuristic for capacitated single item lot sizing problems ⋮ The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases
This page was built for publication: An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs
