We consider the discrete version of the well-known time-cost tradeoff problem for project networks, which has been extensively studied in the project management literature. We prove a strong in-approximability result with respect to polynomial time bicriteria approximation algorithms for this problem.
['Vladimir G. Deineko', 'Gerhard J. Woeginger']
Hardness of approximation of the discrete time-cost tradeoff problem