메뉴 건너뛰기




Volumn 144, Issue 2, 2003, Pages 348-365

A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags

Author keywords

Branch and bound; Maximum time lags; Multi mode; Project management and scheduling; Resource constrained

Indexed keywords

APPROXIMATION THEORY; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING; STRATEGIC PLANNING;

EID: 0037448273     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00136-4     Document Type: Article
Times cited : (111)

References (26)
  • 2
    • 0032096810 scopus 로고    scopus 로고
    • A branch and bound algorithm for the resource-constrained project scheduling problem
    • Brucker P., Knust S., Schoo A., Thiele O. A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research. 107:1998;272-288.
    • (1998) European Journal of Operational Research , vol.107 , pp. 272-288
    • Brucker, P.1    Knust, S.2    Schoo, A.3    Thiele, O.4
  • 4
    • 0000165767 scopus 로고
    • An algorithm for solving the jop-shop problem
    • Carlier J., Pinson E. An algorithm for solving the jop-shop problem. Management Science. 35:1989;164-176.
    • (1989) Management Science , vol.35 , pp. 164-176
    • Carlier, J.1    Pinson, E.2
  • 5
    • 0002907360 scopus 로고
    • A branch and bound procedure for the multiple resource-constrained project scheduling problem
    • Demeulemeester E., Herroelen W. A branch and bound procedure for the multiple resource-constrained project scheduling problem. Management Science. 38:1992;1803-1818.
    • (1992) Management Science , vol.38 , pp. 1803-1818
    • Demeulemeester, E.1    Herroelen, W.2
  • 7
    • 0033311742 scopus 로고    scopus 로고
    • The multi-mode resource-constrained project scheduling problem with generalized precedence relations
    • De Reyck B., Herroelen W. The multi-mode resource-constrained project scheduling problem with generalized precedence relations. European Journal of Operational Research. 119:1999;538-556.
    • (1999) European Journal of Operational Research , vol.119 , pp. 538-556
    • De Reyck, B.1    Herroelen, W.2
  • 8
    • 0034296143 scopus 로고    scopus 로고
    • A time-oriented branch-and-bound algorithm for project scheduling with generalised precedence constraints
    • Dorndorf U., Pesch E., Toàn P.H. A time-oriented branch-and-bound algorithm for project scheduling with generalised precedence constraints. Management Science. 46:2000;1365-1384.
    • (2000) Management Science , vol.46 , pp. 1365-1384
    • Dorndorf, U.1    Pesch, E.2    Toàn, P.H.3
  • 15
    • 0011055183 scopus 로고    scopus 로고
    • A heuristic for the multi-mode project scheduling problem based on Bender's decomposition
    • Wȩglarz, J. (Ed.). Kluwer, Boston
    • Maniezzo V., Mingozzi A. A heuristic for the multi-mode project scheduling problem based on Bender's decomposition. Wȩglarz J. Project Scheduling: Recent Models, Algorithms and Applications. 1999;179-196 Kluwer, Boston.
    • (1999) Project Scheduling: Recent Models, Algorithms and Applications , pp. 179-196
    • Maniezzo, V.1    Mingozzi, A.2
  • 16
    • 0038188877 scopus 로고    scopus 로고
    • Resource constrained project scheduling with time windows: A branching scheme based on dynamic release dates
    • Fachbereich Mathematik, Technical University of Berlin
    • Möhring, R., Stork, F., Uetz, M., 1998. Resource constrained project scheduling with time windows: A branching scheme based on dynamic release dates. Arbeitspapier 596, Fachbereich Mathematik, Technical University of Berlin.
    • (1998) Arbeitspapier , vol.596
    • Möhring, R.1    Stork, F.2    Uetz, M.3
  • 24
    • 0032096811 scopus 로고    scopus 로고
    • Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
    • Sprecher A., Drexl A. Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm. European Journal of Operational Research. 107:1998;431-450.
    • (1998) European Journal of Operational Research , vol.107 , pp. 431-450
    • Sprecher, A.1    Drexl, A.2
  • 25
    • 33746101954 scopus 로고    scopus 로고
    • An exact algorithm for project scheduling with multiple modes
    • Sprecher A., Hartmann S., Drexl A. An exact algorithm for project scheduling with multiple modes. OR Spektrum. 19:1997;195-203.
    • (1997) OR Spektrum , vol.19 , pp. 195-203
    • Sprecher, A.1    Hartmann, S.2    Drexl, A.3
  • 26
    • 0011016744 scopus 로고    scopus 로고
    • Multi-modal project scheduling with generalized precedence constraints
    • Istanbul
    • Van Hove J.C., Deckro R. Multi-modal project scheduling with generalized precedence constraints. Proceedings of the PMS Workshop, Istanbul. 1998;137-140.
    • (1998) Proceedings of the PMS Workshop , pp. 137-140
    • Van Hove, J.C.1    Deckro, R.2


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