Hardness of approximation of the discrete time-cost tradeoff problem

Authors:
Vladimir G. DeıNeko;Gerhard J. Woeginger
Affiliations:
Warwick Business School, The University of Warwick, Coventry CV4 7AL, UK;Department of Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherlands and Institut für Mathematik, Technische Universität Graz, Steyrergasse 30, A-8010 Graz, A ...
Venue:
Operations Research Letters
Year:
2001

Citing 2
Cited 7

Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem

Mathematics of Operations Research
Some APX-completeness results for cubic graphs

Theoretical Computer Science

Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The discrete time/cost trade-off problem: extensions and heuristic procedures

Journal of Scheduling
Low power discrete voltage assignment under clock skew scheduling

Proceedings of the 16th Asia and South Pacific Design Automation Conference
Decision Support and Optimization in Shutdown and Turnaround Scheduling

INFORMS Journal on Computing
Power-saving scheduling for weakly dynamic voltage scaling devices

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks

Operations Research Letters
Decision Support and Optimization in Shutdown and Turnaround Scheduling

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.