An Algorithm for the Dynamic Lot-Size Problem with Time-Varying Production Capacity Constraints
From MaRDI portal
Publication:3953531
DOI10.1287/mnsc.24.16.1710zbMath0491.90033MaRDI QIDQ3953531
Edward A. Silver, Kenneth R. Baker, Paul W. Dixon, Michael J. Magazine
Publication date: 1978
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.16.1710
optimal solution; single item; tree search algorithm; dynamic lot-size problem; deterministic time-varying demand pattern; time-varying production capacity constraints
90B05: Inventory, storage, reservoirs
Related Items
Improved algorithms for dynamic lot sizing problems with incremental discount, Overview of Production Planning, Decentralized supply chain coordination through auction markets: dynamic lot-sizing in distribution networks, Lot sizing with bounded inventory and lost sales, Combined replenishment and warehousing with contract commitments and flexibilities, Inventory Management: An Overview, Canadian Publications, Practical Applications and Suggestions for Future Research, Capacitated lot sizing problems with inventory bounds, Analysis of the maximum level policy in a production-distribution system, A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints, Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time, Set partitioning and column generation heuristics for capacitated dynamic lotsizing, A primal-dual algorithm for the economic lot-sizing problem with multi-mode replenishment, A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure, A dynamic production scheduling model with lost-sales or backlogging, Planning horizons for multi-item hierarchical production scheduling problems: A heuristic search procedure, Production planning with time-dependent capacity bounds, An efficient algorithm for the capacitated single item dynamic lot size problem, A new dynamic programming algorithm for the single item capacitated dynamic lot size model, A dynamic programming algorithm for dynamic lot size models with piecewise linear costs, An effective algorithm for the capacitated single item lot size problem, Two-stage absolute semi-deviation mean-risk stochastic programming: an application to the supply chain replenishment problem, Improved exact algorithms to economic lot-sizing with piecewise linear production costs, Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost, Facets and algorithms for capacitated lot sizing, Heuristic methods and applications: A categorized survey, A production planning model for an unreliable production facility: case of finite horizon and single demand, A new characterization for the dynamic lot size problem with bounded inventory, Single item lot-sizing problems with backlogging on a single machine at a finite production rate, Decision horizons for the capacitated lot size model with inventory bounds and stockouts, Capacitated replenishment and disposal planning for multiple products with resalable returns, A single-item economic lot-sizing problem with a non-uniform resource: Approximation, Cross-facility management of production and transportation planning problem, Single item lot sizing problems, Capacitated production planning with outsourcing in an OKP company, Unnamed Item, Multifacility in-series production-planning model with capacity constraints
