Project scheduling with irregular costs: Complexity, approximability, and algorithms

Acta Informatica

Volumn 41, Issue 2-3, 2004, Pages 83-97

  Grigoriev, Alexander ^a   Woeginger, Gerhard J ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; DISCRETE TIME-COST TRADEOFF PROBLEM; IRREGULAR COSTS; ORACLE ALGORITHMS; PROJECT SCHEDULING;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; COSTS; FUNCTIONS; POLYNOMIALS; PROBLEM SOLVING; PROJECT MANAGEMENT; SET THEORY; THEOREM PROVING;

COMPUTER SCIENCE;

EID: 10844237325     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00236-004-0150-2     Document Type: Article

References (22)

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B. (1993) Network flows: Theory, algorithms, and applications. Prentice Hall, Upper Saddle River, NJ
2. Brucker, P., Drexl, A., Möhring, R., Neumann, K., Pesch, E. (1999) Resource-constrained project scheduling: Notation, classification, models, and methods. European Journal of Operational Research 112: 3-41
3. Chang, G.J., Edmonds, J. (1985) The poset scheduling problem. Order 2: 113-118
4. De, P., Dunne, E.J., Gosh, J.B., Wells, C.E. (1995) The discrete time-cost tradeoff problem revisited. European Journal of Operational Research 81: 225-238
5. De, P., Dunne, E.J., Gosh, J.B., Wells, C.E. (1997) Complexity of the discrete time-cost tradeoff problem for project networks. Operations Research 45: 302-306
6. Deineko, V.G., Woeginger, G.J. (2001) Hardness of approximation of the discrete time-cost tradeoff problem. Operations Research Letters 29: 207-210
7. Demeulemeester, E.L., Herroelen, W.S. (2002) Project scheduling: A research handbook. Kluwer Academic Publishers
8. Dilworth, R.P. (1950) A decomposition theorem for partially ordered sets. Annals of Mathematics 51: 161-166
9. Frank, H., Frisch, I.T., van Slyke, R., Chou, W.S. (1970) Optimal design of centralized computer networks. Networks 1: 43-58
10. Garey, M.R., Johnson, D.S. (1979) Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco
11. Harvey, R.T., Patterson, J.H. (1979) An implicit enumeration algorithm for the time/cost tradeoff problem in project network analysis. Foundations of Control Engineering 4: 107-117
12. Håstad, J. (1997) Some optimal inapproximability results. Proceedings of the 29th ACM Symposium on the Theory of Computing (STOC'1997), pp. 1-10
13. 1-e. Acta Mathematica 182: 105-142
14. Hindelang, T.J., Muth, J.F. (1979) A dynamic programming algorithm for decision CPM networks. Operations Research 27: 225-241
15. Kelley, J.E., Walker, M.R. (1959) Critical path planning and scheduling: An introduction. Mauchly Associates Inc., Ambler, PA
16. Maniezzo, V., Mingozzi, A. (1999) The project scheduling with irregular cost distribution. Operations Research Letters 25: 175-182
17. Möhring, R.H. (1989) Computationally tractable classes of ordered sets. In: Rival, I. (ed.) Algorithms and order, pp. 105-193. Kluwer Academic Publishers
18. Möhring, R.H., Schulz, A.S., Stork, F., Uetz, M. (2001) On project scheduling with with irregular starting time costs. Operations Research Letters 28: 149-154
19. Robinson, D.R. (1975) A dynamic programming solution to cost-time tradeoff for CPM. Management Science 22: 158-166
20. Rothfarb, B., Frank, H., Rosenbaum, D.M., Steiglitz, K., Kleitman, D.J. (1970) Optimal design of offshore natural-gas pipeline systems. Operations Research 18: 992-1020
21. Skutella, M. (1998) Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research 23: 909-929
22. Valdes, J., Tarjan, R.E., Lawler, E.L. (1982) The recognition of series-parallel digraphs. SIAM Journal on Computing 11: 298-313