Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities

DOI10.1007/s00186-008-0270-5zbMath1190.49046MaRDI QIDQ1040690

Erwin Pesch, Sergei Chubanov

Publication date: 25 November 2009

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

Full work available at URL: https://doi.org/10.1007/s00186-008-0270-5

zbMATH Keywords

scheduling; dynamic programming; input-output model; fully polynomial time approximation scheme

Mathematics Subject Classification ID

49N90: Applications of optimal control and differential games

90B30: Production models

93B15: Realizations from input-output data

65Y20: Complexity and performance of numerical algorithms

Cites Work

• Improving the complexities of approximation algorithms for optimization problems
• Algorithms for Scheduling Independent Tasks
• When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
• Note: Some Conditions of Macroeconomic Stability