{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T16:13:55Z","timestamp":1774282435235,"version":"3.50.1"},"reference-count":98,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T00:00:00Z","timestamp":1282867200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10732-010-9143-1","type":"journal-article","created":{"date-parts":[[2010,8,26]],"date-time":"2010-08-26T13:26:10Z","timestamp":1282829170000},"page":"487-525","source":"Crossref","is-referenced-by-count":467,"title":["Biased random-key genetic algorithms for\u00a0combinatorial optimization"],"prefix":"10.1007","volume":"17","author":[{"given":"Jos\u00e9 Fernando","family":"Gon\u00e7alves","sequence":"first","affiliation":[]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,27]]},"reference":[{"key":"9143_CR1","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1287\/ijoc.6.2.118","volume":"6","author":"E.H.L. Aarts","year":"1994","unstructured":"Aarts, E.H.L., Van Laarhoven, P.J.M., Lenstra, J.K., Ulder, N.L.J.: A computational study of local search algorithms for job shop scheduling. INFORMS J. Comput. 6, 118\u2013125 (1994)","journal-title":"INFORMS J. Comput."},{"key":"9143_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R.M. Aiex","year":"2003","unstructured":"Aiex, R.M., Binato, S., Resende, M.G.C.: Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29, 393\u2013430 (2003)","journal-title":"Parallel Comput."},{"key":"9143_CR3","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1057\/palgrave.jors.2601829","volume":"56","author":"R. Alvarez-Valdes","year":"2005","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., Tamarit, J.M.: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. J. Oper. Res. Soc. 56, 414\u2013425 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"9143_CR4","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.ejor.2005.11.068","volume":"183","author":"R. Alvarez-Valdes","year":"2007","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., Tamarit, J.M.: A tabu search algorithm for a two-dimensional non-guillotine cutting problem. Eur. J. Oper. Res. 183, 1167\u20131182 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR5","unstructured":"Andrade, D.V., Buriol, L.S., Resende, M.G.C., Thorup, M.: Survivable composite-link IP network design with OSPF routing. In: Proceedings of The Eighth INFORMS Telecommunications Conference (2006)"},{"key":"9143_CR6","first-page":"1","volume-title":"Meta-Heurisitics: Advances and Trends in Local Search Paradigms for Optimization","author":"T. Baar","year":"1998","unstructured":"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-Heurisitics: Advances and Trends in Local Search Paradigms for Optimization, pp. 1\u20138. Kluwer, Dordrecht (1998)"},{"key":"9143_CR7","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"Bean, J.C.: Genetic algorithms and random keys for sequencing and optimization. ORSA J. Comput. 6, 154\u2013160 (1994)","journal-title":"ORSA J. Comput."},{"key":"9143_CR8","doi-asserted-by":"crossref","unstructured":"Beasley, J.E.: An exact two-dimensional non-guillotine cutting tree search procedure. Oper. Res., 49\u201364 (1985)","DOI":"10.1287\/opre.33.1.49"},{"key":"9143_CR9","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1016\/S0377-2217(03)00139-5","volume":"156","author":"J.E. Beasley","year":"2004","unstructured":"Beasley, J.E.: A population heuristic for constrained two-dimensional non-guillotine cutting. Eur. J. Oper. Res. 156, 601\u2013627 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR10","volume-title":"Essays and Surveys in Metaheuristics","author":"S. Binato","year":"2002","unstructured":"Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A GRASP for job shop scheduling. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics. Kluwer Academic, Dordrecht (2002)"},{"key":"9143_CR11","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/S0377-2217(02)00761-0","volume":"149","author":"K. Bouleimen","year":"2003","unstructured":"Bouleimen, K., Lecocq, H.: A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. Eur. J. Oper. Res. 149, 268\u2013281 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR12","unstructured":"Breslau, L., Diakonikolas, I., Duffield, N., Gu, Y., Hajiaghayi, M., Johnson, D.S., Karloff, H., Resende, M.G.C., Sen, S.: Node placement for path disjoint monitoring. Technical report, AT&T Labs Research, Shannon Laboratory, Florham Park, NJ 07932, USA (2009)"},{"key":"9143_CR13","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"L.S. Buriol","year":"2005","unstructured":"Buriol, L.S., Resende, M.G.C., Ribeiro, C.C., Thorup, M.: A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks 46, 36\u201356 (2005)","journal-title":"Networks"},{"key":"9143_CR14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1002\/net.20141","volume":"49","author":"L.S. Buriol","year":"2007","unstructured":"Buriol, L.S., Resende, M.G.C., Thorup, M.: Survivable IP network design with OSPF routing. Networks 49, 51\u201364 (2007)","journal-title":"Networks"},{"key":"9143_CR15","doi-asserted-by":"crossref","unstructured":"Buriol, L.S., Hirsch, M.J., Pardalos, P.M., Querido, T., Resende, M.G.C., Ritt, M.: A hybrid genetic algorithm for road congestion minimization. In: Proceedings of the XLI Symposium of the Brazilian Operational Research Society (XLI SBPO), Porto Seguro, Brazil (2009)","DOI":"10.1007\/s11590-010-0226-6"},{"key":"9143_CR16","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1080\/00207548708919880","volume":"25","author":"M.P. Chandrasekharan","year":"1987","unstructured":"Chandrasekharan, M.P., Rajagopalan, R.: ZODIAC\u2014an algorithm for concurrent formation of part-families and machine-cells. Int. J. Prod. Res. 25, 835\u2013850 (1987)","journal-title":"Int. J. Prod. Res."},{"key":"9143_CR17","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1080\/002075498193345","volume":"36","author":"C.H. Cheng","year":"1998","unstructured":"Cheng, C.H., Gupta, Y.P., Lee, W.H., Wong, K.F.: A TSP-based heuristic for forming machine groups and part families. Int. J. Prod. Res. 36, 1325\u20131337 (1998)","journal-title":"Int. J. Prod. Res."},{"key":"9143_CR18","doi-asserted-by":"crossref","unstructured":"Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Operations Research, 30\u201344 (1977)","DOI":"10.1287\/opre.25.1.30"},{"key":"9143_CR19","unstructured":"Debels, D., Vanhoucke, M.: A decomposition-based heuristic for the resource-constrained project scheduling problem. Technical report, Ghent University, Faculty of Economics and Business Administration, Belgium (2005)"},{"key":"9143_CR20","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1016\/j.ejor.2004.08.020","volume":"169","author":"D. Debels","year":"2006","unstructured":"Debels, D., De Reyck, B., Leus, R., Vanhoucke, M.: A hybrid scatter search\/electromagnetism meta-heuristic for project scheduling. Eur. J. Oper. Res. 169, 638\u2013653 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0305-0548(93)E0015-L","volume":"22","author":"F. Della Croce","year":"1995","unstructured":"Della Croce, F., Tadei, R., Volta, G.: A genetic algorithm for the job shop problem. Comput. Oper. Res. 22, 15\u201324 (1995)","journal-title":"Comput. Oper. Res."},{"key":"9143_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207540150208835","volume":"39","author":"C. Dimopoulos","year":"2001","unstructured":"Dimopoulos, C., Mort, N.: A hierarchical clustering methodology based on genetic programming for the solution of simple cell-formation problems. Int. J. Prod. Res. 39, 1\u201319 (2001)","journal-title":"Int. J. Prod. Res."},{"key":"9143_CR23","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0305-0548(93)E0016-M","volume":"22","author":"U. Dorndorf","year":"1995","unstructured":"Dorndorf, U., Pesch, E.: Evolution based learning in a job shop scheduling environment. Comput. Oper. Res. 22, 25\u201340 (1995)","journal-title":"Comput. Oper. Res."},{"key":"9143_CR24","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M. Ericsson","year":"2002","unstructured":"Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A genetic algorithm for the weight setting problem in OSPF routing. J. Comb. Optim. 6, 299\u2013333 (2002)","journal-title":"J. Comb. Optim."},{"key":"9143_CR25","first-page":"144","volume-title":"Algorithms, ESA\u201997","author":"S. Fekete","year":"1997","unstructured":"Fekete, S., Schepers, J.: A new exact algorithm for general orthogonal d-dimensional knapsack problems. In: Algorithms, ESA\u201997, pp. 144\u2013156. Springer, Berlin (1997)"},{"key":"9143_CR26","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Schepers, J.: A combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research, 353\u2013368 (2004)","DOI":"10.1287\/moor.1030.0079"},{"key":"9143_CR27","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"key":"9143_CR28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"9143_CR29","first-page":"225","volume-title":"Industrial Scheduling","author":"H. Fisher","year":"1963","unstructured":"Fisher, H., Thompson, G.L.: Probabilistic learning combinations of local job-shop scheduling rules. In: Muth, J.F., Thompson, G.L. (eds.) Industrial Scheduling, pp. 225\u2013251. Prentice-Hall, Englewood Cliffs (1963)"},{"key":"9143_CR30","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1016\/S0377-2217(02)00884-6","volume":"155","author":"K. Fleszar","year":"2004","unstructured":"Fleszar, K., Hindi, K.S.: Solving the resource-constrained project scheduling problem by a variable neighbourhood search. Eur. J. Oper. Res. 155, 402\u2013413 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR31","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.10076","volume":"41","author":"D. Fontes","year":"2003","unstructured":"Fontes, D., Hadjiconstantinou, E., Christofides, N.: Upper bounds for single source uncapacitated minimum concave-cost network flow problems. Networks 41, 221\u2013228 (2003)","journal-title":"Networks"},{"key":"9143_CR32","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1002\/net.20167","volume":"50","author":"D.B.M.M. Fontes","year":"2007","unstructured":"Fontes, D.B.M.M., Gon\u00e7alves, J.F.: Heuristic solutions for general concave minimum cost network flow problems. Networks 50, 67\u201376 (2007)","journal-title":"Networks"},{"key":"9143_CR33","doi-asserted-by":"crossref","first-page":"1205","DOI":"10.1016\/j.ejor.2005.03.024","volume":"174","author":"D.B.M.M. Fontes","year":"2006","unstructured":"Fontes, D.B.M.M., Hadjiconstantinou, E., Christofides, N.: A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems. Eur. J. Oper. Res. 174, 1205\u20131219 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR34","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1023\/B:COAP.0000039487.35027.02","volume":"29","author":"B. Fortz","year":"2004","unstructured":"Fortz, B., Thorup, M.: Increasing internet capacity using local search. Comput. Optim. Appl. 29, 13\u201348 (2004). Preliminary short version of this paper published as \u201cInternet Traffic Engineering by Optimizing OSPF weights,\u201d in Proc. IEEE INFOCOM 2000, The Conference on Computer Communications","journal-title":"Comput. Optim. Appl."},{"key":"9143_CR35","volume-title":"Handbook of Metaheuristics","year":"2003","unstructured":"Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. Kluwer Academic, Dordrecht (2003)"},{"key":"9143_CR36","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"9143_CR37","doi-asserted-by":"crossref","first-page":"1212","DOI":"10.1016\/j.ejor.2005.11.062","volume":"183","author":"J.F. Gon\u00e7alves","year":"2007","unstructured":"Gon\u00e7alves, J.F.: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183, 1212\u20131229 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR38","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1023\/A:1020377910258","volume":"8","author":"J.F. Gon\u00e7alves","year":"2002","unstructured":"Gon\u00e7alves, J.F., Almeida, J.: A hybrid genetic algorithm for assembly line balancing. J. Heuristics 8, 629\u2013642 (2002)","journal-title":"J. Heuristics"},{"key":"9143_CR39","first-page":"123","volume":"19","author":"J.F. Gon\u00e7alves","year":"1999","unstructured":"Gon\u00e7alves, J.F., Beir\u00e3o, N.C.: Um algoritmo gen\u00e9tico baseado em chaves aleat\u00f3rias para sequenciamento de opera\u00e7\u00f5es. Rev. Desenvolv. Investig. Oper. 19, 123\u2013137 (1999)","journal-title":"Rev. Desenvolv. Investig. Oper."},{"key":"9143_CR40","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.cie.2004.07.003","volume":"47","author":"J.F. Gon\u00e7alves","year":"2004","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: An evolutionary algorithm for manufacturing cell formation. Comput. Ind. Eng. 47, 247\u2013273 (2004)","journal-title":"Comput. Ind. Eng."},{"key":"9143_CR41","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem. J. Comb. Optim. (2010). doi: 10.1007\/s10878-009-9282-1","DOI":"10.1007\/s10878-009-9282-1"},{"key":"9143_CR42","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.ejor.2004.03.012","volume":"167","author":"J.F. Gon\u00e7alves","year":"2005","unstructured":"Gon\u00e7alves, J.F., Mendes, J.J.M., Resende, M.G.C.: A hybrid genetic algorithm for the job shop scheduling problem. Eur. J. Oper. Res. 167, 77\u201395 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR43","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1016\/j.ejor.2006.06.074","volume":"189","author":"J.F. Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves, J.F., Mendes, J.J.M., Resende, M.G.C.: A genetic algorithm for the resource constrained multi-project scheduling problem. Eur. J. Oper. Res. 189, 1171\u20131190 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR44","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C., Mendes, J.J.M.: A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem. Technical report, AT&T Labs Research J. Heuristics (2009a, to appear)","DOI":"10.1007\/s10732-010-9142-2"},{"key":"9143_CR45","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C., Silva, R.M.A.: Biased versus unbiased random key genetic algorithms: a\u00a0experimental analysis. Technical report, AT&T Labs Research (2009b)"},{"key":"9143_CR46","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","volume":"83","author":"E. Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou, E., Christofides, N.: An exact algorithm for general, orthogonal, two-dimensional knapsack problems. Eur. J. Oper. Res. 83, 39\u201356 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR47","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.ejor.2005.11.061","volume":"183","author":"E. Hadjiconstantinou","year":"2007","unstructured":"Hadjiconstantinou, E., Iori, M.: A hybrid genetic algorithm for the two-dimensional knapsack problem. Eur. J. Oper. Res. 183, 1150\u20131166 (2007a)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR48","doi-asserted-by":"crossref","first-page":"1150","DOI":"10.1016\/j.ejor.2005.11.061","volume":"183","author":"E. Hadjiconstantinou","year":"2007","unstructured":"Hadjiconstantinou, E., Iori, M.: A hybrid genetic algorithm for the two-dimensional single large object placement problem. Eur. J. Oper. Res. 183, 1150\u20131166 (2007b)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR49","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J.P. Hart","year":"1987","unstructured":"Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: an empirical study. Oper. Res. Lett. 6, 107\u2013114 (1987)","journal-title":"Oper. Res. Lett."},{"key":"9143_CR50","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/nav.10029","volume":"49","author":"S. Hartmann","year":"2002","unstructured":"Hartmann, S.: A self-adapting genetic algorithm for project scheduling under resource constraints. Nav. Res. Logist. 49, 433\u2013448 (2002)","journal-title":"Nav. Res. Logist."},{"key":"9143_CR51","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/(SICI)1520-6750(199804)45:3<279::AID-NAV3>3.0.CO;2-4","volume":"45","author":"S. Hartmann","year":"1998","unstructured":"Hartmann, S.: A competitive genetic algorithm for resource-constrained project scheduling. Nav. Res. Logist. 45, 279\u2013302 (1998)","journal-title":"Nav. Res. Logist."},{"key":"9143_CR52","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1016\/S0305-0548(98)00008-2","volume":"25","author":"M. Hifi","year":"1998","unstructured":"Hifi, M.: Exact algorithms for the guillotine strip cutting\/packing problem. Comput. Oper. Res. 25, 925\u2013940 (1998)","journal-title":"Comput. Oper. Res."},{"key":"9143_CR53","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.1080\/00207549008942835","volume":"28","author":"T.R. Hoffmann","year":"1990","unstructured":"Hoffmann, T.R.: Assembly line balancing: a set of challenging problems. Int. J. Prod. Res. 28, 1807\u20131815 (1990)","journal-title":"Int. J. Prod. Res."},{"key":"9143_CR54","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1287\/mnsc.38.1.39","volume":"38","author":"T.R. Hoffmann","year":"1992","unstructured":"Hoffmann, T.R.: EUREKA: a hybrid system for assembly line balancing. Manag. Sci. 38, 39\u201347 (1992)","journal-title":"Manag. Sci."},{"key":"9143_CR55","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1975)"},{"key":"9143_CR56","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/S0377-2217(99)00357-4","volume":"128","author":"E. Hopper","year":"2001","unstructured":"Hopper, E., Turton, B.C.H.: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. 128, 34\u201357 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR57","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0377-2217(94)00166-9","volume":"88","author":"S. Jakobs","year":"1996","unstructured":"Jakobs, S.: On genetic algorithms for the packing of polygons. Eur. J. Oper. Res. 88, 165\u2013181 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR58","unstructured":"Kochetov, Y., Stolyar, A.: Evolutionary local search with variable neighborhood for the resource constrained project scheduling problem. In: Proceedings of the 3rd International Workshop of Computer Science and Information Technologies (2003)"},{"key":"9143_CR59","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-50296-5","volume-title":"Project Scheduling Under Resource Constraints: Efficient Heuristics for Several Problem Classes","author":"R. Kolisch","year":"1995","unstructured":"Kolisch, R.: Project Scheduling Under Resource Constraints: Efficient Heuristics for Several Problem Classes. Physica-Verlag, Heidelburg (1995)"},{"key":"9143_CR60","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/0377-2217(95)00357-6","volume":"90","author":"R. Kolisch","year":"1996","unstructured":"Kolisch, R.: Serial and parallel resource-constrained project scheduling methods revisited: theory and computation. Eur. J. Oper. Res. 90, 320\u2013333 (1996a)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR61","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0272-6963(95)00032-1","volume":"14","author":"R. Kolisch","year":"1996","unstructured":"Kolisch, R.: Efficient priority rules for the resource-constrained project scheduling problem. J. Oper. Manag. 14, 179\u2013192 (1996b)","journal-title":"J. Oper. Manag."},{"key":"9143_CR62","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/(SICI)1520-6750(199602)43:1<23::AID-NAV2>3.0.CO;2-P","volume":"43","author":"R. Kolisch","year":"1996","unstructured":"Kolisch, R., Drexl, A.: Adaptative search for solving hard project scheduling problems. Nav. Res. Logist. 43, 23\u201340 (1996)","journal-title":"Nav. Res. Logist."},{"key":"9143_CR63","doi-asserted-by":"crossref","first-page":"1693","DOI":"10.1287\/mnsc.41.10.1693","volume":"41","author":"R. Kolisch","year":"1995","unstructured":"Kolisch, R., Sprecher, A., Drexl, A.: Characterization and generation of a general class of resource-constrained project scheduling problems. Manag. Sci. 41, 1693\u20131703 (1995)","journal-title":"Manag. Sci."},{"key":"9143_CR64","first-page":"130","volume":"4","author":"K.K. Lai","year":"1997","unstructured":"Lai, K.K., Chan, W.M.: An evolutionary algorithm for the rectangular cutting stock problem. Int. J. Ind. Eng. 4, 130\u2013139 (1997)","journal-title":"Int. J. Ind. Eng."},{"key":"9143_CR65","unstructured":"Lawrence, S.: Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques. Technical report, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA (1984)"},{"key":"9143_CR66","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01719262","volume":"17","author":"V.J. Leon","year":"1995","unstructured":"Leon, V.J., Ramamoorthy, B.: Strength and adaptability of problem-space based neighborhoods for resource constrained scheduling. OR Spektrum 17, 173\u2013182 (1995)","journal-title":"OR Spektrum"},{"key":"9143_CR67","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/S0377-2217(02)00218-7","volume":"145","author":"T.W. Leung","year":"2003","unstructured":"Leung, T.W., Chan, C.K., Troutt, M.D.: Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 145, 530\u2013542 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR68","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(96)00062-8","volume":"96","author":"G. Li","year":"1997","unstructured":"Li, G.: Single machine earliness and tardiness scheduling. Eur. J. Oper. Res. 96, 546\u2013558 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR69","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.cor.2007.07.001","volume":"36","author":"J.J.M. Mendes","year":"2009","unstructured":"Mendes, J.J.M., Gon\u00e7alves, J.F., Resende, M.G.C.: A random key based genetic algorithm for the resource constrained project scheduling problem. Comput. Oper. Res. 36, 92\u2013109 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9143_CR70","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/mnsc.49.3.330.12737","volume":"49","author":"R.H. M\u00f6hring","year":"2003","unstructured":"M\u00f6hring, R.H., Schulz, A.S., Stork, F., Uetz, M.: Solving project scheduling problems by minimum cut computations. Manag. Sci. 49, 330\u2013350 (2003)","journal-title":"Manag. Sci."},{"key":"9143_CR71","doi-asserted-by":"crossref","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.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp.\u00a0557\u2013588. Kluwer Academic, Dordrecht (2002)"},{"key":"9143_CR72","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.ejor.2004.09.007","volume":"171","author":"T.F. Noronha","year":"2006","unstructured":"Noronha, T.F., Ribeiro, C.C.: Routing and wavelength assign by partition coloring. Eur. J. Oper. Res. 171, 797\u2013810 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR73","doi-asserted-by":"crossref","unstructured":"Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: A biased random-key genetic algorithm for routing and wavelength assignment. Technical report, AT&T Labs Research, Florham Park, NJ 07932 (2010)","DOI":"10.1007\/s10898-010-9608-7"},{"key":"9143_CR74","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E. Nowicki","year":"1996","unstructured":"Nowicki, E., Smutnicki, C.: A fast taboo search algorithm for the job shop problem. Manag. Sci. 42, 797\u2013813 (1996)","journal-title":"Manag. Sci."},{"key":"9143_CR75","unstructured":"Oliveira, J.F.: Private communication (2004)"},{"key":"9143_CR76","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/S0360-8352(00)00074-7","volume":"39","author":"G.C. Onwubolu","year":"2001","unstructured":"Onwubolu, G.C., Mutingi, M.: A genetic algorithm approach to cellular manufacturing systems. Comput. Ind. Eng. 39, 125\u2013144 (2001)","journal-title":"Comput. Ind. Eng."},{"key":"9143_CR77","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1023\/B:ANOR.0000039521.26237.62","volume":"131","author":"M. Palpant","year":"2004","unstructured":"Palpant, M., Artigues, C., Michelon, P.: LSSPER: solving the resource-constrained project scheduling problem with large neighbourhood search. Ann. Oper. Res. 131, 237\u2013257 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9143_CR78","volume-title":"Handbook of Applied Optimization","year":"2002","unstructured":"Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization. Oxford University Press, Oxford (2002)"},{"key":"9143_CR79","doi-asserted-by":"crossref","unstructured":"Reis, R., Ritt, M., Buriol, L.S., Resende, M.G.C.: A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion. Technical report, AT&T Labs Research, Florham Park, NJ 07932. Int. Trans. Oper. Res. (2011, to appear)","DOI":"10.1111\/j.1475-3995.2010.00771.x"},{"key":"9143_CR80","unstructured":"Schirmer, A., Riesenberg, S.: Case-based reasoning and parameterized random sampling for project scheduling. Technical report, University of Kiel, Germany (1998)"},{"key":"9143_CR81","unstructured":"Scholl, A.: Data of assembly line balancing problems. Technical Report 16\/1993, Schriften zur Quantitativen Betriebswirtschaftslehre, TU Darmstadt (1993)"},{"key":"9143_CR82","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF00127358","volume":"2","author":"A. Scholl","year":"1997","unstructured":"Scholl, A., Vo\u00df, S.: Simple assembly line balancing\u2014Heuristic approaches. J. Heuristics 2, 217\u2013244 (1997)","journal-title":"J. Heuristics"},{"key":"9143_CR83","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.ejor.2006.01.003","volume":"177","author":"N. Skorin-Kapov","year":"2007","unstructured":"Skorin-Kapov, N.: Routing and wavelength assignment in optical networks using bin packing based algorithms. Eur. J. Oper. Res. 177, 1167\u20131179 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR84","unstructured":"Spears, W.M., DeJong, K.A.: On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp.\u00a0230\u2013236 (1991)"},{"key":"9143_CR85","doi-asserted-by":"crossref","first-page":"2149","DOI":"10.1080\/00207549408957064","volume":"32","author":"G. Srinivasan","year":"1994","unstructured":"Srinivasan, G.: A clustering algorithm for machine cell formation in group technology using minimum spanning trees. Int. J. Prod. Res. 32, 2149\u20132158 (1994)","journal-title":"Int. J. Prod. Res."},{"key":"9143_CR86","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1080\/00207549108930083","volume":"29","author":"G. Srinivasan","year":"1991","unstructured":"Srinivasan, G., Narendran, T.T.: GRAFICS\u2014a nonhierarchical clustering algorithm for group technology. Int. J. Prod. Res. 29, 463\u2013478 (1991)","journal-title":"Int. J. Prod. Res."},{"key":"9143_CR87","doi-asserted-by":"crossref","unstructured":"Storer, R.H., Wu, S.D., Park, I.: Genetic algorithms in problem space for sequencing problems. In: Proceedings of a Joint US-German Conference on Operations Research in Production Planning and Control, pp.\u00a0584\u2013597 (1992)","DOI":"10.1007\/978-3-642-78063-9_36"},{"key":"9143_CR88","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1287\/mnsc.32.4.430","volume":"32","author":"F.B. Talbot","year":"1986","unstructured":"Talbot, F.B., Patterson, J.H., Gehrlein, W.V.: A comparative evaluation of heuristic line balancing techniques. Manag. Sci. 32, 430\u2013454 (1986)","journal-title":"Manag. Sci."},{"key":"9143_CR89","unstructured":"Tormos, P., Lova, A.: Integrating heuristics for resource constrained project scheduling: one step forward. Technical report, Department of Statistics and Operations Research, Universidad Politecnica de Valencia (2003)"},{"key":"9143_CR90","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1504\/EJIE.2007.015391","volume":"1","author":"J.M.S. Valente","year":"2007","unstructured":"Valente, J.M.S.: Heuristics for the single machine scheduling problem with early and quadratic tardy penalties. Eur. J. Ind. Eng. 1, 431\u2013448 (2007)","journal-title":"Eur. J. Ind. Eng."},{"key":"9143_CR91","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1142\/S0217595909002225","volume":"26","author":"J.M.S. Valente","year":"2009","unstructured":"Valente, J.M.S.: Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs. Asia-Pac. J. Oper. Res. 26, 319\u2013339 (2009)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"9143_CR92","doi-asserted-by":"crossref","first-page":"3696","DOI":"10.1016\/j.cor.2007.04.006","volume":"35","author":"J.M.S. Valente","year":"2008","unstructured":"Valente, J.M.S., Gon\u00e7alves, J.F.: A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput. Oper. Res. 35, 3696\u20133713 (2008)","journal-title":"Comput. Oper. Res."},{"key":"9143_CR93","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1142\/S0217595906000978","volume":"23","author":"J.M.S. Valente","year":"2006","unstructured":"Valente, J.M.S., Gon\u00e7alves, J.F., Alves, R.A.F.S.: A hybrid genetic algorithm for the early\/tardy scheduling problem. Asia-Pac. J. Oper. Res. 23, 393\u2013405 (2006)","journal-title":"Asia-Pac. J. Oper. Res."},{"key":"9143_CR94","unstructured":"Valls, V., Ballestin, J., Quintanilla, M.S.: A hybrid genetic algorithm for the RCPSP. Technical report, Department of Statistics and Operations Research, University of Valencia (2003)"},{"key":"9143_CR95","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/B:ANOR.0000039524.09792.c9","volume":"131","author":"V. Valls","year":"2004","unstructured":"Valls, V., Ballestin, F., Quintanilla, M.S.: A population-based approach to the resource-constrained project scheduling problem. Ann. Oper. Res. 131, 305\u2013324 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9143_CR96","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/j.ejor.2004.04.008","volume":"165","author":"V. Valls","year":"2005","unstructured":"Valls, V., Ballestin, F., Quintanilla, M.S.: Justification and RCPSP: a\u00a0technique that pays. Eur. J. Oper. Res. 165, 375\u2013386 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9143_CR97","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/S0305-0548(99)00137-9","volume":"28","author":"L. Wang","year":"2001","unstructured":"Wang, L., Zheng, D.Z.: An effective hybrid optimization strategy for job-shop scheduling problems. Comput. Oper. Res. 28, 585\u2013596 (2001)","journal-title":"Comput. Oper. Res."},{"key":"9143_CR98","doi-asserted-by":"crossref","unstructured":"Wang, P.Y.: Two algorithms for constrained two-dimensional cutting stock problems. Oper. Res., 573\u2013586 (1983)","DOI":"10.1287\/opre.31.3.573"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9143-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9143-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9143-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T09:32:49Z","timestamp":1636277569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9143-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,27]]},"references-count":98,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9143"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9143-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,8,27]]}}}