메뉴 건너뛰기




Volumn 40, Issue 1, 1997, Pages 42-44

A resource constrained project scheduling problem with reattempt at failure: A heuristic approach

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0006515477     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.40.33     Document Type: Article
Times cited : (7)

References (14)
  • 2
    • 0000813734 scopus 로고
    • Optimal project scheduling under multiple resource constraints
    • Davis, E. W. and Heidorn, G. E., Optimal project scheduling under multiple resource constraints, Management Science, Vol. 17(1971)B803-B816.
    • (1971) Management Science , vol.17
    • Davis, E.W.1    Heidorn, G.E.2
  • 4
    • 0002907360 scopus 로고
    • A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
    • Demeulemeester, E. and Herroelen, W., A branch-and-bound procedure for the multiple resource-constrained project scheduling problem, Management Science, Vol. 38(1992) 1803-1818.
    • (1992) Management Science , vol.38 , pp. 1803-1818
    • Demeulemeester, E.1    Herroelen, W.2
  • 5
    • 0026376478 scopus 로고
    • Scheduling of project networks by job assignment
    • Drexl, A., Scheduling of project networks by job assignment, Management Science, Vol. 37(1991)1590-1602.
    • (1991) Management Science , vol.37 , pp. 1590-1602
    • Drexl, A.1
  • 6
    • 0027666457 scopus 로고
    • Nonpreemptive multi-mode resource-constrained project scheduling
    • Drexl, A., and Gruenewald, J., Nonpreemptive multi-mode resource-constrained project scheduling, IIE Transactions, Vol. 25(1993)74-81.
    • (1993) IIE Transactions , vol.25 , pp. 74-81
    • Drexl, A.1    Gruenewald, J.2
  • 9
    • 0025701909 scopus 로고
    • Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems
    • Patterson, J. H., Talbot, F. B., Slowinski, R., and Weglarz, J., Computational experience with a backtracking algorithm for solving a general class of precedence and resource-constrained scheduling problems, European Journal of Operational Research, Vol. 49(1990)68-79.
    • (1990) European Journal of Operational Research , vol.49 , pp. 68-79
    • Patterson, J.H.1    Talbot, F.B.2    Slowinski, R.3    Weglarz, J.4
  • 11
    • 0018011301 scopus 로고
    • Multiple resource-constrained scheduling using branch and bound
    • Stinson, J. P., David, E. W. and Khumawala, B. M., Multiple resource-constrained scheduling using branch and bound, AIIE Transactions, Vol. 10(1978)252-259.
    • (1978) AIIE Transactions , vol.10 , pp. 252-259
    • Stinson, J.P.1    David, E.W.2    Khumawala, B.M.3
  • 12
    • 0020193734 scopus 로고
    • Resource-constrained project scheduling with time-resource tradeoffs: The nonpreemptive case
    • Talbot, F. B., Resource-constrained project scheduling with time-resource tradeoffs: the nonpreemptive case, Management Science, Vol. 28(1982)1197-1210.
    • (1982) Management Science , vol.28 , pp. 1197-1210
    • Talbot, F.B.1
  • 13
    • 0017997005 scopus 로고
    • An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems
    • Talbot, F. B. and Patterson, J. H., An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems, Management Science, Vol. 24(1978)1163-1174.
    • (1978) Management Science , vol.24 , pp. 1163-1174
    • Talbot, F.B.1    Patterson, J.H.2
  • 14
    • 0042010450 scopus 로고
    • A project scheduling model considering the success probability
    • M. Fushimi and K. Tone (eds), World Scientific Publishing Company
    • Tseng, C.C., Mori, M., and Yajima, Y., A project scheduling model considering the success probability, in:M. Fushimi and K. Tone (eds), Proceedings of APORS'94. (World Scientific Publishing Company, 1995)399-406.
    • (1995) Proceedings of APORS'94 , pp. 399-406
    • Tseng, C.C.1    Mori, M.2    Yajima, Y.3


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