An O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities
From MaRDI portal
Publication:418062
DOI10.1016/J.EJOR.2011.01.007zbMATH Open1237.90021OpenAlexW2049672007MaRDI QIDQ418062FDOQ418062
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
Recommendations
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
- A Greedy Algorithm for Capacitated Lot-Sizing Problems
- A Lagrange relaxation algorithm for capacitated lot-size problem (CLSP) with minimum lot-size constraint
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities
- An efficient algorithm for the capacitated single item dynamic lot size problem
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem
dynamic programmingcapacity constraintsproduction planningcapacitated lot sizing problemminimum order quantitiessingle item
Cites Work
- Single item lot sizing problems
- Modeling industrial lot sizing problems: a review
- Lower bounds in lot-sizing models: A polyhedral study
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Computational Complexity of the Capacitated Lot Size Problem
- Bounded Production and Inventory Models with Piecewise Concave Costs
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs
- 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
- The Single Item Dynamic Lot Sizing Problem with Minimum Lot Size Restriction
- Inventory replenishment model: lot sizing versus just-in-time delivery.
Cited In (17)
- Improved exact algorithms to economic lot-sizing with piecewise linear production costs
- Lot Sizing with Piecewise Concave Production Costs
- Single-item dynamic lot-sizing problems: an updated survey
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities
- A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows
- 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
- An integrated model for lot sizing with supplier selection and quantity discounts
- 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
- 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
- Polynomial-Time Solvability of Dynamic Lot Size Problems
- A polynomial time algorithm to solve the single-item capacitated lot sizing problem with minimum order quantities and concave costs
- Production lot-sizing with dynamic capacity adjustment
This page was built for publication: An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418062)
