메뉴 건너뛰기




Volumn 17, Issue 6, 2011, Pages 705-728

Using resource scarceness characteristics to solve the multi-mode resource-constrained project scheduling problem

Author keywords

Multi mode; Resource characteristics; Scatter search; Scheduling

Indexed keywords

COMPETITIVE ALGORITHMS; COMPUTATIONAL RESULTS; IMPROVEMENT METHODS; MULTI-MODE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; MULTIMODES; PROJECT SCHEDULING; RENEWABLE AND NON-RENEWABLE RESOURCES; RESOURCE CHARACTERISTIC; RESOURCE PARAMETERS; RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM; SCATTER SEARCH ALGORITHM; SCATTER-SEARCH; SEARCH PROCESS;

EID: 84855502072     PISSN: 13811231     EISSN: 15729397     Source Type: Journal    
DOI: 10.1007/s10732-010-9152-0     Document Type: Article
Times cited : (47)

References (50)
  • 1
    • 0038209741 scopus 로고    scopus 로고
    • Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms
    • 1095.90541 10.1057/palgrave.jors.2601563
    • J. Alcaraz C. Maroto R. Ruiz 2003 Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms J. Oper. Res. Soc. 54 614 626 1095.90541 10.1057/palgrave.jors.2601563
    • (2003) J. Oper. Res. Soc. , vol.54 , pp. 614-626
    • Alcaraz, J.1    Maroto, C.2    Ruiz, R.3
  • 2
    • 0001849846 scopus 로고
    • Heuristic algorithms for resource-constrained project scheduling: A review and empirical analysis
    • R. Slowinski J. Weglarz (eds). Elsevier Amsterdam
    • Alvarez-Valdes, R., Tamarit, J.: Heuristic algorithms for resource-constrained project scheduling: A review and empirical analysis. In: Slowinski, R., Weglarz, J. (eds.) Advances in Project Scheduling. Elsevier, Amsterdam (1989)
    • (1989) Advances in Project Scheduling
    • Alvarez-Valdes, R.1    Tamarit, J.2
  • 3
    • 0019342681 scopus 로고
    • Scheduling subject to resource constraints: Classification and complexity
    • 678815 0516.68037 10.1016/0166-218X(83)90012-4
    • J. Blazewicz J. Lenstra A. 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.2    Rinnooy Kan, A.3
  • 4
    • 0027694317 scopus 로고
    • Heuristics for scheduling projects with resource restrictions and several resource-duration modes
    • 10.1080/00207549308956882
    • F. Boctor 1993 Heuristics for scheduling projects with resource restrictions and several resource-duration modes Int. J. Prod. Res. 31 2547 2558 10.1080/00207549308956882
    • (1993) Int. J. Prod. Res. , vol.31 , pp. 2547-2558
    • Boctor, F.1
  • 5
    • 0030124780 scopus 로고    scopus 로고
    • A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes
    • F. Boctor 1996 A new and efficient heuristic for scheduling projects with resource restrictions and multiple execution modes Eur. J. Oper. Res. 90 349 361 0916.90143 10.1016/0377-2217(95)00359-2 (Pubitemid 126652219)
    • (1996) European Journal of Operational Research , vol.90 , Issue.2 , pp. 349-361
    • Boctor, F.F.1
  • 6
    • 0030216966 scopus 로고    scopus 로고
    • Resource-constrained project scheduling by simulated annealing
    • F. Boctor 1996 Resource-constrained project scheduling by simulated annealing 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
    • 0032736579 scopus 로고    scopus 로고
    • Resource-constrained project scheduling: Notation, classification, models, and methods
    • 0937.90030 10.1016/S0377-2217(98)00204-5
    • P. Brucker A. Drexl R. Möhring K. Neumann E. Pesch 1999 Resource-constrained project scheduling: notation, classification, models, and methods Eur. J. Oper. Res. 112 3 41 0937.90030 10.1016/S0377-2217(98)00204-5
    • (1999) Eur. J. Oper. Res. , vol.112 , pp. 3-41
    • Brucker, P.1    Drexl, A.2    Möhring, R.3    Neumann, K.4    Pesch, E.5
  • 9
    • 33750989916 scopus 로고    scopus 로고
    • Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting
    • DOI 10.1016/j.ejor.2006.02.010, PII S037722170600110X
    • J. Buddhakulsomsiri D. Kim 2007 Priority rule-based heuristic for multi-mode resource-constrained project scheduling problems with resource vacations and activity splitting Eur. J. Oper. Res. 178 374 390 1107.90015 10.1016/j.ejor.2006.02.010 (Pubitemid 44750484)
    • (2007) European Journal of Operational Research , vol.178 , Issue.2 , pp. 374-390
    • Buddhakulsomsiri, J.1    Kim, D.S.2
  • 10
    • 0016972372 scopus 로고
    • Heuristics for scheduling resource-constrained projects: An experimental investigation
    • 0326.90029 10.1287/mnsc.22.11.1186
    • D. 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.1
  • 11
    • 24944476690 scopus 로고    scopus 로고
    • A bi-population based genetic algorithm for the RCPSP
    • 10.1007/1142492541
    • D. Debels M. Vanhoucke 2005 A bi-population based genetic algorithm for the RCPSP Lect. Notes Comput. Sci. 3483 378 387 10.1007/1142492541
    • (2005) Lect. Notes Comput. Sci. , vol.3483 , pp. 378-387
    • Debels, D.1    Vanhoucke, M.2
  • 12
    • 3543055794 scopus 로고    scopus 로고
    • A random network generator for activity-on-The-node networks
    • 1999988 10.1023/A:1022283403119
    • E. Demeulemeester M. Vanhoucke W. Herroelen 2003 A random network generator for activity-on-the-node networks J. Sched. 6 13 34 1999988 10.1023/A:1022283403119
    • (2003) J. Sched. , vol.6 , pp. 13-34
    • Demeulemeester, E.1    Vanhoucke, M.2    Herroelen, W.3
  • 13
    • 0027666457 scopus 로고
    • Nonpreemptive multi-mode resource-constrained project scheduling
    • 10.1080/07408179308964317
    • A. Drexl J. Grünewald 1993 Nonpreemptive multi-mode resource-constrained project scheduling IIE Trans. 25 74 81 10.1080/ 07408179308964317
    • (1993) IIE Trans. , vol.25 , pp. 74-81
    • Drexl, A.1    Grünewald, J.2
  • 14
    • 0347899800 scopus 로고    scopus 로고
    • Fundamentals of scatter search and path relinking
    • 1835135 0983.90077
    • F. Glover M. Laguna R. Marti 2000 Fundamentals of scatter search and path relinking Control Cybern. 29 653 684 1835135 0983.90077
    • (2000) Control Cybern. , vol.29 , pp. 653-684
    • Glover, F.1    Laguna, M.2    Marti, R.3
  • 15
    • 0032188522 scopus 로고    scopus 로고
    • A competitive genetic algorithm for resource-constrained project scheduling
    • S. Hartmann 1998 A competitive genetic algorithm for resource-constrained project scheduling Nav. Res. Logist. 45 733 750 1643514 0936.90024 10.1002/(SICI)1520-6750(199810)45:7<733::AID-NAV5>3.0.CO;2-C (Pubitemid 128587349)
    • (1998) Naval Research Logistics , vol.45 , Issue.7 , pp. 733-750
    • Hartmann, S.1
  • 16
    • 0035612930 scopus 로고    scopus 로고
    • Project scheduling with multiple modes: A genetic algorithm
    • 1854421 1024.90039 10.1023/A:1010902015091
    • S. Hartmann 2001 Project scheduling with multiple modes: A genetic algorithm Ann. Oper. Res. 102 111 135 1854421 1024.90039 10.1023/A:1010902015091
    • (2001) Ann. Oper. Res. , vol.102 , pp. 111-135
    • Hartmann, S.1
  • 17
    • 0442269144 scopus 로고    scopus 로고
    • Resource-constrained project scheduling: A heuristic for the multi-mode case
    • R. Heilmann 2001 Resource-constrained project scheduling: A heuristic for the multi-mode case OR Spektrum 23 335 357 1852583 0985.90037 10.1007/PL00013354 (Pubitemid 33692907)
    • (2001) OR Spektrum , vol.23 , Issue.3 , pp. 335-357
    • Heilmann, R.1
  • 18
    • 0033077946 scopus 로고    scopus 로고
    • Phase transitions in project scheduling
    • 1054.90548
    • W. Herroelen B. De Reyck 1999 Phase transitions in project scheduling J. Oper. Res. Soc. 50 148 156 1054.90548
    • (1999) J. Oper. Res. Soc. , vol.50 , pp. 148-156
    • Herroelen, W.1    De Reyck, B.2
  • 20
    • 36749094527 scopus 로고    scopus 로고
    • A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems
    • DOI 10.1016/j.amc.2007.04.096, PII S009630030700553X
    • B. Jarboui N. Damak P. Siarry A. Rebai 2008 A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems Appl. Math. Comput. 195 299 308 2379216 1180.90125 10.1016/j.amc.2007.04.096 (Pubitemid 350213083)
    • (2008) Applied Mathematics and Computation , vol.195 , Issue.1 , pp. 299-308
    • Jarboui, B.1    Damak, N.2    Siarry, P.3    Rebai, A.4
  • 21
    • 0035612931 scopus 로고    scopus 로고
    • Simulated annealing for multi-mode resource-constrained project scheduling
    • 1854422 0990.90513 10.1023/A:1010954031930
    • J. Józefowska M. Mika R. Rózycki G. Waligóra J. Weglarz 2001 Simulated annealing for multi-mode resource-constrained project scheduling Ann. Oper. Res. 102 137 155 1854422 0990.90513 10.1023/A: 1010954031930
    • (2001) Ann. Oper. Res. , vol.102 , pp. 137-155
    • Józefowska, J.1    Mika, M.2    Rózycki, R.3    Waligóra, G.4    Weglarz, J.5
  • 25
    • 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
  • 26
    • 0030788844 scopus 로고    scopus 로고
    • PSPLIB-A project scheduling problem library
    • 10.1016/S0377-2217(96)00170-1
    • R. Kolisch A. Sprecher 1996 PSPLIB-a project scheduling problem library Eur. J. Oper. Res. 96 205 216 10.1016/S0377-2217(96)00170-1
    • (1996) Eur. J. Oper. Res. , vol.96 , pp. 205-216
    • Kolisch, R.1    Sprecher, A.2
  • 27
    • 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
  • 28
    • 33845522461 scopus 로고    scopus 로고
    • Multi-mode resource constrained project scheduling: Scheduling schemes, priority rules and mode selection rules
    • A. Lova P. Tormos F. Barber 2006 Multi-mode resource constrained project scheduling: scheduling schemes, priority rules and mode selection rules Intel. Artif. 30 69 86 (Pubitemid 44925544)
    • (2006) Inteligencia Artificial , vol.10 , Issue.30 , pp. 69-86
    • Lova, A.1    Tormos, P.2    Barber, F.3
  • 29
    • 58949096631 scopus 로고    scopus 로고
    • An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes
    • 10.1016/j.ijpe.2008.11.002
    • A. Lova P. Tormos M. Cervantes F. Barber 2009 An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes Int. J. Prod. Econ. 117 302 316 10.1016/j.ijpe.2008.11.002
    • (2009) Int. J. Prod. Econ. , vol.117 , pp. 302-316
    • Lova, A.1    Tormos, P.2    Cervantes, M.3    Barber, F.4
  • 30
    • 25444485816 scopus 로고    scopus 로고
    • Principles of scatter search
    • DOI 10.1016/j.ejor.2004.08.004, PII S0377221704005430, Feature Cluster on Scatter Search Methods for Optimization
    • R. Marti M. Laguna F. Glover 2006 Principles of scatter search Eur. J. Oper. Res. 169 359 372 2171867 1079.90178 10.1016/j.ejor.2004.08.004 (Pubitemid 41375696)
    • (2006) European Journal of Operational Research , vol.169 , Issue.2 , pp. 359-372
    • Marti, R.1    Laguna, M.2    Glover, F.3
  • 31
    • 0001636411 scopus 로고
    • An experimental and comparative evaluation of production line balancing techniques
    • 0217.26903 10.1287/mnsc.16.11.728
    • A. Mastor 1970 An experimental and comparative evaluation of production line balancing techniques Manag. Sci. 16 728 746 0217.26903 10.1287/mnsc.16.11. 728
    • (1970) Manag. Sci. , vol.16 , pp. 728-746
    • Mastor, A.1
  • 33
    • 0031192667 scopus 로고    scopus 로고
    • A genetic algorithm for multi-mode resource constrained project scheduling problem
    • PII S0377221796001804
    • M. Mori C. Tseng 1997 A genetic algorithm for the multi-mode resource constrained project scheduling problem Eur. J. Oper. Res. 100 134 141 0947.90589 10.1016/S0377-2217(96)00180-4 (Pubitemid 127414915)
    • (1997) European Journal of Operational Research , vol.100 , Issue.1 , pp. 134-141
    • Mori, M.1    Tseng, C.C.2
  • 34
    • 0038527513 scopus 로고    scopus 로고
    • Formulation and tabu search algorithm for the resource constrained project scheduling problem
    • 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., Hansen, P. (eds.) Essays and Surveys in Metaheuristics. Kluwer Academic, Dordrecht (2002)
    • (2002) Essays and Surveys in Metaheuristics
    • Nonobe, K.1    Ibaraki, T.2
  • 35
    • 0002614325 scopus 로고    scopus 로고
    • A genetic algorithm approach to a general category project scheduling problem
    • 10.1109/5326.740669
    • L. Özdamar 1999 A genetic algorithm approach to a general category project scheduling problem IEEE Trans. Syst. Man Cybern. 29 44 59 10.1109/5326.740669
    • (1999) IEEE Trans. Syst. Man Cybern. , vol.29 , pp. 44-59
    • Özdamar, L.1
  • 36
    • 0009627197 scopus 로고
    • A local constraint based analysis approach to project scheduling under general resource constraints
    • 0815.90096 10.1016/0377-2217(94)90359-X
    • L. Özdamar G. Ulusoy 1994 A local constraint based analysis approach to project scheduling under general resource constraints Eur. J. Oper. Res. 79 287 298 0815.90096 10.1016/0377-2217(94)90359-X
    • (1994) Eur. J. Oper. Res. , vol.79 , pp. 287-298
    • Özdamar, L.1    Ulusoy, G.2
  • 37
    • 0016935106 scopus 로고
    • Project scheduling: The effects of problem structure on heuristic scheduling
    • 434964 0325.90027 10.1002/nav.3800230110
    • J. Patterson 1976 Project scheduling: The effects of problem structure on heuristic scheduling Nav. Res. Logist. 23 95 123 434964 0325.90027 10.1002/nav.3800230110
    • (1976) Nav. Res. Logist. , vol.23 , pp. 95-123
    • Patterson, J.1
  • 38
    • 28244491662 scopus 로고    scopus 로고
    • Scatter Search and Bionomic Algorithms for the aircraft landing problem
    • DOI 10.1016/j.ejor.2004.09.040, PII S0377221704007611
    • H. Pinol J. Beasley 2006 Scatter search and bionomic algorithms for the aircraft landing problem Eur. J. Oper. Res. 171 439 462 1090.90011 10.1016/j.ejor.2004.09.040 (Pubitemid 41706208)
    • (2006) European Journal of Operational Research , vol.171 , Issue.2 , pp. 439-462
    • Pinol, H.1    Beasley, J.E.2
  • 39
    • 52049097838 scopus 로고    scopus 로고
    • A hybrid scatter-search for the discrete time/resource trade-off problem in project scheduling
    • 1152.90464 10.1016/j.ejor.2007.10.042
    • M. Ranjbar B. De Reyck F. Kianfar 2009 A hybrid scatter-search for the discrete time/resource trade-off problem in project scheduling Eur. J. Oper. Res. 193 35 48 1152.90464 10.1016/j.ejor.2007.10.042
    • (2009) Eur. J. Oper. Res. , vol.193 , pp. 35-48
    • Ranjbar, M.1    De Reyck, B.2    Kianfar, F.3
  • 40
    • 0001150453 scopus 로고
    • DSS for multi-objective project scheduling subject to multiple-category resource constraints
    • 0815.90099 10.1016/0377-2217(94)90353-0
    • R. Slowinski B. Soniewicki J. Weglarz 1994 DSS for multi-objective project scheduling subject to multiple-category resource constraints 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
  • 42
    • 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
  • 43
    • 0032096811 scopus 로고    scopus 로고
    • Multi-mode resource-constrained project scheduling by a simple, general and powerful sequencing algorithm
    • PII S0377221797003482
    • A. Sprecher A. Drexl 1998 Multi-mode resource-constrained project scheduling with a simple, general and powerful sequencing algorithm Eur. J. Oper. Res. 107 431 450 0943.90042 10.1016/S0377-2217(97)00348-2 (Pubitemid 128407555)
    • (1998) European Journal of Operational Research , vol.107 , Issue.2 , pp. 431-450
    • Sprecher, A.1    Drexl, A.2
  • 44
    • 33746101954 scopus 로고    scopus 로고
    • An exact algorithm for project scheduling with multiple modes
    • 1464665 0885.90059 10.1007/BF01545587
    • A. Sprecher S. Hartmann A. Drexl 1997 An exact algorithm for project scheduling with multiple modes OR Spektrum 19 195 203 1464665 0885.90059 10.1007/BF01545587
    • (1997) OR Spektrum , vol.19 , pp. 195-203
    • Sprecher, A.1    Hartmann, S.2    Drexl, A.3
  • 45
    • 0018011301 scopus 로고
    • Multiple resource-constrained scheduling using branch-and-bound
    • J. Stinson E. Davis B. Khumawala 1978 Multiple resource-constrained scheduling using branch-and-bound IIE Trans. 10 252 259 (Pubitemid 9412432)
    • (1978) AIIE Trans , vol.10 , Issue.3 , pp. 252-259
    • Stinson Joel, P.1    Davis Edward, W.2    Khumawala Basheer, M.3
  • 46
    • 69249164131 scopus 로고    scopus 로고
    • Two-phase genetic local search algorithm for the multimode resource-constrained project scheduling problem
    • 10.1109/TEVC.2008.2011991
    • L.Y. Tseng S.C. Chen 2009 Two-phase genetic local search algorithm for the multimode resource-constrained project scheduling problem IEEE Trans. Evol. Comput. 13 848 857 10.1109/TEVC.2008.2011991
    • (2009) IEEE Trans. Evol. Comput. , vol.13 , pp. 848-857
    • Tseng, L.Y.1    Chen, S.C.2
  • 47
    • 70349276753 scopus 로고    scopus 로고
    • A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems
    • 1175.90205 10.1016/j.ejor.2009.03.034
    • V. Van Peteghem M. Vanhoucke 2010 A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problems Eur. J. Oper. Res. 201 409 418 1175.90205 10.1016/j.ejor.2009.03.034
    • (2010) Eur. J. Oper. Res. , vol.201 , pp. 409-418
    • Van Peteghem, V.1    Vanhoucke, M.2
  • 48
    • 36048990558 scopus 로고    scopus 로고
    • An evaluation of the adequacy of project network generators with systematically sampled networks
    • DOI 10.1016/j.ejor.2007.03.032, PII S037722170700375X
    • M. Vanhoucke J. Coelho D. Debels B. Maenhout L. Tavares 2008 An evaluation of the adequacy of project network generators with systematically sampled networks Eur. J. Oper. Res. 187 511 524 1149.90066 10.1016/j.ejor.2007. 03.032 (Pubitemid 350102866)
    • (2008) European Journal of Operational Research , vol.187 , Issue.2 , pp. 511-524
    • Vanhoucke, M.1    Coelho, J.2    Debels, D.3    Maenhout, B.4    Tavares, L.V.5
  • 49
    • 33645992444 scopus 로고    scopus 로고
    • Multi-mode project scheduling based on particle swarm optimization
    • 1121.90425 10.1111/j.1467-8667.2005.00420.x
    • H. Zhang C. Tam H. Li 2006 Multi-mode project scheduling based on particle swarm optimization Comput.-Aided Civ. Infrastruct. Eng. 21 93 103 1121.90425 10.1111/j.1467-8667.2005.00420.x
    • (2006) Comput.-Aided Civ. Infrastruct. Eng. , vol.21 , pp. 93-103
    • Zhang, H.1    Tam, C.2    Li, H.3
  • 50
    • 33748521972 scopus 로고    scopus 로고
    • A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem
    • DOI 10.1287/ijoc.1040.0121
    • G. Zhu J. Bard G. Tu 2006 A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem J. Comput. 18 3 377 390 (Pubitemid 44371778)
    • (2006) INFORMS Journal on Computing , vol.18 , Issue.3 , pp. 377-390
    • Zhu, G.1    Bard, J.F.2    Yu, G.3


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