{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:26:20Z","timestamp":1762298780623},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T00:00:00Z","timestamp":1523836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["TOP"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11750-018-0472-9","type":"journal-article","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T02:07:39Z","timestamp":1523844459000},"page":"283-308","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["A biased random-key genetic algorithm for the project scheduling problem with flexible resources"],"prefix":"10.1007","volume":"26","author":[{"given":"Bernardo F.","family":"Almeida","sequence":"first","affiliation":[]},{"given":"Isabel","family":"Correia","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Saldanha-da-Gama","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,16]]},"reference":[{"issue":"1","key":"472_CR1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1010949931021","volume":"102","author":"J Alcaraz","year":"2001","unstructured":"Alcaraz J, Maroto C (2001) A robust genetic algorithm for resource allocation in project scheduling. Ann Oper Res 102(1):83\u2013109","journal-title":"Ann Oper Res"},{"key":"472_CR2","doi-asserted-by":"crossref","unstructured":"Alcaraz J, Maroto C (2006) A hybrid genetic algorithm based on intelligent encoding for project scheduling. In: J\u00f3zefowska J, W\u0119glarz J (eds) Perspectives in modern project scheduling, pp 249\u2013274","DOI":"10.1007\/978-0-387-33768-5_10"},{"key":"472_CR3","unstructured":"Almeida BF, Correia I, Saldanha-da-Gama F (2015) An instance generator for the multi-skill resource-constrained project scheduling problem. Technical report, Faculdade de Ci\u00eancias da Universidade de Lisboa\u2014Centro de Matem\u00e1tica, Aplica\u00e7\u00f5es Fundamentais e Investiga\u00e7\u00e3o Operacional. Available at https:\/\/ciencias.ulisboa.pt\/sites\/default\/files\/fcul\/unidinvestig\/cmaf-cio\/SGama.pdf"},{"key":"472_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.eswa.2016.03.017","volume":"57","author":"BF Almeida","year":"2016","unstructured":"Almeida BF, Correia I, Saldanha-da-Gama F (2016) Priority-based heuristics for the multi-skill resource constrained project scheduling problem. Expert Syst Appl 57:91\u2013103","journal-title":"Expert Syst Appl"},{"issue":"1","key":"472_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker P, Drexl A, M\u00f6hring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: notation, classification, models, and methods. Eur J Oper Res 112(1):3\u201341","journal-title":"Eur J Oper Res"},{"key":"472_CR6","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/s00291-010-0233-0","volume":"34","author":"I Correia","year":"2012","unstructured":"Correia I, Louren\u00e7o LL, Saldanha-da-Gama F (2012) Project scheduling with flexible resources: formulation and inequalities. OR Spectrum 34:635\u2013663","journal-title":"OR Spectrum"},{"key":"472_CR7","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.cie.2014.03.020","volume":"72","author":"I Correia","year":"2014","unstructured":"Correia I, Saldanha-da-Gama F (2014) The impact of fixed and variable costs in a multi-skill project scheduling problem: an empirical study. Comput Ind Eng 72:230\u2013238","journal-title":"Comput Ind Eng"},{"key":"472_CR8","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/978-3-319-05443-8_25","volume-title":"Handbook on project management and scheduling","author":"I Correia","year":"2015","unstructured":"Correia I, Saldanha-da-Gama F (2015) A modeling framework for project staffing and scheduling problems. In: Schwindt C, Zimmermann J (eds) Handbook on project management and scheduling, vol 1. Springer, Berlin, pp 547\u2013564"},{"key":"472_CR9","volume-title":"Project scheduling: a research handbook","author":"EL Demeulemeester","year":"2002","unstructured":"Demeulemeester EL, Herroelen W (2002) Project scheduling: a research handbook. Springer, Berlin"},{"issue":"3","key":"472_CR10","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/j.ejor.2006.06.074","volume":"189","author":"JF Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves JF, Mendes JJ, Resende MG (2008) A genetic algorithm for the resource constrained multi-project scheduling problem. Eur J Oper Res 189(3):1171\u20131190","journal-title":"Eur J Oper Res"},{"key":"472_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10732-010-9143-1","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves JF, Resende MG (2011) Biased random-key genetic algorithms for combinatorial optimization. J Heuristics 17:487\u2013525","journal-title":"J Heuristics"},{"issue":"2","key":"472_CR12","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1016\/j.ijpe.2013.04.019","volume":"145","author":"JF Gon\u00e7alves","year":"2013","unstructured":"Gon\u00e7alves JF, Resende MG (2013) A biased random key genetic algorithm for 2D and 3D bin packing problems. Int J Prod Econ 145(2):500\u2013510","journal-title":"Int J Prod Econ"},{"issue":"1","key":"472_CR13","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.ejor.2015.04.029","volume":"246","author":"JF Gon\u00e7alves","year":"2015","unstructured":"Gon\u00e7alves JF, Resende MG (2015) A biased random-key genetic algorithm for the unequal area facility layout problem. Eur J Oper Res 246(1):86\u2013107","journal-title":"Eur J Oper Res"},{"issue":"5","key":"472_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10732-010-9142-2","volume":"17","author":"JF Gon\u00e7alves","year":"2011","unstructured":"Gon\u00e7alves JF, Resende MG, Mendes JJ (2011) A biased random-key genetic algorithm with forward\u2013backward improvement for the resource constrained project scheduling problem. J Heuristics 17(5):467\u2013486","journal-title":"J Heuristics"},{"key":"472_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10100-008-0057-z","volume":"16","author":"WJ Gutjahr","year":"2008","unstructured":"Gutjahr WJ, Katzensteiner S, Reiter P, Stummer C, Denk M (2008) Competence-driven project portfolio selection, scheduling and staff assignment. CEJOR 16:281\u2013306","journal-title":"CEJOR"},{"issue":"5","key":"472_CR16","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/nav.10029","volume":"49","author":"S Hartmann","year":"2002","unstructured":"Hartmann S (2002) A self-adapting genetic algorithm for project scheduling under resource constraints. Naval Res Log (NRL) 49(5):433\u2013448","journal-title":"Naval Res Log (NRL)"},{"issue":"1","key":"472_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.11.005","volume":"207","author":"S Hartmann","year":"2010","unstructured":"Hartmann S, Briskorn D (2010) A survey of variants and extensions of the resource-constrained project scheduling problem. Eur J Oper Res 207(1):1\u201314","journal-title":"Eur J Oper Res"},{"key":"472_CR18","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S Hartmann","year":"2000","unstructured":"Hartmann S, Kolisch R (2000) Experimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem. Eur J Oper Res 127:394\u2013407","journal-title":"Eur J Oper Res"},{"key":"472_CR19","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00291-009-0169-4","volume":"32","author":"C Heimerl","year":"2010","unstructured":"Heimerl C, Kolisch R (2010) Scheduling and staffing multiple projects with a multi-skilled workforce. OR Spectrum 32:343\u2013368","journal-title":"OR Spectrum"},{"key":"472_CR20","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0305-0548(97)00055-5","volume":"25","author":"WS Herroelen","year":"1998","unstructured":"Herroelen WS, Demeulemeester EL (1998) Resource-constrained project scheduling: a survey of recent developments. Comput Oper Res 25:279\u2013302","journal-title":"Comput Oper Res"},{"key":"472_CR21","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/S0377-2217(99)00347-1","volume":"127","author":"R Klein","year":"2000","unstructured":"Klein R (2000) Bidirectional planning: improving priority rule-based heuristics for scheduling resource-constrained projects. Eur J Oper Res 127:619\u2013638","journal-title":"Eur J Oper Res"},{"key":"472_CR22","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0272-6963(95)00032-1","volume":"14","author":"R Kolisch","year":"1996","unstructured":"Kolisch R (1996a) Efficient priority rules for the resource-constrained project scheduling problem. J Oper Manag 14:179\u2013192","journal-title":"J Oper Manag"},{"issue":"2","key":"472_CR23","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R Kolisch","year":"1996","unstructured":"Kolisch R (1996b) Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur J Oper Res 90(2):320\u2013333","journal-title":"Eur J Oper Res"},{"key":"472_CR24","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-1-4615-5533-9_7","volume-title":"Project scheduling: recent models, algorithms and applications","author":"R Kolisch","year":"1999","unstructured":"Kolisch R, Hartmann S (1999) Heuristic algorithms for solving the resource-constrained project scheduling problem: classification and computational analysis. In: Weglarz J (ed) Project scheduling: recent models, algorithms and applications. Springer, Boston, pp 147\u2013178"},{"key":"472_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.ejor.2005.01.065","volume":"174","author":"R Kolisch","year":"2006","unstructured":"Kolisch R, Hartmann S (2006) Experimental evaluation of heuristics for the resource-constrained project scheduling problem: an update. Eur J Oper Res 174:23\u201337","journal-title":"Eur J Oper Res"},{"key":"472_CR26","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10951-008-0079-3","volume":"12","author":"H Li","year":"2009","unstructured":"Li H, Womer K (2009) Scheduling projects with multi-skilled personnel by a hybrid MILP\/CP benders decomposition algorithm. J Sched 12:281\u2013298","journal-title":"J Sched"},{"key":"472_CR27","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/0377-2217(92)90320-9","volume":"56","author":"K Li","year":"1992","unstructured":"Li K, Willis R (1992) An alternative scheduling technique for resource constrained project scheduling. Eur J Oper Res 56:370\u2013379","journal-title":"Eur J Oper Res"},{"issue":"1","key":"472_CR28","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.cor.2007.07.001","volume":"36","author":"JJ Mendes","year":"2009","unstructured":"Mendes JJ, Gon\u00e7alves JF, Resende MG (2009) A random key based genetic algorithm for the resource constrained project scheduling problem. Comput Oper Res 36(1):92\u2013109","journal-title":"Comput Oper Res"},{"issue":"5","key":"472_CR29","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1287\/mnsc.44.5.714","volume":"44","author":"A Mingozzi","year":"1998","unstructured":"Mingozzi A, Maniezzo V, Ricciardelli S, Bianco L (1998) An exact algorithm for the resource-constrained project scheduling problem based on a new mathematical formulation. Manag Sci 44(5):714\u2013729","journal-title":"Manag Sci"},{"key":"472_CR30","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/5326.740669","volume":"29","author":"L \u00d6zdamar","year":"1999","unstructured":"\u00d6zdamar L (1999) A genetic algorithm approach to a general category project scheduling problem. IEEE Trans Syst Man Cybern 29:44\u201369","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"C","key":"472_CR31","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.cor.2014.11.011","volume":"57","author":"E Ruiz","year":"2015","unstructured":"Ruiz E, Albareda-Sambola M, Fern\u00e1ndez E, Resende MG (2015) A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Comput Oper Res 57(C):95\u2013108","journal-title":"Comput Oper Res"},{"issue":"C","key":"472_CR32","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.cor.2015.11.011","volume":"70","author":"M Walter","year":"2016","unstructured":"Walter M, Zimmermann J (2016) Minimizing average project team size given multi-skilled workers with heterogeneous skill levels. Comput Oper Res 70(C):163\u2013179","journal-title":"Comput Oper Res"},{"key":"472_CR33","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2010.03.037","volume":"208","author":"J W\u0119glarz","year":"2011","unstructured":"W\u0119glarz J, J\u00f3zefowska J, Mika M, Walig\u00f3ra G (2011) Project scheduling with finite or infinite number of activity processing modes\u2014a survey. Eur J Oper Res 208:177\u2013205","journal-title":"Eur J Oper Res"}],"container-title":["TOP"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11750-018-0472-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11750-018-0472-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11750-018-0472-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T17:59:50Z","timestamp":1571162390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11750-018-0472-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,16]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["472"],"URL":"https:\/\/doi.org\/10.1007\/s11750-018-0472-9","relation":{},"ISSN":["1134-5764","1863-8279"],"issn-type":[{"value":"1134-5764","type":"print"},{"value":"1863-8279","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,16]]},"assertion":[{"value":"2 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}