A new path-based cutting plane approach for the discrete time-cost tradeoff problem

Computational Management Science

Volumn 7, Issue 3, 2010, Pages 313-336

  Hadjiconstantinou, Eleni ^a   Klerides, Evelina ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Cutting plane; Discrete time cost tradeoff problem; Project scheduling

Indexed keywords

EID: 77954089428     PISSN: 1619697X     EISSN: 16196988     Source Type: Journal    
DOI: 10.1007/s10287-009-0115-6     Document Type: Article

References (21)

1. Akkan C, Drexl A, Kimms A (2005) Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. Eur J Oper Res 165(2): 339-358.
2. Brucker P, Drexl A, Mohring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Oper Res 112(1): 3-41.
3. Crowston WB (1970) Decision CPM: network reduction and solution. Oper Res Q 21(4): 435-452.
4. Crowston W, Thompson GL (1967) Decision CPM: a method for simultaneous planning, scheduling, and control of projects. Oper Res 15(3): 407-426.
5. De P, Dunne EJ, Ghosh JB, Wells CE (1995) The discrete time-cost tradeoff problem revisited. Eur J Oper Res 81: 225-238.
6. De P, Dunne EJ, Ghosh JB, Wells CE (1997) Complexity of the discrete time-cost tradeoff problem for project networks. Oper Res 45(2): 302-306.
7. Demeulemeester EL, Herroelen WS (2002) Project scheduling: a research handbook. Kluwer, Boston.
8. Demeulemeester EL, Herroelen WS, Elmaghraby SE (1996) Optimal procedures for the discrete time cost trade-off problem in project networks. Eur J Oper Res 88(1): 50-68.
9. Demeulemeester E, De Reyck B, Foubert B, Herroelen WS, Vanhoucke M (1998) New computational results on the discrete time/cost trade-off problem in project networks. J Oper Res Soc 49(11): 1153-1163.
10. Dongarra JJ (2008) Performance of various computers using standard linear equations software (Linpack Benchmark Report). Computer Science Technical Report, CS-89-85, University of Tennessee.
11. Elmaghraby SE (1993) Resource allocation via dynamic programming in activity networks. Eur J Oper Res 64(2): 199-215.
12. Harvey RT, Patterson JH (1979) An implicit enumeration algorithm for the time/cost trade-off problem in project network analysis. Found Control Eng 6: 107-117.
13. Herroelen W, Demeulemeester E, De Reyck B (1999) A classification scheme for project scheduling problems, chap 1. Kluwer, Amsterdam, pp 1-26.
14. Hindelang TJ, Muth JF (1979) A dynamic programming algorithm for decision CPM networks. Oper Res 27(2): 225-241.
15. Kelley JR, Walker MR (1959) Critical path planning and scheduling: an introduction. Mauchly Associates, Inc., Ambler, Pennsylvania.
16. Kolisch R, Padman R (2001) An integrated survey of deterministic project scheduling. Omega 29(3): 249-272.
17. Kolisch R, Sprecher A, Drexl A (1995) Characterization and generation of a general class of resource-constrained project scheduling problems. Manag Sci 41(10): 1693-1703.
18. Meyer WL, Shaffer LR (1963) Extensions of critical path method through the application of integer programming. Civil Engineering and Construction Research Series, University of Illinois, Urbana-Champaign, Illinois.
19. Robinson DR (1975) A dynamic programming solution to cost-time tradeoff for CPM. Manag Sci 22(2): 158-166.
20. Skutella M (1998) Approximation algorithms for the discrete time-cost tradeoff problem. Math Oper Res 23: 992-1020.
21. Vanhoucke M, Debels D (2007) The discrete time/cost trade-off problem: extensions and heuristic procedures. J Sched 10(4-5): 311-326.