Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks

DOI10.1007/978-3-540-85363-3_8zbMath1159.68666OpenAlexW1577407410MaRDI QIDQ3541789

Chung-Lun Li, Nir Halman, David Simchi-Levi

Publication date: 27 November 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1835

zbMATH Keywords

project managementapproximation algorithmstime-cost tradeoff

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27) Approximation algorithms (68W25)

This page was built for publication: Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks