A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
From MaRDI portal
Publication:1926904
DOI10.1016/j.ejor.2012.04.024zbMath1253.90025MaRDI QIDQ1926904
Bertrand Hellion, Fabien Mangione, Bernard Penz
Publication date: 29 December 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.2012.04.024
90B05: Inventory, storage, reservoirs
Related Items
Improved algorithms for dynamic lot sizing problems with incremental discount, The single-item green lot-sizing problem with fixed carbon emissions, Dual-mode production planning for manufacturing with emission constraints, Lot sizing with minimum order quantity, Lot sizing with storage losses under demand uncertainty, Single-item dynamic lot-sizing problems: an updated survey, 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, Production lot-sizing with dynamic capacity adjustment, Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities, A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities, A synergic economic order quantity model with trade credit, shortages, imperfect quality and inspection errors, Polynomial cases of the economic lot sizing problem with cost discounts, Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount, Efficient algorithms for the joint replenishment problem with minimum order quantities, On Robust Lot Sizing Problems with Storage Deterioration, with Applications to Heat and Power Cogeneration, Lot Sizing with Piecewise Concave Production Costs, Polynomial-Time Solvability of Dynamic Lot Size Problems
Cites Work
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- Inventory replenishment model: lot sizing versus just-in-time delivery.
- 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
- Computational Complexity of the Capacitated Lot Size Problem
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
