Approximation algorithms for the discrete Time-Cost Tradeoff Problem

Mathematics of Operations Research

Volumn 23, Issue 4, 1998, Pages 909-929

  Skutella, Martin ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation algorithm; Bicriteria optimization; Scheduling; Time cost tradeoff

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COSTS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

BICRITERIA APPROXIMATION ALGORITHMS; DISCRETE TIME-COST TRADEOFFS;

SCHEDULING;

EID: 0032208139     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.4.909     Document Type: Article

References (21)

1. Bertsimas, D., C. Teo, R. Vohra. 1996. On dependent randomized Founding algorithms. W. H. Cunningham, S. T. McCormick, and M. Queyranne. eds, Integer Programming and Combinatorial Optimization, Volume 1084 of Lecture Notes in Computer Science, 330-344. Springer, Berlin.
2. Chekuri, C. S., R. Motwani, B. Natarajan, C. Stein. 1997. Approximation techniques for average completion time scheduling. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 609-618.
3. De, P., E. J. Dunne, J. B. Ghosh, C. E. Wells. 1995. The discrete time-cost tradeoff problem revisited. European J. Oper. Res. 81 225-238.
4. _, _, _, _. 1997. Complexity of the discrete time-cost tradeoff problem for project networks. Oper. Res. 45 302-306.
5. Fulkerson, D. R. 1961. A network flow computation for project cost curves. Management Sci. 7 167-178.
6. Goemans, M. X. 1997. Improved approximation algorithms for scheduling with release dates. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, 591-598.
7. _, M. Queyranne, A. S. Schulz, M. Skutella, Y. Wang. 1998. Single machine scheduling with release dates. (to appear).
8. Goldberg, A., R. E. Tarjan. 1988. A new approach to the maximum flow problem. J. Assoc. Comput. Mach. 35 921-940.
9. Harvey, R. T., J. H. Patterson. 1979. An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis. Found. Control Engineering 4 107-117.
10. Hindelang, T. J., J. F. Muth. 1979. A dynamic programming algorithm for Decision CPM networks. Oper. Res. 27 225-241.
11. Kelley, J E. 1961. Critical path planning and scheduling. Mathematical basis. Oper. Res. 9 296-320.
12. _, M. R. Walker. 1959. Critical Path Planning and Scheduling: An Introduction. Mauchly Associates, Inc., Ambler, Pennsylvania.
13. Krishnamoorthy, M., N. Deo. 1979. Complexity of the minimum-dummy-activities problem in a PERT network. Networks 9 189-194.
14. Möhring, R. H., F. J. Radermacher. 1989. The order-theoretic approach to scheduling: The deterministic case. R. Slowinski and J. Weglarz, eds. Advances in Project Scheduling. Elseviers Science Publ., Amsterdam. 29-66.
15. Padberg, M. 1995. Linear Optimization and Extensions. Springer, Berlin.
16. Panagiotakopoulos, D. 1977. A CPM time-cost computational algorithm for arbitrary activity cost functions. INFOR 15 183-195.
17. Phillips, S., M. I. Dessouky. 1977. Solving the project time/cost tradeoff problem using the minimal cut concept. Management Sci. 24 393-400.
18. Robinson, D. R. 1975. A dynamic programming solution to cost-time tradeoff for CPM. Management Sci. 22 158-166.
19. Schulz, A. S., M. Skutella. 1997. Random-based scheduling: New approximations and LP lower bounds. J. Rolim, ed. Randomization and Approximation Techniques in Computer Science. Volume 1269 of Lecture Notes in Computer Science. Springer, Berlin. 119-133.
20. Shmoys, D. B., E. Tardos, K. I. Aardal. 1997. Approximation algorithms for facility location problems. Proceedings of the 29th Annual ACM Symposium on the Theory of Computing. 265-274.
21. Skutella, M. 1998. Approximation and randomization in scheduling. Ph.D. thesis, Technical University of Berlin, Germany.