An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities

DOI10.1016/j.ejor.2011.01.007zbMath1237.90021OpenAlexW2049672007MaRDI QIDQ418062

Irena Okhrin, Knut Richter

Publication date: 14 May 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.01.007

zbMATH Keywords

dynamic programmingproduction planningcapacity constraintscapacitated lot sizing problemminimum order quantitiessingle item

Mathematics Subject Classification ID

Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (16)

The single-item green lot-sizing problem with fixed carbon emissions ⋮ Dual-mode production planning for manufacturing with emission constraints ⋮ Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ An integrated model for lot sizing with supplier selection and quantity discounts ⋮ Lot Sizing with Piecewise Concave Production Costs ⋮ A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs ⋮ Efficient algorithms for the joint replenishment problem with minimum order quantities ⋮ Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities ⋮ Impacts of the minimum quantity contract on an online retail platform ⋮ A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Lot sizing with minimum order quantity ⋮ A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities ⋮ Production lot-sizing with dynamic capacity adjustment ⋮ Improved exact algorithms to economic lot-sizing with piecewise linear production costs ⋮ A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows

Cites Work

• Inventory replenishment model: lot sizing versus just-in-time delivery.
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Efficient and effective heuristics for the coordinated capacitated lot-size problem
• An efficient optimal solution method for the joint replenishment problem with minimum order quantities
• Single item lot sizing problems
• Lower Bounds in Lot-Sizing Models: A Polyhedral Study
• MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
• An O(T²) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
• Computational Complexity of the Capacitated Lot Size Problem
• Bounded Production and Inventory Models with Piecewise Concave Costs
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Modeling industrial lot sizing problems: a review
• The Single Item Dynamic Lot Sizing Problem with Minimum Lot Size Restriction

This page was built for publication: An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities