{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:15:57Z","timestamp":1742912157348,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160530"},{"type":"electronic","value":"9783642160547"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16054-7_6","type":"book-chapter","created":{"date-parts":[[2010,9,30]],"date-time":"2010-09-30T22:07:50Z","timestamp":1285884470000},"page":"73-87","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Heuristics for Dynamic Resource-Constrained Project Scheduling Problem"],"prefix":"10.1007","author":[{"given":"Andr\u00e9 Renato Villela","family":"da Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/j.autcon.2008.10.007","volume":"18","author":"P.-H. Chen","year":"2009","unstructured":"Chen, P.-H., Shahandashti, S.M.: Hybrid of genetic algorithm and simulated annealing for multiple project scheduling with multiple resource constraints. Autom. in Constr.\u00a018, 434\u2013443 (2009)","journal-title":"Autom. in Constr."},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"2653","DOI":"10.1016\/j.cor.2008.11.010","volume":"36","author":"N. Damak","year":"2009","unstructured":"Damak, N., Jarboui, B., Siarry, P., Loukil, T.: Differential evolution for solving multi-mode resource-constrained project scheduling problems. Comput. & Oper. Res.\u00a036, 2653\u20132659 (2009)","journal-title":"Comput. & Oper. Res."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local Branching. Mat. Prog.\u00a098, 23\u201347 (2003)","journal-title":"Mat. Prog."},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"1436","DOI":"10.1016\/j.cor.2006.08.004","volume":"35","author":"M. Fischetti","year":"2008","unstructured":"Fischetti, M., Lodi, A.: Repairing MIP infeasibility through local branching. Comp. & Oper. Res.\u00a035, 1436\u20131445 (2008)","journal-title":"Comp. & Oper. Res."},{"key":"6_CR5","first-page":"92","volume":"36","author":"J. Gon\u00e7alves","year":"2009","unstructured":"Gon\u00e7alves, J., Mendes, J., Resende, M.: A random key based genetic algorithm for the resource constrained project scheduling problems. Int. J. of Prod. Res.\u00a036, 92\u2013109 (2009)","journal-title":"Int. J. of Prod. Res."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1111\/j.1475-3995.2007.00614.x","volume":"14","author":"J. Homberger","year":"2007","unstructured":"Homberger, J.: A multi-agent system for the decentralized resource-constrained multi-project scheduling problem. Int. Trans. in Oper. Res.\u00a014, 565\u2013589 (2007)","journal-title":"Int. Trans. in Oper. Res."},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-540-30217-9_65","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"J. Puchinger","year":"2004","unstructured":"Puchinger, J., Raidl, G.R.: An Evolutionary Algorithm for Column Generation in Integer Programming: an Effective. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol.\u00a03242, pp. 642\u2013651. Springer, Heidelberg (2004)"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.parco.2006.11.007","volume":"33","author":"C.C. Ribeiro","year":"2007","unstructured":"Ribeiro, C.C., Rosseti, I.: Efficient Parallel Cooperative Implementations of GRASP Heuristics. Paral. Comp.\u00a033, 21\u201335 (2007)","journal-title":"Paral. Comp."},{"key":"6_CR9","volume-title":"Congress on Evolutionary Computation","author":"Y. Semet","year":"2005","unstructured":"Semet, Y., Schoenauer, M.: An efficient memetic, permutation-based evolutionary algorithm for real-world train timetabling. In: Congress on Evolutionary Computation. IEEE Press, Los Alamitos (2005)"},{"key":"6_CR10","unstructured":"Silva, A.R.V., Ochi, L.S.: A dynamic resource constrained task scheduling problem. In: Proc. of Lat.-Ibero-Am. Congr. on Oper. Res. (CLAIO), Montevideo, Uruguay (November 2006)"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Silva, A.R.V., Ochi, L.S.: A hybrid evolutionary algorithm for the dynamic resource constrained task scheduling problem. In: Proc. of the Int. Workshop on Nat. Inspired Distributed Comput. (NIDISC 2007), LongBeach, EUA (March 2007)","DOI":"10.1109\/IPDPS.2007.370432"},{"key":"6_CR12","unstructured":"Silva, A.R.V., Ochi, L.S., Santos, H.G.: New effective algorithm for dynamic resource constrained project scheduling problem. In: Proc. of Int. Conf. on Eng. Optim. (ENGOPT), Rio de Janeiro, Brazil (June 2008)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Silva, A.R.V., Ochi, L.S.: New sequential and parallel algorithm for dynamic resource constrained project scheduling problem. In: Proc. of Int. Workshop on Nat. Inspired Distributed Comput. (NIDISC 2009), Rome, Italy (May 2009)","DOI":"10.1109\/IPDPS.2009.5161118"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1016\/j.compchemeng.2006.09.003","volume":"5","author":"J. Till","year":"2007","unstructured":"Till, J., Sand, G., Urselmann, M., Engell, S.: A hybrid evolutionary algorithm for solving two-stage stochastic integer programs in chemical batch scheduling. Computers & Chemical Engineering\u00a05, 630\u2013647 (2007)","journal-title":"Computers & Chemical Engineering"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16054-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T07:12:37Z","timestamp":1553152357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16054-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160530","9783642160547"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16054-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}