New computational results on the discrete time/cost trade-off problem in project networks

Journal of the Operational Research Society

Volumn 49, Issue 11, 1998, Pages 1153-1163

  Foubert, B ^c   Herroelen, W ^a   Vanhoucke, M ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

^c UNIVERSITY OF ANTWERP   (Belgium)

Author keywords

Branch and bound; CPM; Project management; Time cost trade off

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; COST BENEFIT ANALYSIS; CRITICAL PATH ANALYSIS; ITERATIVE METHODS; OPTIMIZATION; PIECEWISE LINEAR TECHNIQUES;

ACTIVITY-ON-THE-ARC NETWORKS; BRANCH AND BOUND METHODS; CONVEX PIECEWISE LINEAR UNDERESTIMATIONS; DISCRETE TIME/COST TRADE-OFF CURVES;

SCHEDULING;

EID: 0032205606     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600634     Document Type: Article

References (12)

1. Moder JJ, Phillips CR and Davis EW (1983). Project Management with CPM, PERT and Precedence Diagramming, 3rd ed. Van Nostrand Reinhold: New York.
2. De P, Dunne EJ, Ghosh JB and Wells CE (1995). The discrete time/cost trade-off problem revisited. Eur J Opl Res 81: 225-238.
3. Herroelen W, Demeulemeester E and De Reyck B (1998). A classification scheme for project scheduling problems. In: Weglarz J (ed). Handbook on Recent Developments in Project Scheduling. Kluwer Academic Publishers, to appear.
4. Fulkerson DR (1961). A network flow computation for project cost curves. Mgmt Sci 7: 167-179.
5. Ahuja RK, Magnanti TL and Orlin JB (1989). Network flows. In: Nemhauser G et al (eds). Optimisation, Handbooks in Operations Research and Management Science, Vol. 1. North-Holland, Chapter 4, pp 211-369.
6. De P, Dunne EJ, Ghosh JB and Wells CE (1997). Complexity of the discrete time/cost trade-off problem for project networks. Ops Res 45: 302-306.
7. Demeulemeester EL, Herroelen WS and Elmaghraby SE (1996). Optimal procedures for the discrete time/cost tradeoff problem in project networks. Eur J Opl Res 88: 50-68.
8. Kolisch R, Sprecher A and Drexl A (1995). Characterization and generation of a general class of resource-constrained project scheduling problems. Mgmt Sci 41: 1693-1703.
9. Pascoe TL (1966). Allocation of resources—CPM. Rev fr Rech oper 38: 31-38.
10. De Reyck B and Herroelen W (1966). On the use of the complexity index as a measure of complexity in activity networks. Eur J Opl Res 91: 347-366.
11. Kamburowski J, Michael DJ and Stallmann MFM (1992). Optimal construction of project activity networks. Proc 1992 Annual Meeting of the Decision Sciences Institute, Decision Sciences Institute, USA pp 1424-1426.
12. Bein WW, Kamburowski J and Stallmann MFM (1992). Optimal reduction of two-terminal directed acyclic grarphs. SIAM J Computing 21: 1112-1129.