메뉴 건너뛰기




Volumn 30, Issue 2, 1998, Pages 155-173

Optimization model for construction project durations using a multistage decision process

Author keywords

Computation algorithms; Construction; Optimization model; Project duration; Time cost function

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS;

EID: 0031703509     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052159808941242     Document Type: Article
Times cited : (8)

References (12)
  • 1
    • 0003137149 scopus 로고
    • The computation algorithm for parametric objective function
    • Gass, S. and Saaty, T. (1955). The computation algorithm for parametric objective function. Naval Research Quart., 2, 39-46.
    • (1955) Naval Research Quart. , vol.2 , pp. 39-46
    • Gass, S.1    Saaty, T.2
  • 2
    • 0000181338 scopus 로고
    • A network flow computation for project cost curve
    • Fulkerson, D. R. (1961). A network flow computation for project cost curve. Management Science, 7, 167-178.
    • (1961) Management Science , vol.7 , pp. 167-178
    • Fulkerson, D.R.1
  • 3
    • 0001620447 scopus 로고
    • Critical path planning and scheduling: Mathematical basic
    • Kelley, J. K. (1961). Critical path planning and scheduling: mathematical basic. Operations Research, 3, 296-319.
    • (1961) Operations Research , vol.3 , pp. 296-319
    • Kelley, J.K.1
  • 4
    • 0017638717 scopus 로고
    • Solving the project time/cost tradeoff problem using minimal cut concept
    • Phillips, S. Jr. and Dessouky, M. I. (1977). Solving the project time/cost tradeoff problem using minimal cut concept. Management Science, 24, 393-400.
    • (1977) Management Science , vol.24 , pp. 393-400
    • Phillips Jr., S.1    Dessouky, M.I.2
  • 5
    • 0020138846 scopus 로고
    • A flow-preserving algorithm for the time-cost tradeoff problem
    • Tufekci, S. (1982). A flow-preserving algorithm for the time-cost tradeoff problem. IIE Transactions, 14, 109-113.
    • (1982) IIE Transactions , vol.14 , pp. 109-113
    • Tufekci, S.1
  • 6
    • 0020099056 scopus 로고
    • Compression of overlapping precedence networks
    • Perera, S. (1982). Compression of overlapping precedence networks. ASCE Journal of Construction Division, 108, 1-12.
    • (1982) ASCE Journal of Construction Division , vol.108 , pp. 1-12
    • Perera, S.1
  • 7
    • 0005608510 scopus 로고
    • The optimum allocation of resources among the activity of the network
    • Clark, C. E. (1961). The optimum allocation of resources among the activity of the network. Journal of Industrial Engineering, 12, 11-17.
    • (1961) Journal of Industrial Engineering , vol.12 , pp. 11-17
    • Clark, C.E.1
  • 8
    • 0015484051 scopus 로고
    • Critical path problems with concave cost-time curve
    • Falk, J. E. and Horowitz, J. L. (1972). Critical path problems with concave cost-time curve. Management Science, 19, 446-455.
    • (1972) Management Science , vol.19 , pp. 446-455
    • Falk, J.E.1    Horowitz, J.L.2
  • 9
    • 0040687741 scopus 로고
    • Dynamic programming for project cost-time curves
    • Butcher, W. S. (1967). Dynamic programming for project cost-time curves. ASCE Journal of Construction Division, 93, 59-73.
    • (1967) ASCE Journal of Construction Division , vol.93 , pp. 59-73
    • Butcher, W.S.1
  • 10
    • 0016566179 scopus 로고
    • A dynamic programming solution to cost-time tradeoff for CPM
    • Robinson, D. R. (1975). A dynamic programming solution to cost-time tradeoff for CPM. Management Science, 22, 158-166.
    • (1975) Management Science , vol.22 , pp. 158-166
    • Robinson, D.R.1
  • 11
    • 0346149435 scopus 로고
    • A CPM time-cost computational algorithm for arbitrary activity cost function
    • Panagiotakopoulos, D. (1977). A CPM time-cost computational algorithm for arbitrary activity cost function. INFOR, 15, 183-195.
    • (1977) INFOR , vol.15 , pp. 183-195
    • Panagiotakopoulos, D.1


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