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

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

Sergei Chubanov, Erwin Pesch

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

schedulingdynamic programminginput-output modelfully polynomial time approximation scheme

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Production models (90B30) Realizations from input-output data (93B15) Complexity and performance of numerical algorithms (65Y20)

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

This page was built for publication: Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities