Dynamic programming approximation algorithms for the capacitated lot-sizing problem
DOI10.1007/s10898-015-0349-5zbMath1348.90484OpenAlexW2175983231MaRDI QIDQ288224
İ. Esra Büyüktahtakın, Ning Liu
Publication date: 25 May 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0349-5
data fittingmixed integer programmingapproximation algorithmsapproximate dynamic programmingcapacitated lot-sizingproduction and inventory control
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)
Related Items (5)
Cites Work
- Unnamed Item
- Unnamed Item
- A new dynamic programming algorithm for the single item capacitated dynamic lot size model
- A dynamic programming algorithm for dynamic lot size models with piecewise linear costs
- A study of the lot-sizing polytope
- Feature-based methods for large scale dynamic programming
- Dynamic Version of the Economic Lot Size Model
- Decomposing inventory routing problems with approximate value functions
- Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities
- Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes
- Production Planning of Style Goods with High Setup Costs and Forecast Revisions
- Deterministic Production Planning: Algorithms and Complexity
- A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n log n) or 0(n) Time
- A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem
- Approximate Dynamic Programming
- Production Planning by Mixed Integer Programming
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- Polynomial Approximation--A New Computational Technique in Dynamic Programming: Allocation Processes
This page was built for publication: Dynamic programming approximation algorithms for the capacitated lot-sizing problem