메뉴 건너뛰기




Volumn 38, Issue 1, 2011, Pages 33-43

A double genetic algorithm for the MRCPSP/max

Author keywords

Genetic algorithm; Maximum time lags; Multi mode case; Resource constrained project scheduling

Indexed keywords

SCHEDULING;

EID: 78049427982     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.09.019     Document Type: Conference Paper
Times cited : (44)

References (25)
  • 1
    • 0034296143 scopus 로고    scopus 로고
    • A time oriented branch and bound algorithm for resource constrained project scheduling with generalised precedence constraints
    • U. Dorndorf, E. Pesch, and T. Phan-Huy A time oriented branch and bound algorithm for resource constrained project scheduling with generalised precedence constraints Management Science Informs 46 2000 1365 1384
    • (2000) Management Science Informs , vol.46 , pp. 1365-1384
    • Dorndorf, U.1    Pesch, E.2    Phan-Huy, T.3
  • 4
    • 0036182335 scopus 로고    scopus 로고
    • A constraint based method for project scheduling with time windows
    • A. Cesta, A. Oddi, and S. Smith A constraint based method for project scheduling with time windows Journal of Heuristics 8 1 2002 109 136
    • (2002) Journal of Heuristics , vol.8 , Issue.1 , pp. 109-136
    • Cesta, A.1    Oddi, A.2    Smith, S.3
  • 5
    • 0038209741 scopus 로고    scopus 로고
    • Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms
    • J. Alcaraz, C. Maroto, and R. Ruiz Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms Journal of the Operational Research Society 54 2003 614 626
    • (2003) Journal of the Operational Research Society , vol.54 , pp. 614-626
    • Alcaraz, J.1    Maroto, C.2    Ruiz, R.3
  • 6
    • 33845270624 scopus 로고    scopus 로고
    • Experimental investigation of heuristics for resource-constrained project scheduling: An update
    • R. Kolisch, and S. Hartmann Experimental investigation of heuristics for resource-constrained project scheduling: an update European Journal of Operational Research 174 2006 23 37
    • (2006) European Journal of Operational Research , vol.174 , pp. 23-37
    • Kolisch, R.1    Hartmann, S.2
  • 9
  • 10
    • 0442269144 scopus 로고    scopus 로고
    • Resource-constrained project scheduling: A heuristic for the multi-mode case
    • R. Heilmann Resource-constrained project scheduling: a heuristic for the multi-mode case OR Spektrum 23 2001 335 357
    • (2001) OR Spektrum , vol.23 , pp. 335-357
    • Heilmann, R.1
  • 11
    • 0037448273 scopus 로고    scopus 로고
    • A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags
    • R. Heilmann A branch-and-bound procedure for the multi-mode resource-constrained project scheduling problem with minimum and maximum time lags European Journal of Operational Research 144 2003 348 365
    • (2003) European Journal of Operational Research , vol.144 , pp. 348-365
    • Heilmann, R.1
  • 12
    • 34250094949 scopus 로고
    • Scheduling project networks with resource constraints and time windows
    • M. Bartusch, R. Mhring, and F.J. Radermacher Scheduling project networks with resource constraints and time windows Annals of Operations Research 16 1988 201 240
    • (1988) Annals of Operations Research , vol.16 , pp. 201-240
    • Bartusch, M.1    Mhring, R.2    Radermacher, F.J.3
  • 13
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • R. Tarjan Depth-first search and linear graph algorithms SIAM Journal on Computing 1 1972 146 160
    • (1972) SIAM Journal on Computing , vol.1 , pp. 146-160
    • Tarjan, R.1
  • 17
    • 0035612930 scopus 로고    scopus 로고
    • Project Scheduling with Multiple Modes: A Genetic Algorithm
    • DOI 10.1023/A:1010902015091
    • S. Hartmann Project scheduling with multiple modes: a genetic algorithm Annals of Operations Research 102 2001 111 135 (Pubitemid 33634389)
    • (2001) Annals of Operations Research , vol.102 , Issue.1-4 , pp. 111-135
    • Hartmann, S.1
  • 20
    • 0026376478 scopus 로고
    • Scheduling of project networks by job assignment
    • A. Drexl Scheduling of project networks by job assignment Management Science 37 1991 1590 1602
    • (1991) Management Science , vol.37 , pp. 1590-1602
    • Drexl, A.1
  • 21
    • 0033311742 scopus 로고    scopus 로고
    • The multi-mode resource-constrained project scheduling problem with generalized precedence relations
    • B. De Reyck, and W. Herroelen 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
  • 22
    • 69849096635 scopus 로고    scopus 로고
    • An evolutionary algorithm for the resource-constrained project scheduling problem subject to temporal constraints
    • Poznan, Poland; April 26-28
    • Valls V, Ballestín F, Barrios A. An evolutionary algorithm for the resource-constrained project scheduling problem subject to temporal constraints. In: Tenth international workshop in project management and scheduling. Poznan, Poland; April 2628, 2006.
    • (2006) Tenth International Workshop in Project Management and Scheduling
    • Valls, V.1    Ballestín, F.2    Barrios, A.3
  • 23
    • 0035617605 scopus 로고    scopus 로고
    • A Competitive Heuristic Solution Technique for Resource-Constrained Project Scheduling
    • DOI 10.1023/A:1010997814183
    • P. Tormos, and A. Lova A competitive heuristic solution technique for resource-constrained project scheduling Annals of Operations Research 102 2001 65 81 (Pubitemid 33634387)
    • (2001) Annals of Operations Research , vol.102 , Issue.1-4 , pp. 65-81
    • Tormos, P.1    Lova, A.2
  • 25
    • 0011006529 scopus 로고    scopus 로고
    • Generation of resource-constrained project scheduling problems subject to temporal constraints
    • University of Karlsruhe
    • Schwindt, C. Generation of resource-constrained project scheduling problems subject to temporal constraints. Report WIOR543, University of Karlsruhe, 1998.
    • (1998) Report WIOR-543
    • Schwindt, C.1


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