메뉴 건너뛰기




Volumn 52, Issue 3, 2000, Pages 467-488

Progress: Optimally solving the generalized resource-constrained project scheduling problem

Author keywords

Branch and Bound; Resource Constrained Project Scheduling

Indexed keywords


EID: 0345893880     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860000093     Document Type: Article
Times cited : (17)

References (27)
  • 1
    • 0003131416 scopus 로고    scopus 로고
    • Tabu-search algorithms for the resource-constrained project scheduling problem
    • Voß S, Martello S, Osman I, Roucairol C (eds) Kluwer, Boston
    • Baar T, Brucker P, Knust S (1998) Tabu-search algorithms for the resource-constrained project scheduling problem. In: Voß S, Martello S, Osman I, Roucairol C (eds) Metaheuristics: Advances and trends in local search paradigms. Kluwer, Boston, 1-18
    • (1998) Metaheuristics: Advances and Trends in Local Search Paradigms , pp. 1-18
    • Baar, T.1    Brucker, P.2    Knust, S.3
  • 5
    • 0002907360 scopus 로고
    • A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
    • Demeulemeester E, Herroelen W (1992) A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Science 38:1803-1818
    • (1992) Management Science , vol.38 , pp. 1803-1818
    • Demeulemeester, E.1    Herroelen, W.2
  • 6
    • 0031097802 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for the generalized resource-constrained project scheduling problem
    • Demeulemeester E, Herroelen W (1997) A branch-and-bound algorithm for the generalized resource-constrained project scheduling problem. Operations Research 45:201-211
    • (1997) Operations Research , vol.45 , pp. 201-211
    • Demeulemeester, E.1    Herroelen, W.2
  • 7
    • 0031272722 scopus 로고    scopus 로고
    • New benchmark results for the resource-constrained project scheduling problem
    • Demeulemeester E, Herroelen W (1997) New benchmark results for the resource-constrained project scheduling problem. Management Science 43:1485-1492
    • (1997) Management Science , vol.43 , pp. 1485-1492
    • Demeulemeester, E.1    Herroelen, W.2
  • 11
    • 0347225292 scopus 로고    scopus 로고
    • Project scheduling with time-varying resource constraints
    • To appear
    • Klein R (1999) Project scheduling with time-varying resource constraints. To appear in: International Journal of Production Research
    • (1999) International Journal of Production Research
    • Klein, R.1
  • 13
    • 0032709489 scopus 로고    scopus 로고
    • Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling
    • Klein R, Scholl A (1999) Computing lower bounds by destructive improvement: An application to resource-constrained project scheduling. European Journal of Operational Research 112:322-346
    • (1999) European Journal of Operational Research , vol.112 , pp. 322-346
    • Klein, R.1    Scholl, A.2
  • 15
    • 0012889212 scopus 로고    scopus 로고
    • An integrated survey of project scheduling - Models, algorithms, problems, and applications
    • To appear
    • Kolisch R, Padman R (1997) An integrated survey of project scheduling - Models, algorithms, problems, and applications. To appear in OMEGA
    • (1997) OMEGA
    • Kolisch, R.1    Padman, R.2
  • 17
    • 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
  • 18
    • 84985846616 scopus 로고
    • Efficient modular implementation of branch-and-bound algorithms
    • Johnson RV (1988) Efficient modular implementation of branch-and-bound algorithms. Decision Sciences 19:17-38
    • (1988) Decision Sciences , vol.19 , pp. 17-38
    • Johnson, R.V.1
  • 19
    • 0012887962 scopus 로고    scopus 로고
    • An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation
    • Mingozzi A, Maniezzo V, Ricciardelli S, Bianco L (1998) An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Management Science 44:725-729
    • (1998) Management Science , vol.44 , pp. 725-729
    • Mingozzi, A.1    Maniezzo, V.2    Ricciardelli, S.3    Bianco, L.4
  • 20
    • 0021460636 scopus 로고
    • A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem
    • Patterson JH (1984) A comparison of exact approaches for solving the multiple constrained resource, project scheduling problem. Management Science 30:854-867
    • (1984) Management Science , vol.30 , pp. 854-867
    • Patterson, J.H.1
  • 22
    • 0030105481 scopus 로고    scopus 로고
    • A multiple-tree search procedure for the resource-constrained project scheduling problem
    • Simpson WP, Patterson JH (1996) A multiple-tree search procedure for the resource-constrained project scheduling problem. European Journal of Operational Research 89:525-542
    • (1996) European Journal of Operational Research , vol.89 , pp. 525-542
    • Simpson, W.P.1    Patterson, J.H.2
  • 23
    • 0033691202 scopus 로고    scopus 로고
    • Solving the RCPSP efficiently at modest memory requirements
    • Sprecher A (2000) Solving the RCPSP efficiently at modest memory requirements. Management Science 46:710-723
    • (2000) Management Science , vol.46 , pp. 710-723
    • Sprecher, A.1
  • 24
    • 0032689003 scopus 로고    scopus 로고
    • Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling
    • Sprecher A, Drexl A (1999) Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling. Management Science 45:452-454
    • (1999) Management Science , vol.45 , pp. 452-454
    • Sprecher, A.1    Drexl, A.2
  • 25
    • 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
  • 26
    • 0018011301 scopus 로고
    • Multiple resource-constrained scheduling using branch and bound
    • Stinson JP, Davis EW, Khumawala BM (1978) Multiple resource-constrained scheduling using branch and bound. AIIE Transactions 10:252-259
    • (1978) AIIE Transactions , vol.10 , pp. 252-259
    • Stinson, J.P.1    Davis, E.W.2    Khumawala, B.M.3
  • 27
    • 0017997005 scopus 로고
    • An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems
    • Talbot FB, Patterson JH (1978) An efficient integer programming algorithm with network cuts for solving resource-constrained scheduling problems. Management Science 24:1163-1175
    • (1978) Management Science , vol.24 , pp. 1163-1175
    • Talbot, F.B.1    Patterson, J.H.2


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