메뉴 건너뛰기




Volumn 58, Issue 2, 2011, Pages 73-82

A genetic algorithm with neighborhood search for the resource-constrained project scheduling problem

Author keywords

genetic algorithm; neighborhood search; resource constrained project scheduling problem

Indexed keywords

COMPUTATIONAL TIME; GA OPERATORS; LOCAL SEARCH STRATEGY; MAKESPAN; NEIGHBORHOOD SEARCH; NON-PREEMPTIVE; NUMERICAL EXPERIMENTS; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; SOLUTION QUALITY; SOLUTION SPACE;

EID: 79951905049     PISSN: 0894069X     EISSN: 15206750     Source Type: Journal    
DOI: 10.1002/nav.20439     Document Type: Article
Times cited : (39)

References (30)
  • 1
    • 0002030301 scopus 로고    scopus 로고
    • Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis
    • in, J. Weglarz (Editor), Kluwer Academic Publishers, Berlin, pp.
    • R. Kolisch, and, S. Hartmann, "Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis," in Project scheduling: Recent models, algorithms and applications, J. Weglarz, (Editor), Kluwer Academic Publishers, Berlin, 1999, pp. 147-178.
    • (1999) Project Scheduling: Recent Models, Algorithms and Applications , pp. 147-178
    • Kolisch, R.1    Hartmann, S.2
  • 3
    • 0019342681 scopus 로고
    • Scheduling subject to resource constraints: Classification and complexity
    • J. Błazewicz, J. Lenstra, and, A. Rinnooy Kan, Scheduling subject to resource constraints: Classification and complexity, Discrete Appl Math, 5 (1983), 11-24.
    • (1983) Discrete Appl Math , vol.5 , pp. 11-24
    • Błazewicz, J.1    Lenstra, J.2    Rinnooy Kan, A.3
  • 6
    • 0000801563 scopus 로고    scopus 로고
    • An integrated survey of deterministic project scheduling
    • DOI 10.1016/S0305-0483(00)00046-3, PII S0305048300000463
    • R. Kolisch, and, R. Padman, An integrated survey of deterministic project scheduling, OMEGA Int J Manage Sci, 29 (2001), 249-272. (Pubitemid 33662608)
    • (2001) Omega , vol.29 , Issue.3 , pp. 249-272
    • Kolisch, R.1    Padman, R.2
  • 7
    • 0034559432 scopus 로고    scopus 로고
    • Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
    • S. Hartmann, and, R. Kolisch, Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem, Eur J Oper Res, 127 (2000), 394-340.
    • (2000) Eur J Oper Res , vol.127 , pp. 394-340
    • Hartmann, S.1    Kolisch, R.2
  • 8
    • 33845270624 scopus 로고    scopus 로고
    • Experimental investigation of heuristics for resource-constrained project scheduling: An update
    • DOI 10.1016/j.ejor.2005.01.065, PII S0377221705002596
    • R. Kolisch, and, S. Hartmann, Experimental investigation of heuristics for resource-constrained project scheduling: An update, Eur J Oper Res, 174 (2006), 23-37. (Pubitemid 44866841)
    • (2006) European Journal of Operational Research , vol.174 , Issue.1 , pp. 23-37
    • Kolisch, R.1    Hartmann, S.2
  • 9
    • 0030788844 scopus 로고    scopus 로고
    • PSPLIB - A project scheduling problem library or Software - ORSEP Operations Research Software Exchange Program
    • R. Kolisch, and, A. Sprecher, PSPLIB - A project scheduling problem library OR Software - ORSEP Operations Research Software Exchange Program, Eur J Oper Res, 96 (1996), 205-216.
    • (1996) Eur J Oper Res , vol.96 , pp. 205-216
    • Kolisch, R.1    Sprecher, A.2
  • 11
    • 4444294743 scopus 로고    scopus 로고
    • LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search
    • DOI 10.1023/B:ANOR.0000039521.26237.62, Meta-Heuristics - Theory, Applications and Software
    • M. Palpant, C. Artigues, and, P. Michelon, LSSPER: Solving the resource-constrained project scheduling problem with large neighborhood search, Ann Oper Res, 131 (2004), 237-257. (Pubitemid 39187382)
    • (2004) Annals of Operations Research , vol.131 , Issue.1-4 , pp. 237-257
    • Palpant, M.1    Artigues, C.2    Michelon, P.3
  • 12
    • 0030121479 scopus 로고    scopus 로고
    • Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
    • R. Kolisch, Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation, Eur J Oper Res, 90 (1996), 320-333. (Pubitemid 126652217)
    • (1996) European Journal of Operational Research , vol.90 , Issue.2 , pp. 320-333
    • Kolisch, R.1
  • 13
    • 0032709489 scopus 로고    scopus 로고
    • Computing lower bound by destructive improvement: An application to resource-constrained project scheduling problem
    • R. Klein, and, A. Scholl, Computing lower bound by destructive improvement: an application to resource-constrained project scheduling problem, Eur J Oper Res, 112 (1999), 322-346.
    • (1999) Eur J Oper Res , vol.112 , pp. 322-346
    • Klein, R.1    Scholl, A.2
  • 14
    • 0000698758 scopus 로고
    • Characterization and generation of a general class of resource-constrained project scheduling problems
    • R. Kolisch, A. Sprecher, and, A. Drexl, Characterization and generation of a general class of resource-constrained project scheduling problems, Manage Sci, 41 (1995), 1693-1703.
    • (1995) Manage Sci , vol.41 , pp. 1693-1703
    • Kolisch, R.1    Sprecher, A.2    Drexl, A.3
  • 16
    • 25444456205 scopus 로고    scopus 로고
    • A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
    • DOI 10.1016/j.ejor.2004.08.020, PII S0377221704005594, Feature Cluster on Scatter Search Methods for Optimization
    • D. Debels, B.R. De Reyck Leus, and, M. Vanhoucke, A hybrid scatter search/Electromagnetism meta-heuristic for project scheduling, Eur J Oper Res, 169 (2006), 638-653. (Pubitemid 41375712)
    • (2006) European Journal of Operational Research , vol.169 , Issue.2 , pp. 638-653
    • Debels, D.1    De Reyck, B.2    Leus, R.3    Vanhoucke, M.4
  • 17
    • 38549091692 scopus 로고    scopus 로고
    • A decomposition-based genetic algorithm for the resource-constrained project-scheduling problem
    • DOI 10.1287/opre.1060.0358
    • D. Debels, and, M. Vanhoucke, Decomposition-based genetic algorithm for the resource-constrained project-scheduling problem, Oper Res, 55 (2007), 457-469. (Pubitemid 351159503)
    • (2007) Operations Research , vol.55 , Issue.3 , pp. 457-469
    • Debels, D.1    Vanhoucke, M.2
  • 18
    • 34648837872 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the resource-constrained project scheduling problem
    • DOI 10.1016/j.ejor.2006.12.033, PII S0377221707000616
    • V. Valls, F. Ballestin, and, M.S. Quintanilla, A hybrid genetic algorithm for the resource-constrained project scheduling problem, Eur J Oper Res, 185 (2008), 495-508. (Pubitemid 47454671)
    • (2008) European Journal of Operational Research , vol.185 , Issue.2 , pp. 495-508
    • Valls, V.1    Ballestin, F.2    Quintanilla, S.3
  • 19
    • 13444257593 scopus 로고    scopus 로고
    • Justification and RCPSP: A technique that pays
    • DOI 10.1016/j.ejor.2004.04.008, PII S0377221704002462, Project Management and Scheduling
    • V. Valls, F. Ballestin, and, M.S. Quintanilla, Justification and RCPSP: A technique that pays, Eur J Oper Res, 165 (2005), 375-386. (Pubitemid 40206368)
    • (2005) European Journal of Operational Research , vol.165 , Issue.2 , pp. 375-386
    • Valls, V.1    Ballestin, F.2    Quintanilla, S.3
  • 20
    • 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, Ann Oper Res, 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
  • 21
    • 0036684673 scopus 로고    scopus 로고
    • A self-adapting genetic algorithm for project scheduling under resource constraints
    • DOI 10.1002/nav.10029
    • S. Hartmann, A self-adapting genetic algorithm for project scheduling under resource constraints, Nav Res Logist, 49 (2002), 433-448. (Pubitemid 34878877)
    • (2002) Naval Research Logistics , vol.49 , Issue.5 , pp. 433-448
    • Hartmann, S.1
  • 22
    • 0032188522 scopus 로고    scopus 로고
    • A competitive genetic algorithm for resource-constrained project scheduling
    • S. Hartmann, A competitive genetic algorithm for resource-constrained project scheduling, Nav Res Logist, 45 (1998), 733-750. (Pubitemid 128587349)
    • (1998) Naval Research Logistics , vol.45 , Issue.7 , pp. 733-750
    • Hartmann, S.1
  • 23
    • 0037508562 scopus 로고    scopus 로고
    • A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple modes version
    • K. Bouleimen, and, H. Lecocq, A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple modes version, Eur J Oper Res, 149 (2003), 268-281.
    • (2003) Eur J Oper Res , vol.149 , pp. 268-281
    • Bouleimen, K.1    Lecocq, H.2
  • 24
    • 24944581849 scopus 로고    scopus 로고
    • Comparative analysis of metaheuristics for the resource constrained project scheduling problem
    • Instituto Superior Tecnico, Portugal
    • J. Coelho, and, L. Tavares, Comparative analysis of metaheuristics for the resource constrained project scheduling problem, Technical report, Department of Civil Engineering, Instituto Superior Tecnico, Portugal, 2003.
    • (2003) Technical Report, Department of Civil Engineering
    • Coelho, J.1    Tavares, L.2
  • 25
    • 0001896880 scopus 로고    scopus 로고
    • Adaptive search for solving hard project scheduling problems
    • R. Kolisch, and, A. Drexl, Adaptive search for solving hard project scheduling problems, Nav Res Logist, 43 (1996), 23-40. (Pubitemid 126568742)
    • (1996) Naval Research Logistics , vol.43 , Issue.1 , pp. 23-40
    • Kolisch, R.1    Drexl, A.2
  • 26
    • 0030231487 scopus 로고    scopus 로고
    • Efficient priority rules for the resource-constrained project scheduling problem
    • DOI 10.1016/0272-6963(95)00032-1
    • R. Kolisch, Efficient priority rules for the resource constrained project scheduling problem, J Oper Manage, 14 (1996), 179-192. (Pubitemid 126365433)
    • (1996) Journal of Operations Management , vol.14 , Issue.3 , pp. 179-192
    • Kolisch, R.1
  • 28
    • 33845274958 scopus 로고
    • Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling
    • V.J. Leon, and, B. Ramamoorthy, Strength and adaptability of problem-space based neighborhoods for resource-constrained scheduling, OR Spectrum, 17 (1995), 173-182.
    • (1995) OR Spectrum , vol.17 , pp. 173-182
    • Leon, V.J.1    Ramamoorthy, B.2
  • 29
    • 4444364098 scopus 로고    scopus 로고
    • A population-based approach to the resource-constrained project scheduling problem
    • DOI 10.1023/B:ANOR.0000039524.09792.c9, Meta-Heuristics - Theory, Applications and Software
    • V. Valls, F. Ballestin, and, M.S. Quintanilla, A population based approach to the resource-constrained project scheduling problem, Ann Oper Res, 131 (2004), 305-324. (Pubitemid 39187385)
    • (2004) Annals of Operations Research , vol.131 , Issue.1-4 , pp. 305-324
    • Valls, V.1    Ballestin, F.2    Quintanilla, S.3
  • 30
    • 0036531774 scopus 로고    scopus 로고
    • Network decomposition techniques for resource-constrained project scheduling
    • DOI 10.1057/palgrave/jors/2601308
    • A. Sprecher, Network decomposition techniques for resource-constrained project scheduling, J Oper Res Soc, 53 (2002), 405-414. (Pubitemid 34410650)
    • (2002) Journal of the Operational Research Society , vol.53 , Issue.4 , pp. 405-414
    • Sprecher, A.1


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