An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand

DOI10.1016/j.orl.2012.08.011zbMath1258.90034OpenAlexW1969595661MaRDI QIDQ1939682

Sergei Chubanov, Erwin Pesch

Publication date: 5 March 2013

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2012.08.011

zbMATH Keywords

dynamic programmingapproximation schemelot-sizing

Mathematics Subject Classification ID

Production models (90B30) Dynamic programming (90C39)

Related Items (2)

Polynomial-Time Solvability of Dynamic Lot Size Problems ⋮ Single-item dynamic lot-sizing problems: an updated survey

Cites Work

• Unnamed Item
• A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure
• Improving the complexities of approximation algorithms for optimization problems
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems

This page was built for publication: An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand