A dynamic programming approach for the two-product capacitated lot-sizing problem with concave costs
From MaRDI portal
Publication:6106968
DOI10.1016/j.ejor.2022.08.026WikidataQ114184242 ScholiaQ114184242MaRDI QIDQ6106968
José A. Ventura, Kevin A. Bunn
Publication date: 3 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Capacitated lot sizing with parallel machines, sequence-dependent setups, and a common setup operator
- An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities
- Capacitated lot sizing problems with inventory bounds
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Set partitioning and column generation heuristics for capacitated dynamic lotsizing
- A simple heuristic for the multi-item single level capacitated lotsizing problem
- Primal-dual approach to the single level capacitated lot-sizing problem
- A new heuristic approach for the multi-item dynamic lot sizing problem
- Single-item dynamic lot-sizing problems: an updated survey
- Facets and algorithms for capacitated lot sizing
- Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup
- Dynamic capacitated lot-sizing problems: a classification and review of solution approaches
- Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount
- Dynamic Version of the Economic Lot Size Model
- Lot Sizing with Piecewise Concave Production Costs
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
- Strong Formulations for Multi-Item Capacitated Lot Sizing
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Deterministic Production Planning: Algorithms and Complexity
- Solving the CLSP by a Tabu Search Heuristic
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- Basis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem
- Algorithms for Single-Item Lot-Sizing Problems with Constant Batch Size