메뉴 건너뛰기




Volumn 17, Issue 5, 2011, Pages 467-486

A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem

Author keywords

Forward backward improvement; Genetic algorithms; Project management; Random keys; Resource constrained project scheduling problem; Scheduling

Indexed keywords

ACTIVE SCHEDULES; COMPUTATIONAL RESULTS; FORWARD-BACKWARD IMPROVEMENT; RANDOM KEYS; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; STANDARD PROBLEMS;

EID: 80053573347     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-010-9142-2     Document Type: Article
Times cited : (76)

References (66)
  • 1
    • 0001849846 scopus 로고
    • Heuristic algorithms for resource-constrained project scheduling: A review and empirical analysis
    • R. Slowinski J. Weglarz (eds). Elsevier Amsterdam
    • Alvarez-Valdez, R., Tamarit, J.M.: Heuristic algorithms for resource-constrained project scheduling: a review and empirical analysis. In: Slowinski, R., Weglarz, J. (eds.) Advances in Project Scheduling, pp. 113-134. Elsevier, Amsterdam (1989)
    • (1989) Advances in Project Scheduling , pp. 113-134
    • Alvarez-Valdez, R.1    Tamarit, J.M.2
  • 2
    • 0003131416 scopus 로고    scopus 로고
    • Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem
    • S. Voss S. Martello I. Osman C. Roucairol (eds). Kluwer Dordrecht
    • Baar, T., Brucker, P., Knust, S.: Tabu-search algorithms and lower bounds for the resource-constrained project scheduling problem. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search paradigms for optimization, pp. 1-8. Kluwer, Dordrecht (1998)
    • (1998) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , pp. 1-8
    • Baar, T.1    Brucker, P.2    Knust, S.3
  • 3
    • 0001096735 scopus 로고
    • Genetics and random keys for sequencing and optimization
    • 0807.90060
    • J.C. Bean 1994 Genetics and random keys for sequencing and optimization ORSA J. Comput. 6 154 160 0807.90060
    • (1994) ORSA J. Comput. , vol.6 , pp. 154-160
    • Bean, J.C.1
  • 4
    • 0019342681 scopus 로고
    • Scheduling subject to resource constraints: Classification and complexity
    • 678815 0516.68037 10.1016/0166-218X(83)90012-4
    • J. Blazewicz J.K. Lenstra A.H.G. Rinnooy Kan 1983 Scheduling subject to resource constraints: classification and complexity Discrete Appl. Math. 5 11 24 678815 0516.68037 10.1016/0166-218X(83)90012-4
    • (1983) Discrete Appl. Math. , vol.5 , pp. 11-24
    • Blazewicz, J.1    Lenstra, J.K.2    Rinnooy Kan, A.H.G.3
  • 5
    • 0025701919 scopus 로고
    • Some efficient multi-heuristic procedures for resource-constrained project scheduling
    • DOI 10.1016/0377-2217(90)90116-S
    • F.F. Boctor 1990 Some efficient multi-heuristic procedures for resource-constrained project scheduling Eur. J. Oper. Res. 49 3 13 10.1016/0377-2217(90)90116-S (Pubitemid 21701442)
    • (1990) European Journal of Operational Research , vol.49 , Issue.1 , pp. 3-13
    • Boctor Fayez, F.1
  • 6
    • 0030216966 scopus 로고    scopus 로고
    • Resource-constrained project scheduling by simulated annealing
    • F.F. Boctor 1996 An adaptation of the simulated annealing algorithm for solving resource-constrained project scheduling problems Int. J. Prod. Res. 34 2335 2351 0930.90041 10.1080/00207549608905028 (Pubitemid 126525300)
    • (1996) International Journal of Production Research , vol.34 , Issue.8 , pp. 2335-2351
    • Boctor, F.F.1
  • 7
    • 0037508562 scopus 로고    scopus 로고
    • A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version
    • 1993132 1040.90015 10.1016/S0377-2217(02)00761-0
    • K. Bouleimen H. Lecocq 2003 A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version Eur. J. Oper. Res. 149 268 281 1993132 1040.90015 10.1016/S0377-2217(02) 00761-0
    • (2003) Eur. J. Oper. Res. , vol.149 , pp. 268-281
    • Bouleimen, K.1    Lecocq, H.2
  • 8
    • 0038183863 scopus 로고    scopus 로고
    • Lower bounds for resource-constrained project scheduling problems
    • 1993134 1036.90038 10.1016/S0377-2217(02)00762-2
    • P. Brucker S. Knust 2003 Lower bounds for resource-constrained project scheduling problems Eur. J. Oper. Res. 149 302 313 1993134 1036.90038 10.1016/S0377-2217(02)00762-2
    • (2003) Eur. J. Oper. Res. , vol.149 , pp. 302-313
    • Brucker, P.1    Knust, S.2
  • 10
    • 0032096810 scopus 로고    scopus 로고
    • A branch and bound algorithm for the resource-constrained project scheduling problem
    • PII S0377221797003354
    • P. Brucker S. Knust A. Schoo O. Thiele 1998 A branch and bound algorithm for the resource-constrained project scheduling problem Eur. J. Oper. Res. 107 272 288 0970.90030 10.1016/S0377-2217(97)00335-4 (Pubitemid 128407543)
    • (1998) European Journal of Operational Research , vol.107 , Issue.2 , pp. 272-288
    • Brucker, P.1    Knust, S.2    Schoo, A.3    Thiele, O.4
  • 11
    • 0034563615 scopus 로고    scopus 로고
    • A linear programming and constraint propagation-based lower bound for the RCPSP
    • 0990.90055 10.1016/S0377-2217(99)00489-0
    • P. Brucker S. Knust 2000 A linear programming and constraint propagation-based lower bound for the RCPSP Eur. J. Oper. Res. 127 355 362 0990.90055 10.1016/S0377-2217(99)00489-0
    • (2000) Eur. J. Oper. Res. , vol.127 , pp. 355-362
    • Brucker, P.1    Knust, S.2
  • 12
    • 23244433221 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing
    • DOI 10.1002/net.20070
    • L.S. Buriol M.G.C. Resende C.C. Ribeiro M. Thorup 2005 A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing Networks 46 1 36 56 2151242 1072.90528 10.1002/net.20070 (Pubitemid 41092975)
    • (2005) Networks , vol.46 , Issue.1 , pp. 36-56
    • Buriol, L.S.1    Resende, M.G.C.2    Ribeiro, C.C.3    Thorup, M.4
  • 13
    • 0016972372 scopus 로고
    • Heuristics for scheduling resource-constrained projects: An experimental investigation
    • 0326.90029 10.1287/mnsc.22.11.1186
    • D.F. Cooper 1976 Heuristics for scheduling resource-constrained projects: an experimental investigation Manag. Sci. 22 1186 1194 0326.90029 10.1287/mnsc.22.11.1186
    • (1976) Manag. Sci. , vol.22 , pp. 1186-1194
    • Cooper, D.F.1
  • 14
    • 0043114396 scopus 로고
    • A note on serial and parallel heuristics for resource-constrained project scheduling
    • 0372.90061
    • D.F. Cooper 1977 A note on serial and parallel heuristics for resource-constrained project scheduling Found. Control Eng. 2 131 133 0372.90061
    • (1977) Found. Control Eng. , vol.2 , pp. 131-133
    • Cooper, D.F.1
  • 15
    • 0016498438 scopus 로고
    • A comparison of heuristic and optimum solutions in resource-constrained project scheduling
    • 10.1287/mnsc.21.8.944
    • E.W. Davis J.H. Patterson 1975 A comparison of heuristic and optimum solutions in resource-constrained project scheduling Manag. Sci. 21 944 955 10.1287/mnsc.21.8.944
    • (1975) Manag. Sci. , vol.21 , pp. 944-955
    • Davis, E.W.1    Patterson, J.H.2
  • 17
    • 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. De Reyck R. Leus M. Vanhoucke 2006 A hybrid scatter search/electromagnetism meta-heuristic for project scheduling Eur. J. Oper. Res. 169 638 653 2172364 1079.90051 10.1016/j.ejor.2004.08.020 (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
  • 18
    • 14644400388 scopus 로고    scopus 로고
    • Constraint-propagation-based cutting planes: An application to the resource-constrained project scheduling problem
    • DOI 10.1287/ijoc.1030.0043
    • S. Demassey C. Artigues P. Michelon 2005 Constraint-propagation-base cutting planes: an application to the resource-constrained project scheduling problem INFORMS J. Comput. 17 52 65 2129806 10.1287/ijoc.1030.0043 (Pubitemid 40308569)
    • (2005) INFORMS Journal on Computing , vol.17 , Issue.1 , pp. 52-65
    • Demassey, S.1    Artigues, C.2    Michelon, P.3
  • 19
    • 0031272722 scopus 로고    scopus 로고
    • New benchmark results for the resource-constrained project scheduling problem
    • E. Demeulemeester W. Herroelen 1997 New benchmark results for the resource-constrained project scheduling problem Manag. Sci. 43 1485 1492 0914.90160 10.1287/mnsc.43.11.1485 (Pubitemid 127606206)
    • (1997) Management Science , vol.43 , Issue.11 , pp. 1485-1492
    • Demeulemeester, E.L.1    Herroelen, W.S.2
  • 22
    • 1642436954 scopus 로고    scopus 로고
    • Solving the resource-constrained project scheduling problem by a variable neighbourhood search
    • 2054701 1045.90028 10.1016/S0377-2217(02)00884-6
    • K. Fleszar K.S. Hindi 2004 Solving the resource-constrained project scheduling problem by a variable neighbourhood search Eur. J. Oper. Res. 155 402 413 2054701 1045.90028 10.1016/S0377-2217(02)00884-6
    • (2004) Eur. J. Oper. Res. , vol.155 , pp. 402-413
    • Fleszar, K.1    Hindi, K.S.2
  • 25
    • 34447106676 scopus 로고    scopus 로고
    • A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
    • DOI 10.1016/j.ejor.2005.11.062, PII S0377221706003006
    • J.F. Gonçalves 2007 A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem Eur. J. Oper. Res. 183 1212 1229 1136.90414 10.1016/j.ejor.2005.11.062 (Pubitemid 47030736)
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1212-1229
    • Goncalves, J.F.1
  • 26
    • 0036845392 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for assembly line balancing
    • DOI 10.1023/A:1020377910258
    • J.F. Gonçalves J.R. Almeida 2002 A hybrid genetic algorithm for assembly line balancing J. Heuristics 8 629 642 10.1023/A:1020377910258 (Pubitemid 35338030)
    • (2002) Journal of Heuristics , vol.8 , Issue.6 , pp. 629-642
    • Goncalves, J.F.1    De Almeida, J.R.2
  • 27
    • 6344291696 scopus 로고    scopus 로고
    • An evolutionary algorithm for manufacturing cell formation
    • 10.1016/j.cie.2004.07.003
    • J.F. Gonçalves M.G.C. Resende 2004 An evolutionary algorithm for manufacturing cell formation Comput. Ind. Eng. 47 247 273 10.1016/j.cie.2004.07. 003
    • (2004) Comput. Ind. Eng. , vol.47 , pp. 247-273
    • Gonçalves, J.F.1    Resende, M.G.C.2
  • 30
    • 0032188522 scopus 로고    scopus 로고
    • A competitive genetic algorithm for resource-constrained project scheduling
    • 1643514 10.1002/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2- C
    • S. Hartmann 1998 A competitive genetic algorithm for resource-constrained project scheduling Nav. Res. Logist. 45 279 302 1643514 10.1002/(SICI)1520- 6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C
    • (1998) Nav. Res. Logist. , vol.45 , pp. 279-302
    • Hartmann, S.1
  • 31
    • 0036684673 scopus 로고    scopus 로고
    • A self-adapting genetic algorithm for project scheduling under resource constraints
    • DOI 10.1002/nav.10029
    • S. Hartmann 2002 A self-adapting genetic algorithm for project scheduling under resource constraints Nav. Res. Logist. 49 433 448 1918279 1013.90062 10.1002/nav.10029 (Pubitemid 34878877)
    • (2002) Naval Research Logistics , vol.49 , Issue.5 , pp. 433-448
    • Hartmann, S.1
  • 32
    • 0034559432 scopus 로고    scopus 로고
    • Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem
    • 0985.90036 10.1016/S0377-2217(99)00485-3
    • S. Hartmann R. Kolisch 2000 Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem Eur. J. Oper. Res. 127 394 407 0985.90036 10.1016/S0377-2217(99)00485-3
    • (2000) Eur. J. Oper. Res. , vol.127 , pp. 394-407
    • Hartmann, S.1    Kolisch, R.2
  • 36
    • 0043140243 scopus 로고    scopus 로고
    • Experiences with fine-grained parallel genetic algorithms
    • 1707997 0937.90092 10.1023/A:1018912715283
    • U. Kohlmorgen H. Schmeck K. Haase 1999 Experiences with fine-grained parallel genetic algorithms Ann. Oper. Res. 90 203 219 1707997 0937.90092 10.1023/A:1018912715283
    • (1999) Ann. Oper. Res. , vol.90 , pp. 203-219
    • Kohlmorgen, U.1    Schmeck, H.2    Haase, K.3
  • 38
    • 0030231487 scopus 로고    scopus 로고
    • Efficient priority rules for the resource-constrained project scheduling problem
    • DOI 10.1016/0272-6963(95)00032-1
    • R. Kolisch 1996 Efficient priority rules for the resource-constrained project scheduling problem J. Oper. Manag. 14 179 192 10.1016/0272-6963(95) 00032-1 (Pubitemid 126365433)
    • (1996) Journal of Operations Management , vol.14 , Issue.3 , pp. 179-192
    • Kolisch, R.1
  • 39
    • 0030121479 scopus 로고    scopus 로고
    • Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation
    • R. Kolisch 1996 Serial and parallel resource-constrained project scheduling methods revisite: theory and computation Eur. J. Oper. Res. 90 320 333 0916.90151 10.1016/0377-2217(95)00357-6 (Pubitemid 126652217)
    • (1996) European Journal of Operational Research , vol.90 , Issue.2 , pp. 320-333
    • Kolisch, R.1
  • 40
    • 0001896880 scopus 로고    scopus 로고
    • Adaptive search for solving hard project scheduling problems
    • 10.1002/(SICI)1520-6750(199602)43:1<23::AID-NAV2>3.0.CO;2-P
    • R. Kolisch A. Drexl 1996 Adaptive search for solving hard project scheduling problems Nav. Res. Logist. 43 43 23 10.1002/(SICI)1520-6750(199602) 43:1<23::AID-NAV2>3.0.CO;2-P
    • (1996) Nav. Res. Logist. , vol.43 , pp. 43-23
    • Kolisch, R.1    Drexl, A.2
  • 41
    • 0002030301 scopus 로고    scopus 로고
    • Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis
    • J. Weglarz (eds). Kluwer Dordrecht
    • Kolisch, R., Hartmann, S.: Heuristic algorithms for solving the resource-constrained project scheduling problem: Classification and computational analysis. In: Weglarz, J. (ed.) Handbook on recent advances in project scheduling, pp. 147-178. Kluwer, Dordrecht (1999)
    • (1999) Handbook on Recent Advances in Project Scheduling , pp. 147-178
    • Kolisch, R.1    Hartmann, S.2
  • 42
    • 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 S. Hartmann 2006 Experimental investigation of heuristics for resource-constrained project scheduling: an update Eur. J. Oper. Res. 174 23 37 1116.90047 10.1016/j.ejor.2005.01.065 (Pubitemid 44866841)
    • (2006) European Journal of Operational Research , vol.174 , Issue.1 , pp. 23-37
    • Kolisch, R.1    Hartmann, S.2
  • 43
    • 0000801563 scopus 로고    scopus 로고
    • An integrated survey of deterministic project scheduling
    • DOI 10.1016/S0305-0483(00)00046-3, PII S0305048300000463
    • R. Kolisch R. Padman 2001 An integrated survey of deterministic project scheduling Int. J. Manag. Sci. 29 249 272 (Pubitemid 33662608)
    • (2001) Omega , vol.29 , Issue.3 , pp. 249-272
    • Kolisch, R.1    Padman, R.2
  • 44
    • 0000698758 scopus 로고
    • Characterization and generation of a general class of resource-constrained project scheduling problems
    • 0870.90070 10.1287/mnsc.41.10.1693
    • R. Kolisch A. Sprecher A. Drexl 1995 Characterization and generation of a general class of resource-constrained project scheduling problems Manag. Sci. 41 1693 1703 0870.90070 10.1287/mnsc.41.10.1693
    • (1995) Manag. Sci. , vol.41 , pp. 1693-1703
    • Kolisch, R.1    Sprecher, A.2    Drexl, A.3
  • 46
    • 0030151930 scopus 로고    scopus 로고
    • Search heuristics for resource constrained project scheduling
    • 0863.90090
    • J.K. Lee Y.D. Kim 1996 Search heuristics for resource constrained project scheduling J. Oper. Res. Soc. 47 678 689 0863.90090
    • (1996) J. Oper. Res. Soc. , vol.47 , pp. 678-689
    • Lee, J.K.1    Kim, Y.D.2
  • 47
    • 33845274958 scopus 로고
    • Strength and adaptability of problem-space based neighborhoods for resource constrained scheduling
    • 0842.90062 10.1007/BF01719262
    • V.J. Leon B. Ramamoorthy 1995 Strength and adaptability of problem-space based neighborhoods for resource constrained scheduling OR Spektrum 17 173 182 0842.90062 10.1007/BF01719262
    • (1995) OR Spektrum , vol.17 , pp. 173-182
    • Leon, V.J.1    Ramamoorthy, B.2
  • 48
    • 0026822242 scopus 로고
    • An iterative scheduling technique for resource-constrained project scheduling
    • 10.1016/0377-2217(92)90320-9 0825.90536 10.1016/0377-2217(92)90320-9
    • K.Y. Li R.J. Willis 1992 An iterative scheduling technique for resource-constrained project scheduling Eur. J. Oper. Res. 56 3 370 379 10.1016/0377-2217(92)90320-9 0825.90536 10.1016/0377-2217(92)90320-9
    • (1992) Eur. J. Oper. Res. , vol.56 , Issue.3 , pp. 370-379
    • Li, K.Y.1    Willis, R.J.2
  • 49
    • 44849140428 scopus 로고    scopus 로고
    • A random key based genetic algorithm for the resource constrained project scheduling problem
    • 2577240 1163.90500 10.1016/j.cor.2007.07.001
    • J.J.M. Mendes J.F. Gonñalves M.G.C. Resende 2009 A random key based genetic algorithm for the resource constrained project scheduling problem Comput. Oper. Res. 36 92 109 2577240 1163.90500 10.1016/j.cor.2007.07.001
    • (2009) Comput. Oper. Res. , vol.36 , pp. 92-109
    • Mendes, J.J.M.1    Gonñalves, J.F.2    Resende, M.G.C.3
  • 50
    • 0032070635 scopus 로고    scopus 로고
    • An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation
    • A. Mingozzi V. Maniezzo S. Ricciardelli L. Bianco 1998 An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation Manag. Sci. 44 714 729 1004.90036 10.1287/mnsc.44.5.714 (Pubitemid 128596875)
    • (1998) Management Science , vol.44 , Issue.5 , pp. 714-729
    • Mingozzi, A.1    Maniezzo, V.2    Ricciardelli, S.3    Bianco, L.4
  • 51
    • 0037871958 scopus 로고    scopus 로고
    • Solving project scheduling problems by minimum cut computations
    • 10.1287/mnsc.49.3.330.12737
    • R.H. Möhring A.S. Schulz F. Stork M. Uetz 2003 Solving project scheduling problems by minimum cut computations Manag. Sci. 49 330 350 10.1287/mnsc.49.3.330.12737
    • (2003) Manag. Sci. , vol.49 , pp. 330-350
    • Möhring, R.H.1    Schulz, A.S.2    Stork, F.3    Uetz, M.4
  • 52
    • 84888782064 scopus 로고    scopus 로고
    • Formulation and tabu search algorithm for the resource constrained project scheduling problem
    • C.C. Ribeiro P. Hansen (eds). Kluwer Academic Dordrecht
    • Nonobe, K., Ibaraki, T.: Formulation and tabu search algorithm for the resource constrained project scheduling problem. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 557-588. Kluwer Academic, Dordrecht (2002)
    • (2002) Essays and Surveys in Metaheuristics , pp. 557-588
    • Nonobe, K.1    Ibaraki, T.2
  • 53
    • 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 P. Michelon 2004 LSSPER: solving the resource-constrained project scheduling problem with large neighbourhood search Ann. Oper. Res. 131 237 257 2095806 1066.90037 10.1023/B:ANOR.0000039521.26237. 62 (Pubitemid 39187382)
    • (2004) Annals of Operations Research , vol.131 , Issue.1-4 , pp. 237-257
    • Palpant, M.1    Artigues, C.2    Michelon, P.3
  • 56
    • 0001150453 scopus 로고
    • DSS for multiobjective project scheduling
    • 0815.90099 10.1016/0377-2217(94)90353-0
    • R. Slowinski B. Soniewicki J. Weglarz 1994 DSS for multiobjective project scheduling Eur. J. Oper. Res. 79 220 229 0815.90099 10.1016/0377-2217(94)90353- 0
    • (1994) Eur. J. Oper. Res. , vol.79 , pp. 220-229
    • Slowinski, R.1    Soniewicki, B.2    Weglarz, J.3
  • 58
    • 0033691202 scopus 로고    scopus 로고
    • Scheduling resource-constrained projects competitively at modest memory requirements
    • 10.1287/mnsc.46.5.710.12044
    • A. Sprecher 2000 Scheduling resource-constrained projects competitively at modest memory requirements Manag. Sci. 46 710 723 10.1287/mnsc.46.5.710.12044
    • (2000) Manag. Sci. , vol.46 , pp. 710-723
    • Sprecher, A.1
  • 59
    • 0018011301 scopus 로고
    • Multiple resource-constrained scheduling using branch and bound
    • J.P. Stinson E.W. Davis B.M. Khumawala 1978 Multiple resource-constrained scheduling using branch and bound AIIE Trans. 10 252 259
    • (1978) AIIE Trans. , vol.10 , pp. 252-259
    • Stinson, J.P.1    Davis, E.W.2    Khumawala, B.M.3
  • 60
    • 12344330553 scopus 로고    scopus 로고
    • On the generation of circuits and minimal forbidden sets
    • DOI 10.1007/s10107-004-0512-0
    • F. Stork M. Uetz 2005 On the generation of circuits and minimal forbidden sets Math. Program. 102 185 203 2115486 1062.90029 10.1007/s10107-004-0512-0 (Pubitemid 40134696)
    • (2005) Mathematical Programming , vol.102 , Issue.1 , pp. 185-203
    • Stork, F.1    Uetz, M.2
  • 61
    • 0032117729 scopus 로고    scopus 로고
    • A Tabu Search Approach for the Resource Constrained Project Scheduling Problem
    • P.R. Thomas S. Salhi 1998 A tabu search approach for the resource constrained project scheduling problem J. Heuristics 4 123 139 0913.90184 10.1023/A:1009673512884 (Pubitemid 128514873)
    • (1998) Journal of Heuristics , vol.4 , Issue.2 , pp. 123-139
    • Thomas, P.R.1    Salhi, S.2
  • 62
    • 0035617605 scopus 로고    scopus 로고
    • A competitive heuristic solution technique for resource-constrained project scheduling
    • 1854419 1024.90045 10.1023/A:1010997814183
    • P. Tormos A. Lova 2001 A competitive heuristic solution technique for resource-constrained project scheduling Ann. Oper. Res. 102 65 81 1854419 1024.90045 10.1023/A:1010997814183
    • (2001) Ann. Oper. Res. , vol.102 , pp. 65-81
    • Tormos, P.1    Lova, A.2
  • 65
    • 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 M.S. Quintanilla 2004 A population-based approach to the resource-constrained project scheduling problem Ann. Oper. Res. 131 305 324 2095809 1066.90044 10.1023/B:ANOR.0000039524.09792.c9 (Pubitemid 39187385)
    • (2004) Annals of Operations Research , vol.131 , Issue.1-4 , pp. 305-324
    • Valls, V.1    Ballestin, F.2    Quintanilla, S.3
  • 66
    • 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 M.S. Quintanilla 2005 Justification and RCPSP: a technique that pays Eur. J. Oper. Res. 165 375 386 1066.90045 10.1016/j.ejor.2004.04.008 (Pubitemid 40206368)
    • (2005) European Journal of Operational Research , vol.165 , Issue.2 , pp. 375-386
    • Valls, V.1    Ballestin, F.2    Quintanilla, S.3


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