메뉴 건너뛰기




Volumn 37, Issue 2, 1999, Pages 329-339

Scheduling project activities to maximize the net present value the case of linear time-dependent cash flows

Author keywords

[No Author keywords available]

Indexed keywords

COST ACCOUNTING; MATHEMATICAL MODELS; RESOURCE ALLOCATION;

EID: 0032761234     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499191797     Document Type: Article
Times cited : (23)

References (10)
  • 1
    • 0017478425 scopus 로고
    • Scheduling a project to maximize its present value: A zero-one programming approach
    • Doersch, R. H. and Patterson, J. H., 1977, Scheduling a project to maximize its present value: a zero-one programming approach. Management Sciences, 23, 882-889.
    • (1977) Management Sciences , vol.23 , pp. 882-889
    • Doersch, R.H.1    Patterson, J.H.2
  • 3
    • 0025701916 scopus 로고
    • The scheduling of activities to maximize the net present value of a project
    • Elmaghraby, S. E. and Herroelen, W. S., 1990, The scheduling of activities to maximize the net present value of a project. European Journal of Operational Research, 49, 35-49.
    • (1990) European Journal of Operational Research , vol.49 , pp. 35-49
    • Elmaghraby, S.E.1    Herroelen, W.S.2
  • 4
    • 0030784381 scopus 로고    scopus 로고
    • Scheduling projects to maximize net present value. The case of time-dependent contingent cash flows
    • Etgar, R., Shtub, A. and LeBlanc, L. J., 1996, Scheduling projects to maximize net present value. The case of time-dependent contingent cash flows. European Journal of Operational Research, No. 96, 90-96.
    • (1996) European Journal of Operational Research , vol.96 , pp. 90-96
    • Etgar, R.1    Shtub, A.2    Leblanc, L.J.3
  • 6
    • 0027553638 scopus 로고
    • Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of a project
    • Herroelen, W. S. and Gallens, E., 1993, Computational experience with an optimal procedure for the scheduling of activities to maximize the net present value of a project. European Journal of Operational Research, 65, 274-277.
    • (1993) European Journal of Operational Research , vol.65 , pp. 274-277
    • Herroelen, W.S.1    Gallens, E.2
  • 7
    • 0000637036 scopus 로고
    • Cash flows in networks
    • Russell, A. H., 1970, Cash flows in networks. Management Science, 16, 357-373.
    • (1970) Management Science , vol.16 , pp. 357-373
    • Russell, A.H.1
  • 8
    • 0022794872 scopus 로고
    • A comparison of heuristics for scheduling projects with cash flows and resource restrictions
    • Russell, R. A., 1986, A comparison of heuristics for scheduling projects with cash flows and resource restrictions. Management Science, 32, 1291-1300.
    • (1986) Management Science , vol.32 , pp. 1291-1300
    • Russell, R.A.1
  • 9
    • 0031336255 scopus 로고    scopus 로고
    • A branch and bound algorithm for scheduling projects to maximize net present value. The case of time-dependent contingent cash flows
    • Shtub, A. and Etgar, R., 1997, A branch and bound algorithm for scheduling projects to maximize net present value. The case of time-dependent contingent cash flows. International Journal of Production Research, 35, 3367-3378.
    • (1997) International Journal of Production Research , vol.35 , pp. 3367-3378
    • Shtub, A.1    Etgar, R.2
  • 10
    • 84985756242 scopus 로고
    • Using a late-start resource-constrained project schedule to improve project net present value
    • Smith-Daniels, D. E. and Aquilano, N. J., 1987, Using a late-start resource-constrained project schedule to improve project net present value. Decision Sciences, 18, 617-630.
    • (1987) Decision Sciences , vol.18 , pp. 617-630
    • Smith-Daniels, D.E.1    Aquilano, N.J.2


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