메뉴 건너뛰기




Volumn 10, Issue 3, 2007, Pages 153-166

When it is worthwhile to work with the stochastic RCPSP?

Author keywords

Heuristics; Project management; Scheduling; Stochastic

Indexed keywords

COMPUTATIONAL EXPERIMENTS; NON-TRIVIAL DISTRIBUTIONS; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROJECT (RCPSP); STOCHASTIC DURATIONS;

EID: 34249902481     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-007-0012-1     Document Type: Review
Times cited : (94)

References (35)
  • 3
  • 6
    • 1942532245 scopus 로고    scopus 로고
    • Dynamic programming in a heuristically confined state space: A stochastic resource-constrained project scheduling application
    • Choi, J., Realff, M. J., & Lee, J. H. (2004). Dynamic programming in a heuristically confined state space: A stochastic resource-constrained project scheduling application. Computers and Chemical Engineering, 28, 1039-1058.
    • (2004) Computers and Chemical Engineering , vol.28 , pp. 1039-1058
    • Choi, J.1    Realff, M.J.2    Lee, J.H.3
  • 8
    • 0032273138 scopus 로고    scopus 로고
    • Understanding simulation solutions to resource-constrained project scheduling problems with stochastic task durations
    • Fernandez, A. A., Armacost, R. L., & Pet-Edwards, J. (1998). Understanding simulation solutions to resource-constrained project scheduling problems with stochastic task durations. Engineering Management Journal, 10, 5-13.
    • (1998) Engineering Management Journal , vol.10 , pp. 5-13
    • Fernandez, A.A.1    Armacost, R.L.2    Pet-Edwards, J.3
  • 12
    • 84944813080 scopus 로고
    • Bounds on multiprocessing timing anomalies
    • Graham, R. L. (1966). Bounds on multiprocessing timing anomalies. Bell System Technical Journal, 45, 1563-1581.
    • (1966) Bell System Technical Journal , vol.45 , pp. 1563-1581
    • Graham, R.L.1
  • 13
    • 84987049329 scopus 로고
    • Computational complexity of PERT problems
    • Hagstrom, J. N. (1988). Computational complexity of PERT problems. Networks, 18, 139-147.
    • (1988) Networks , vol.18 , pp. 139-147
    • Hagstrom, J.N.1
  • 14
    • 0032188522 scopus 로고    scopus 로고
    • A competitive genetic algorithm for resource-constrained project scheduling
    • Hartmann, S. (1998). A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics, 45, 733-750.
    • (1998) Naval Research Logistics , vol.45 , pp. 733-750
    • Hartmann, S.1
  • 15
    • 0035612930 scopus 로고    scopus 로고
    • Project scheduling with multiple modes: A genetic algorithm
    • Hartmann, S. (2001). Project scheduling with multiple modes: A genetic algorithm. Annals of Operations Research, 102, 111-135.
    • (2001) Annals of Operations Research , vol.102 , pp. 111-135
    • Hartmann, S.1
  • 16
    • 0034559432 scopus 로고    scopus 로고
    • Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
    • Hartmann, S., & Kolisch, R. (2000). Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. European Journal of Operational Research, 127, 394-407.
    • (2000) European Journal of Operational Research , vol.127 , pp. 394-407
    • Hartmann, S.1    Kolisch, R.2
  • 19
    • 26444479778 scopus 로고
    • Optimization by Simulated Annealing
    • Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by Simulated Annealing. Science, 220, 671-680.
    • (1983) Science , vol.220 , pp. 671-680
    • Kirkpatrick, S.1    Gelatt, C.D.2    Vecchi, M.P.3
  • 20
    • 0012231928 scopus 로고    scopus 로고
    • The sample average approximation method for stochastic discrete optimization
    • Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology
    • Kleywegt, A. J., & Shapiro, A. (1999). The sample average approximation method for stochastic discrete optimization. Technical report, School of Industrial and Systems Engineering, Georgia Institute of Technology.
    • (1999)
    • Kleywegt, A.J.1    Shapiro, A.2
  • 22
    • 0002030301 scopus 로고    scopus 로고
    • Heuristic Algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis
    • J. Weglarz Ed, Boston: Kluwer Academic Publishers
    • Kolisch, R., & Hartmann, S. (1999). Heuristic Algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In J. Weglarz (Ed.), Handbook of recent advances in project scheduling (pp. 147-178). Boston: Kluwer Academic Publishers.
    • (1999) Handbook of recent advances in project scheduling , pp. 147-178
    • Kolisch, R.1    Hartmann, S.2
  • 23
    • 0000801563 scopus 로고    scopus 로고
    • An integrated survey of deterministic project scheduling
    • Kolisch, R., & Padman, R. (2000). An integrated survey of deterministic project scheduling. Omega, 29, 249-272.
    • (2000) Omega , vol.29 , pp. 249-272
    • Kolisch, R.1    Padman, R.2
  • 25
    • 0000698758 scopus 로고
    • Characterization and generation of a general class of resource-constrained project scheduling problems
    • Kolisch, R., Sprecher, A., & Drexl, A. (1995). Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science, 41, 1693-1703.
    • (1995) Management Science , vol.41 , pp. 1693-1703
    • Kolisch, R.1    Sprecher, A.2    Drexl, A.3
  • 28
    • 0029393209 scopus 로고
    • A survey on the resource-constrained project scheduling problem
    • Özdamar, L., & Ulusoy, G. (1995). A survey on the resource-constrained project scheduling problem. AIIE Transactions, 27, 574-586.
    • (1995) AIIE Transactions , vol.27 , pp. 574-586
    • Özdamar, L.1    Ulusoy, G.2
  • 29
    • 0021460636 scopus 로고
    • A comparison of exact procedures for solving the multiple constrained resource project scheduling problem
    • Patterson, J.H. (1984). A comparison of exact procedures for solving the multiple constrained resource project scheduling problem. Management Science, 30(1), 854-867.
    • (1984) Management Science , vol.30 , Issue.1 , pp. 854-867
    • Patterson, J.H.1
  • 31
    • 0029636114 scopus 로고
    • Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
    • Sprecher, A., Kolisch, R., & Drexl, A. (1995). Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research, 80, 94-102.
    • (1995) European Journal of Operational Research , vol.80 , pp. 94-102
    • Sprecher, A.1    Kolisch, R.2    Drexl, A.3
  • 32
    • 0042746596 scopus 로고    scopus 로고
    • Branch-and-bound algorithms for stochastic resource-constrained project scheduling, No. 702/2000, Germany: Technische Universität Berlin
    • Stork, F. (2000). Branch-and-bound algorithms for stochastic resource-constrained project scheduling (Research Report No. 702/2000). Germany: Technische Universität Berlin.
    • (2000) Research Report
    • Stork, F.1
  • 33
    • 0032210453 scopus 로고    scopus 로고
    • Using tabu search to schedule activities of stochastic resource-constrained projects
    • Tsai, Y.-W., & Gemmill, D.D. (1998). Using tabu search to schedule activities of stochastic resource-constrained projects. European Journal of Operational Research, 111, 129-141.
    • (1998) European Journal of Operational Research , vol.111 , pp. 129-141
    • Tsai, Y.-W.1    Gemmill, D.D.2


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