메뉴 건너뛰기




Volumn 181, Issue 1, 2007, Pages 86-101

A genetic algorithm for resource investment project scheduling problem, tardiness permitted with penalty

Author keywords

Genetic algorithms; Investment; Project scheduling; Resource

Indexed keywords

GENETIC ALGORITHMS; INVESTMENTS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

EID: 33847297058     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.03.056     Document Type: Article
Times cited : (115)

References (19)
  • 4
    • 0000463458 scopus 로고
    • Minimizing resource availability costs in time limited project networks
    • Demeulemeester E.L. Minimizing resource availability costs in time limited project networks. Management Science 41 (1995) 1590-1598
    • (1995) Management Science , vol.41 , pp. 1590-1598
    • Demeulemeester, E.L.1
  • 5
    • 0002907360 scopus 로고
    • A branch-and-bound procedure for the multiple resource-constrained project scheduling problem
    • Demeulemeester E.L., and 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.L.1    Herroelen, W.2
  • 6
    • 0035280765 scopus 로고    scopus 로고
    • Optimization guided lower & upper bounds for the resource investment problem
    • Drexl A., and Kimms A. Optimization guided lower & upper bounds for the resource investment problem. Journal of the Operational Re search Society 52 (2001) 340-351
    • (2001) Journal of the Operational Re search Society , vol.52 , pp. 340-351
    • Drexl, A.1    Kimms, A.2
  • 7
    • 0032188522 scopus 로고    scopus 로고
    • A competitive genetic algorithm for resource-constrained project scheduling
    • Hartmann S. A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics 45 (1998) 733-750
    • (1998) Naval Research Logistics , vol.45 , pp. 733-750
    • Hartmann, S.1
  • 8
    • 0002866635 scopus 로고
    • The critical path method: Resources planning and scheduling
    • Muth J.F., and Thompson G.L. (Eds), Prentice-Hall, New Jersey
    • Kelley Jr. J.E. The critical path method: Resources planning and scheduling. In: Muth J.F., and Thompson G.L. (Eds). Industrial Scheduling (1963), Prentice-Hall, New Jersey 347-365
    • (1963) Industrial Scheduling , pp. 347-365
    • Kelley Jr., J.E.1
  • 9
    • 33847287533 scopus 로고    scopus 로고
    • Kimms, A., 2002. Personal communication.
  • 10
    • 0030121479 scopus 로고    scopus 로고
    • Serial and parallel resource constrained project scheduling methods revisited: Theory and computation
    • Kolisch R. Serial and parallel resource constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research 90 (1996) 320-333
    • (1996) European Journal of Operational Research , vol.90 , pp. 320-333
    • Kolisch, R.1
  • 11
    • 0002030301 scopus 로고    scopus 로고
    • Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis
    • Weglarz J. (Ed), Kluwer Academic Publishers
    • Kolisch R., and Hartmann S. Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis. In: Weglarz J. (Ed). Project Scheduling: Recent Models, Algorithms and Applications (1999), Kluwer Academic Publishers 147-178
    • (1999) Project Scheduling: Recent Models, Algorithms and Applications , pp. 147-178
    • Kolisch, R.1    Hartmann, S.2
  • 13
    • 0000698758 scopus 로고
    • Characterization and generation of a general class of resource-constrained project scheduling problems
    • Kolisch R., Sprecher A., and Drexl A. Characterization and generation of a general class of resource-constrained project scheduling problems. Management Science 41 (1995) 1693-1703
    • (1995) Management Science , vol.41 , pp. 1693-1703
    • Kolisch, R.1    Sprecher, A.2    Drexl, A.3
  • 14
    • 0021161421 scopus 로고
    • Minimizing costs of resource requirements in project networks subject to a fix completion time
    • Möhring R.H. Minimizing costs of resource requirements in project networks subject to a fix completion time. Operations Research 32 (1984) 89-120
    • (1984) Operations Research , vol.32 , pp. 89-120
    • Möhring, R.H.1
  • 16
    • 0442327390 scopus 로고    scopus 로고
    • The resource renting problem subject to temporal constraints
    • Nübel H. The resource renting problem subject to temporal constraints. OR Spektrum 23 (2001) 574-586
    • (2001) OR Spektrum , vol.23 , pp. 574-586
    • Nübel, H.1
  • 18
    • 33847314399 scopus 로고    scopus 로고
    • Schwindt, C., 1996, Generation of resource constrained scheduling problems with minimal and maximal time lags, Report WIOR-489, Universität Karlsruhe.
  • 19
    • 0029636114 scopus 로고
    • Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem
    • Sprecher A., Kolisch R., and Drexl A. Semi-active, active, and non-delay schedules for the resource-constrained project scheduling problem. European Journal of Operational Research 80 (1995) 94-102
    • (1995) European Journal of Operational Research , vol.80 , pp. 94-102
    • Sprecher, A.1    Kolisch, R.2    Drexl, A.3


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