메뉴 건너뛰기
Journal of the Operational Research Society
Volumn 61, Issue 4, 2010, Pages 676-685
Linear programming based approaches for the discrete time/cost trade-off problem in project networks
Author keywords

Branch and Bound; Linear Programming; Project management; Time Cost Trade off
Indexed keywords

APPROXIMATION ALGORITHMS; BRANCH AND BOUND METHOD; LINEAR PROGRAMMING; PROJECT MANAGEMENT;
EID: 77949475172     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.2009.20     Document Type: Article
Times cited : (22)
References (13)
  • 1
    • 13444270579 scopus 로고    scopus 로고
    • Network decompositionbased benchmark results for the discrete time-cost tradeoff problem
    • Akkan C, Drexl A and Kimms A (2005). Network decompositionbased benchmark results for the discrete time-cost tradeoff problem. Eur J Opl Res 165: 339-358.
    • (2005) Eur J Opl Res , vol.165 , pp. 339-358
    • Akkan, C.1    Drexl, A.2    Kimms, A.3
  • 2
    • 0000728410 scopus 로고
    • Optimal reduction of two-terminal directed acyclic graphs
    • Bein WW, Kamburowski J and Stallmann MFM (1992). Optimal reduction of two-terminal directed acyclic graphs. SIAM J Comput 21: 1112-1129.
    • (1992) SIAM J Comput , vol.21 , pp. 1112-1129
    • Bein, W.W.1    Kamburowski, J.2    Stallmann, M.F.M.3
  • 3
    • 0040687741 scopus 로고
    • Dynamic programming for project cost-time curves
    • Butcher WS (1967). Dynamic programming for project cost-time curves. J Construct Div-ASCE 93: 59-73.
    • (1967) J Construct Div-ASCE , vol.93 , pp. 59-73
    • Butcher, W.S.1
  • 4
    • 0031102411 scopus 로고    scopus 로고
    • Complexity of the discrete time-cost tradeoff problem for project networks
    • De P, Dunne EJ, Ghosh JB and Wells CE (1997). Complexity of the discrete time-cost tradeoff problem for project networks. Opns Res 45: 302-306.
    • (1997) Opns Res , vol.45 , pp. 302-306
    • De, P.1    Dunne, E.J.2    Ghosh, J.B.3    Wells, C.E.4
  • 5
    • 0035687853 scopus 로고    scopus 로고
    • Hardness of approximation of the discrete time-cost tradeoff problem
    • Deineko VG and Woeginger GJ (2001). Hardness of approximation of the discrete time-cost tradeoff problem. Opns Res Lett 29: 207-210.
    • (2001) Opns Res Lett , vol.29 , pp. 207-210
    • Deineko, V.G.1    Woeginger, G.J.2
  • 6
    • 0030571696 scopus 로고    scopus 로고
    • Optimal procedures for the discrete time/cost trade-off problem in project networks
    • Demeulemeester E, Herroelen W and Elmaghraby SE (1996). Optimal procedures for the discrete time/cost trade-off problem in project networks. Eur J Opl Res 88: 50-68.
    • (1996) Eur J Opl Res , vol.88 , pp. 50-68
    • Demeulemeester, E.1    Herroelen, W.2    Elmaghraby, S.E.3
  • 7
    • 0032205606 scopus 로고    scopus 로고
    • New computational results on the discrete time/cost trade-off problem in project networks
    • Demeulemeester E, De Reyck B, Foubert B, Herroelen W and Vanhoucke M (1998). New computational results on the discrete time/cost trade-off problem in project networks. J Opl Res Soc 49: 1153-1163.
    • (1998) J Opl Res Soc , vol.49 , pp. 1153-1163
    • Demeulemeester, E.1    De Reyck, B.2    Foubert, B.3    Herroelen, W.4    Vanhoucke, M.5
  • 8
    • 0027302082 scopus 로고
    • Resource allocation via dynamic programming in activity networks
    • Elmaghraby SE (1993). Resource allocation via dynamic programming in activity networks. Eur J Opl Res 64: 199-215.
    • (1993) Eur J Opl Res , vol.64 , pp. 199-215
    • Elmaghraby, S.E.1
  • 9
    • 0000181338 scopus 로고
    • A network flow computation for project cost curves
    • Fulkerson DR (1961). A network flow computation for project cost curves. Mngt Sci 7: 167-178.
    • (1961) Mngt Sci , vol.7 , pp. 167-178
    • Fulkerson, D.R.1
  • 10
    • 0001620447 scopus 로고
    • Critical-path planning and scheduling: Mathematical basis
    • Kelley JE (1961). Critical-path planning and scheduling: Mathematical basis. Opns Res 9: 296-320.
    • (1961) Opns Res , vol.9 , pp. 296-320
    • Kelley, J.E.1
  • 11
    • 0017638717 scopus 로고
    • Solving the project time/cost tradeoff problem using the minimal cut concept
    • Phillips S and Dessouky MI (1977). Solving the project time/cost tradeoff problem using the minimal cut concept. Mngt Sci 24: 393-399.
    • (1977) Mngt Sci , vol.24 , pp. 393-399
    • Phillips, S.1    Dessouky, M.I.2
  • 12
    • 0016566179 scopus 로고
    • A dynamic programming solution to the cost-time tradeoff for CPM
    • Robinson DR (1975). A dynamic programming solution to the cost-time tradeoff for CPM. Mngt Sci 22: 158-166.
    • (1975) Mngt Sci , vol.22 , pp. 158-166
    • Robinson, D.R.1
  • 13
    • 0032208139 scopus 로고    scopus 로고
    • Approximation algorithms for the discrete time-cost tradeoff problem
    • Skutella M (1998). Approximation algorithms for the discrete time-cost tradeoff problem. Math Opns Res 23: 195-203.
    • (1998) Math Opns Res , vol.23 , pp. 195-203
    • Skutella, M.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.