Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

DOI10.1287/moor.26.2.339.10552zbMath1082.90532MaRDI QIDQ5704043

Albert P. M. Wagelmans, Stan P. M. van Hoesel

Publication date: 11 November 2005

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://cris.maastrichtuniversity.nl/en/publications/aaca34b5-a2dd-4ce5-9a16-2b6d8ae3115e

zbMATH Keywords

Analysis of algorithms, fully polynomial approximation scheme, lot-sizing model, single-item capacitated lot-sizing

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C60: Abstract computational complexity for mathematical programming problems

90B35: Deterministic scheduling theory in operations research

90C27: Combinatorial optimization

90B05: Inventory, storage, reservoirs

68W25: Approximation algorithms