메뉴 건너뛰기




Volumn 53, Issue 4, 2002, Pages 405-414

Network decomposition techniques for resource-constrained project scheduling

Author keywords

Allocation; Project management; Resource; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; PROBLEM SOLVING; RESOURCE ALLOCATION;

EID: 0036531774     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601308     Document Type: Article
Times cited : (26)

References (9)
  • 2
    • 0033691202 scopus 로고    scopus 로고
    • Scheduling resource-constrained projects competitively at modest memory requirements
    • Sprecher A (2000). Scheduling resource-constrained projects competitively at modest memory requirements. Mngt Sci 46: 710-723.
    • (2000) Mngt Sci , vol.46 , pp. 710-723
    • Sprecher, A.1
  • 3
    • 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 Res Logist 45: 733-750.
    • (1998) Naval Res Logist , vol.45 , pp. 733-750
    • Hartmann, S.1
  • 4
    • 0001896880 scopus 로고    scopus 로고
    • Adaptive search for solving hard project scheduling problems
    • Kolisch R and Drexl A (1996). Adaptive search for solving hard project scheduling problems. Naval Res Logist 43: 23-40.
    • (1996) Naval Res Logist , vol.43 , pp. 23-40
    • Kolisch, R.1    Drexl, A.2
  • 5
    • 0032736579 scopus 로고    scopus 로고
    • Resource-constrained project scheduling: Notation, classification, model, and methods
    • Brucker P, Drexl A, Mohring R, Neumann K and Pesch E (1999). Resource-constrained project scheduling: notation, classification, model, and methods. Eur J Opl Res 112: 3-41.
    • (1999) Eur J Opl Res , vol.112 , pp. 3-41
    • Brucker, P.1    Drexl, A.2    Mohring, R.3    Neumann, K.4    Pesch, E.5
  • 6
    • 0000480311 scopus 로고
    • An algorithm for a general class of precedence and resource constrained scheduling problems
    • Slowinski R and Weglarz J, Elsevier: Amsterdam
    • Patterson JH, Slowinski R, Talbot FB and Weglarz J (1989). An algorithm for a general class of precedence and resource constrained scheduling problems. In: Slowinski R and Weglarz J (eds). Advances in Project Scheduling. Elsevier: Amsterdam, pp 3-28.
    • (1989) Advances in Project Scheduling , pp. 3-28
    • Patterson, J.H.1    Slowinski, R.2    Talbot, F.B.3    Weglarz, J.4
  • 7
    • 0000698758 scopus 로고
    • Characterization and generation of a general class of resource-constrained project scheduling problems
    • Kolisch R, Sprecher A and Drexl A (1995). Characterization and generation of a general class of resource-constrained project scheduling problems. Mngt Sci 41: 1693-1703.
    • (1995) Mngt Sci , vol.41 , pp. 1693-1703
    • Kolisch, R.1    Sprecher, A.2    Drexl, A.3
  • 8
    • 0030788844 scopus 로고    scopus 로고
    • PSPLIB - a project scheduling problem library
    • Kolisch R and Sprecher A (1996). PSPLIB - a project scheduling problem library. Eur J Opl Res 96: 205-216.
    • (1996) Eur J Opl Res , vol.96 , pp. 205-216
    • Kolisch, R.1    Sprecher, A.2
  • 9
    • 0002030301 scopus 로고    scopus 로고
    • Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis
    • University of Kiel
    • Kolisch R and Hartmann S (1998). Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. Manuskripte aus den Instituten fur Betriebswirtschaftslehre, University of Kiel.
    • (1998) Manuskripte Aus Den Instituten Fur Betriebswirtschaftslehre
    • Kolisch, R.1    Hartmann, S.2


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