메뉴 건너뛰기




Volumn 11, Issue 3, 1997, Pages 184-189

Using genetic algorithms to solve construction time-cost trade-off problems

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; CONSTRUCTION; MONITORING; OPTIMIZATION; PLANNING;

EID: 0031185451     PISSN: 08873801     EISSN: None     Source Type: Journal    
DOI: 10.1061/(ASCE)0887-3801(1997)11:3(184)     Document Type: Article
Times cited : (401)

References (22)
  • 1
    • 4544318435 scopus 로고    scopus 로고
    • The LP/IP hybrid method for construction time-cost trade-off analysis
    • Burns, S., Liu, L., and Feng, C. (1996). "The LP/IP hybrid method for construction time-cost trade-off analysis." Constr. Mgmt. and Economics, 14, 265-276.
    • (1996) Constr. Mgmt. and Economics , vol.14 , pp. 265-276
    • Burns, S.1    Liu, L.2    Feng, C.3
  • 2
    • 0029632618 scopus 로고
    • The discrete time-cost tradeoff problem revisited
    • De, P., Dunne, E. J., and Wells, C. E. (1995). "The discrete time-cost tradeoff problem revisited." Eur. J. Operational Res., 81, 225-238.
    • (1995) Eur. J. Operational Res. , vol.81 , pp. 225-238
    • De, P.1    Dunne, E.J.2    Wells, C.E.3
  • 4
    • 0027302082 scopus 로고
    • Resource allocation via dynamic programming in activity networks
    • Elmagrhraby, S. E. (1993). "Resource allocation via dynamic programming in activity networks." Euro. J. Operational Res., 64, 199-215.
    • (1993) Euro. J. Operational Res. , vol.64 , pp. 199-215
    • Elmagrhraby, S.E.1
  • 5
    • 0038909957 scopus 로고
    • A non-computer approach to the critical path method for the construction industry
    • The Constr. Inst., Dept. of Civ. Engrg., Stanford Univ., Stanford, Calif.
    • Fondahl, J. W. (1961). "A non-computer approach to the critical path method for the construction industry." Tech. Rep. No. 9, The Constr. Inst., Dept. of Civ. Engrg., Stanford Univ., Stanford, Calif.
    • (1961) Tech. Rep. No. 9
    • Fondahl, J.W.1
  • 8
    • 0004596361 scopus 로고
    • Toward a better understanding of mixing in genetic algorithms
    • Goldberg, D. E., Deb, K., and Thierens, D. (1993). "Toward a better understanding of mixing in genetic algorithms." J. SICE, 32(1), 10-16.
    • (1993) J. SICE , vol.32 , Issue.1 , pp. 10-16
    • Goldberg, D.E.1    Deb, K.2    Thierens, D.3
  • 9
    • 0006022546 scopus 로고
    • Multicriteria optimization for highly accurate systems
    • Plenum Publishing Corp., New York, N.Y.
    • Hans, A. E. (1988). "Multicriteria optimization for highly accurate systems," Multicriteria optimization in engineering and sciences, Plenum Publishing Corp., New York, N.Y., 309-352.
    • (1988) Multicriteria Optimization in Engineering and Sciences , pp. 309-352
    • Hans, A.E.1
  • 13
    • 0039502581 scopus 로고
    • Critical path planning and scheduling: Mathematical basis
    • Kelly, James E. Jr. (1961). "Critical path planning and scheduling: mathematical basis." Operations Res., 9(3), 167-179.
    • (1961) Operations Res. , vol.9 , Issue.3 , pp. 167-179
    • Kelly Jr., J.E.1
  • 14
    • 0042416399 scopus 로고
    • Extensions of the critical path method through the application of integer programming
    • Univ. of Illinois, Urbana, Ill.
    • Meyer, W. L., and Shaffer, L. R. (1963). "Extensions of the critical path method through the application of integer programming." Civ. Engrg. Constr. Res. Ser. 2, Univ. of Illinois, Urbana, Ill.
    • (1963) Civ. Engrg. Constr. Res. Ser. 2
    • Meyer, W.L.1    Shaffer, L.R.2
  • 15
    • 0027545671 scopus 로고
    • Schedule compression using the direct stiffness method
    • Moselhi, O. (1993). "Schedule compression using the direct stiffness method." Can. J. Civ. Engrg., 20, 65-72.
    • (1993) Can. J. Civ. Engrg. , vol.20 , pp. 65-72
    • Moselhi, O.1
  • 17
    • 0016028677 scopus 로고
    • A horizon-varying, zero-one approach to project scheduling
    • Patterson, J. H., and Huber, D. (1974). "A horizon-varying, zero-one approach to project scheduling." Mgmt. Sci., 20(6), 990-998.
    • (1974) Mgmt. Sci. , vol.20 , Issue.6 , pp. 990-998
    • Patterson, J.H.1    Huber, D.2
  • 18
    • 0342275420 scopus 로고
    • A structural method of computing project cost polygons
    • Prager, W. (1963). "A structural method of computing project cost polygons." Mgmt. Sci., 9(3), 394-404.
    • (1963) Mgmt. Sci. , vol.9 , Issue.3 , pp. 394-404
    • Prager, W.1
  • 19
    • 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." Mgmt. Sci., 22(2), 158-166.
    • (1975) Mgmt. Sci. , vol.22 , Issue.2 , pp. 158-166
    • Robinson, D.R.1
  • 20
    • 19244376018 scopus 로고
    • A simple CPM time-cost tradeoff algorithm
    • Siemens, N. (1971). "A simple CPM time-cost tradeoff algorithm." Mgmt. Sci., 17(6), B-354-363.
    • (1971) Mgmt. Sci. , vol.17 , Issue.6
    • Siemens, N.1
  • 21
    • 0000852513 scopus 로고
    • Multi-objective optimization using nondominated sorting in genetic algorithms
    • Srinivas, N., and Deb, K. (1995). "Multi-objective optimization using nondominated sorting in genetic algorithms." Evolutionary Computation, 2(3), 221-248.
    • (1995) Evolutionary Computation , vol.2 , Issue.3 , pp. 221-248
    • Srinivas, N.1    Deb, K.2


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