An O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities
From MaRDI portal
Publication:418062
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
Cites work
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- An efficient optimal solution method for the joint replenishment problem with minimum order quantities
- Bounded Production and Inventory Models with Piecewise Concave Costs
- Computational Complexity of the Capacitated Lot Size Problem
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Efficient and effective heuristics for the coordinated capacitated lot-size problem
- Inventory replenishment model: lot sizing versus just-in-time delivery.
- Lower bounds in lot-sizing models: A polyhedral study
- 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
- Modeling industrial lot sizing problems: a review
- Single item lot sizing problems
- The single item dynamic lot sizing problem with minimum lot size restriction
Cited in
(19)- An integrated model for lot sizing with supplier selection and quantity discounts
- 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
- 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
- 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
- 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
- Lot sizing with piecewise concave production costs
- A Lagrange relaxation algorithm for capacitated lot-size problem (CLSP) with minimum lot-size constraint
- Polynomial-time solvability of dynamic lot size problems
- The single-item green lot-sizing problem with fixed carbon emissions
- Dual-mode production planning for manufacturing with emission constraints
- An O(T2) Algorithm for the NI/G/NI/ND Capacitated Lot Size Problem
- Lot sizing with minimum order quantity
- 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
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)