{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:15:48Z","timestamp":1778901348625,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540926948","type":"print"},{"value":"9783540926955","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-92695-5_18","type":"book-chapter","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T10:11:59Z","timestamp":1229422319000},"page":"234-242","source":"Crossref","is-referenced-by-count":2,"title":["Hybrid Heuristics for Multi-mode Resource-Constrained Project Scheduling"],"prefix":"10.1007","author":[{"given":"Celso","family":"Tchao","sequence":"first","affiliation":[]},{"given":"Simone L.","family":"Martins","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Lenstra, J., Kan, A.R.: Scheduling projects subject to resource constraints: classification and complexity. Discrete Applied Mathematics (5), 11\u201324 (1983)","DOI":"10.1016\/0166-218X(83)90012-4"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/B978-0-444-87358-3.50005-5","volume-title":"Advances in Project Scheduling","author":"J. Patterson","year":"1989","unstructured":"Patterson, J., Slowinski, R., Talbot, F., Weglarz, J.: An algorithm for a general class of precedence and resource constrained scheduling problem. In: Slowinski, R., Weglarz, J. (eds.) Advances in Project Scheduling, pp. 3\u201328. Elsevier, Amsterdam (1989)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Hartmann, S., Drexl, A.: Project scheduling with multiple modes: A comparison of exact algorithms. Networks (32), 283\u2013297 (1998)","DOI":"10.1002\/(SICI)1097-0037(199812)32:4<283::AID-NET5>3.0.CO;2-I"},{"issue":"3","key":"18_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1287\/ijoc.1040.0121","volume":"18","author":"G. Zhu","year":"2006","unstructured":"Zhu, G., Bard, J., Yu, G.: A branch-and-cut procedure for the multimode resourceconstrained project-scheduling problem. INFORMS Journal on Computing\u00a018(3), 377\u2013390 (2006)","journal-title":"INFORMS Journal on Computing"},{"issue":"79","key":"18_CR5","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0377-2217(94)90353-0","volume":"18","author":"R. Slowinski","year":"1994","unstructured":"Slowinski, R., Soniewicki, B., Weglarz, J.: DSS for multiobjective project scheduling. Eur. J. Opl. Res.\u00a018(79), 220\u2013229 (1994)","journal-title":"Eur. J. Opl. Res."},{"issue":"34","key":"18_CR6","doi-asserted-by":"publisher","first-page":"2335","DOI":"10.1080\/00207549608905028","volume":"8","author":"F. Boctor","year":"1996","unstructured":"Boctor, F.: Resource-constrained project scheduling by simulated annealing. International Journal of Production Research\u00a08(34), 2335\u20132351 (1996)","journal-title":"International Journal of Production Research"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. European Journal of Operational Research (149), 268\u2013281 (2003)","DOI":"10.1016\/S0377-2217(02)00761-0"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Jozefowska, J., Mika, M., Rozycki, R., Waligora, G., Weglarz, J.: Simulated annealing for multi-mode resource-constrained project scheduling. Annals of Operations Research (102), 137\u2013155 (2001)","DOI":"10.1023\/A:1010954031930"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Alcaraz, J., Maroto, C., Ruiz, R.: Solving the multi-mode resource constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Society (54)\u00a0(54), 614\u2013626 (2003)","DOI":"10.1057\/palgrave.jors.2601563"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Hartmann, S.: Project scheduling with multiple modes: a genetic algorithm. Ann. Opns. Res (102), 111\u2013135 (2001)","DOI":"10.1023\/A:1010902015091"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Ozdamar, L.: A genetic algorithm approach to a general category project scheduling problem. IEEE Trans. Syst. Man Cybern (29), 44\u201359 (1999)","DOI":"10.1109\/5326.740669"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-1-4615-1507-4_25","volume-title":"Essays and Surveys in Metaheuristics","author":"K. Nonobe","year":"2002","unstructured":"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, pp. 557\u2013588. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"18_CR13","first-page":"1","volume-title":"Metaheuristics: Advances and Trends in Local Search Paradigms for Optimisation","author":"T. Baar","year":"1997","unstructured":"Baar, T., Brucker, P., Knust, S.: Tabu search algorithms for resource-constrained project scheduling problems. In: Voss, S., Martello, S., Osman, I., Roucairol, C. (eds.) Metaheuristics: Advances and Trends in Local Search Paradigms for Optimisation, pp. 1\u201318. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-1-4615-1507-4_10","volume-title":"Essays and Surveys in Metaheuristics","author":"C. Cavalcante","year":"2002","unstructured":"Cavalcante, C., Cavalcante, V., Ribeiro, C., de Souza, C.: Parallel cooperative approaches for the labor constrained scheduling problem. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 201\u2013225. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decision Sciences\u00a08(1), 156\u2013166 (1977)","journal-title":"Decision Sciences"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Computers and Operations Research\u00a013, 533\u2013549 (1986)","journal-title":"Computers and Operations Research"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search - Part I. ORSA Journal on Computing\u00a01, 190\u2013206 (1989)","journal-title":"ORSA Journal on Computing"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu search - Part II. ORSA Journal on Computing\u00a02, 4\u201332 (1990)","journal-title":"ORSA Journal on Computing"},{"key":"18_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)"},{"key":"18_CR20","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"K. Glover","year":"1996","unstructured":"Glover, K.: Tabu search and adaptive memory programming - advances, applications and challenges. In: Barr, R., Helgason, R., Kennington, J. (eds.) Interfaces in Computer Science and Operations Research, pp. 1\u201375. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"7","author":"P. Festa","year":"2002","unstructured":"Festa, P., Pardalos, P., Resende, M., Ribeiro, C.: Randomized heuristics for the max-cut problem. Optimization Methods and Software\u00a07, 1033\u20131058 (2002)","journal-title":"Optimization Methods and Software"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-30176-9_27","volume-title":"Applied Computing","author":"S. Martins","year":"2004","unstructured":"Martins, S., Ribeiro, C., Rosseti, I.: Applications and parallel implementations of metaheuristics in network design and routing. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds.) AACC 2004. LNCS, vol.\u00a03285, pp. 205\u2013213. Springer, Heidelberg (2004)"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"M. Resende","year":"2005","unstructured":"Resende, M., Ribeiro, C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29\u201363. Springer, Heidelberg (2005)"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C. Ribeiro","year":"2002","unstructured":"Ribeiro, C., Uchoa, E., Werneck, R.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing\u00a014, 228\u2013246 (2002)","journal-title":"INFORMS Journal on Computing"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10732-007-9010-x","volume":"13","author":"G. Silva","year":"2007","unstructured":"Silva, G., de Andrade, M., Ochi, L., Martins, S., Plastino, A.: New heuristics for the maximum diversity problem. J. Heuristics\u00a013, 315\u2013336 (2007)","journal-title":"J. Heuristics"},{"key":"18_CR26","first-page":"67","volume":"3","author":"C. Ribeiro","year":"2003","unstructured":"Ribeiro, C., Vianna, D.: A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking. Revista Tecnologia da Informa\u00e7\u00e3o\u00a03, 67\u201370 (2003)","journal-title":"Revista Tecnologia da Informa\u00e7\u00e3o"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10732-006-4192-1","volume":"12","author":"S.C. Ho","year":"2006","unstructured":"Ho, S.C., Gendreau, M.: Path relinking for the vehicle routing problem. J. Heuristics\u00a012, 55\u201372 (2006)","journal-title":"J. Heuristics"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92695-5_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,13]],"date-time":"2020-05-13T20:28:09Z","timestamp":1589401689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92695-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926948","9783540926955"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92695-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}