A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows

DOI10.1016/J.ORL.2014.08.010zbMath1408.90011OpenAlexW2015708608MaRDI QIDQ1785294

Fabien Mangione, Bertrand Hellion, Bernard Penz

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2014.08.010

zbMATH Keywords

polynomial time algorithmlot-sizingcapacity constraintdynamic time windowminimum order quantity

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05)

Related Items (2)

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

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.
• Four equivalent lot-sizing models
• A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
• Corrigendum to ``A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
• A comparison of methods for lot-sizing in a rolling horizon environment
• Lot-sizing with production and delivery time windows
• An efficient optimal solution method for the joint replenishment problem with minimum order quantities
• Single item lot sizing problems
• Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales
• A Dynamic Lot-Sizing Model with Demand Time Windows
• Capacitated Multi-Item Lot-Sizing Problems with Time Windows
• An O(T³) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
• Deterministic Production Planning with Concave Costs and Capacity Constraints
• Dynamic lot‐sizing model with production time windows

This page was built for publication: A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows