{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:13:55Z","timestamp":1648764835161},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T00:00:00Z","timestamp":1450915200000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10479-015-2082-3","type":"journal-article","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T17:54:58Z","timestamp":1450979698000},"page":"133-160","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast machine reassignment"],"prefix":"10.1007","volume":"242","author":[{"given":"Franck","family":"Butelle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Alfandari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Camille","family":"Coti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucian","family":"Finta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas","family":"L\u00e9tocart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard","family":"Plateau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Roupin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Rozenknop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto Wolfler","family":"Calvo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,24]]},"reference":[{"issue":"1","key":"2082_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10288-011-0182-8","volume":"10","author":"R Bai","year":"2012","unstructured":"Bai, R., Blazewicz, J., Burke, E. K., Kendall, G., & McCollum, B. (2012). A simulated annealing hyper-heuristic methodology for flexible decision support. 4OR: A Quarterly Journal of Operations Research, 10(1), 43\u201366.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"2082_CR2","doi-asserted-by":"crossref","unstructured":"Bai, R., & Kendall, G. (2005). An investigation of automated planograms using a simulated annealing based hyper-heuristic. In T. Ibaraki, K. Nonobe & M. Yagiura (Eds.), Metaheuristics: Progress as real problem solvers (pp. 87\u2013108). New York: Springer.","DOI":"10.1007\/0-387-25383-1_4"},{"key":"2082_CR3","doi-asserted-by":"publisher","unstructured":"Bilgin, B., \u00d6zcan, E., & Korkmaz, E. E. (2006). An experimental study on hyper-heuristics and exam timetabling. In Practice and theory of automated timetabling VI, 6th international conference, PATAT, Brno, Czech Republic, Revised selected papers (pp. 394\u2013412). doi: 10.1007\/978-3-540-77345-0_25 .","DOI":"10.1007\/978-3-540-77345-0_25"},{"issue":"12","key":"2082_CR4","doi-asserted-by":"crossref","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E. K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., et al. (2013). Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12), 1695\u20131724.","journal-title":"Journal of the Operational Research Society"},{"key":"2082_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., & Woodward, J. R. (2010). A classification of hyper-heuristic approaches. In M. Gendreau & J. -Y. Potvin (Eds.), Handbook of metaheuristics (pp. 449\u2013468). New York: Springer.","DOI":"10.1007\/978-1-4419-1665-5_15"},{"issue":"1","key":"2082_CR6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10479-010-0782-2","volume":"196","author":"EK Burke","year":"2012","unstructured":"Burke, E. K., Kendall, G., Misir, M., & \u00d6zcan, E. (2012). Monte carlo hyper-heuristics for examination timetabling. Annals of Operations Research, 196(1), 73\u201390.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2082_CR7","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0166-218X(00)00267-5","volume":"111","author":"A Caprara","year":"2001","unstructured":"Caprara, A., & Toth, P. (2001). Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Applied Mathematics, 111(3), 231\u2013262.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"2082_CR8","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0377-2217(92)90077-M","volume":"60","author":"DG Cattrysse","year":"1992","unstructured":"Cattrysse, D. G., & Van Wassenhove, L. N. (1992). A survey of algorithms for the generalized assignment problem. European Journal of Operational Research, 60(3), 260\u2013272.","journal-title":"European Journal of Operational Research"},{"key":"2082_CR9","doi-asserted-by":"publisher","unstructured":"Chen, Y., Das, A., Qin, W., Sivasubramaniam, A., Wang, Q., & Gautam, N. (2005). Managing server energy and operational costs in hosting centers. In Proceedings of the ACM international conference on measurement and modeling of computer systems (SIGMETRICS) (pp. 303\u2013314). doi: 10.1145\/1064212.1064253 .","DOI":"10.1145\/1064212.1064253"},{"issue":"1","key":"2082_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/0603007","volume":"3","author":"FR Chung","year":"1982","unstructured":"Chung, F. R., Garey, M. R., & Johnson, D. S. (1982). On packing two-dimensional bins. SIAM Journal on Algebraic Discrete Methods, 3(1), 66\u201376. doi: 10.1137\/0603007 .","journal-title":"SIAM Journal on Algebraic Discrete Methods"},{"key":"2082_CR11","doi-asserted-by":"crossref","unstructured":"Cowling, P., Kendall, G., & Soubeiga, E. (2001). A hyperheuristic approach to scheduling a sales summit. In E. K. Burke & W. Erben (Eds.), Practice and theory of automated timetabling III (pp. 176\u2013190). New York: Springer.","DOI":"10.1007\/3-540-44629-X_11"},{"issue":"6","key":"2082_CR12","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1023\/A:1020325926188","volume":"8","author":"TG Crainic","year":"2002","unstructured":"Crainic, T. G., & Gendreau, M. (2002). Cooperative parallel tabu search for capacitated network design. Journal of Heuristics, 8(6), 601\u2013627.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"2082_CR13","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","volume":"10","author":"TG Crainic","year":"2004","unstructured":"Crainic, T. G., Gendreau, M., Hansen, P., & Mladenovi\u0107, N. (2004). Cooperative parallel variable neighborhood search for the p-median. Journal of Heuristics, 10(3), 293\u2013314.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"2082_CR14","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1016\/j.ejor.2005.03.058","volume":"179","author":"KA Dowsland","year":"2007","unstructured":"Dowsland, K. A., Soubeiga, E., & Burke, E. K. (2007). A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation. European Journal of Operational Research, 179(3), 759\u2013774. doi: 10.1016\/j.ejor.2005.03.058 .","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2082_CR15","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1287\/mnsc.37.6.695","volume":"37","author":"B Gavish","year":"1991","unstructured":"Gavish, B., & Pirkul, H. (1991). Algorithms for the multi-resource generalized assignment problem. Management Science, 37(6), 695\u2013713. doi: 10.1287\/mnsc.37.6.695 .","journal-title":"Management Science"},{"issue":"1","key":"2082_CR16","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF02085642","volume":"50","author":"BT Han","year":"1994","unstructured":"Han, B. T., Diehr, G., & Cook, J. S. (1994). Multiple-type, two-dimensional bin packing problems: Applications and algorithms. Annals of Operations Research, 50(1), 239\u2013261. doi: 10.1007\/BF02085642 .","journal-title":"Annals of Operations Research"},{"key":"2082_CR17","volume-title":"Approximation algorithms for NP-hard problems","author":"DS Hochbaum","year":"1996","unstructured":"Hochbaum, D. S. (1996). Approximation algorithms for NP-hard problems. Boston, MA: PWS Publishing."},{"issue":"3","key":"2082_CR18","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1016\/j.ejor.2007.06.061","volume":"195","author":"T James","year":"2009","unstructured":"James, T., Rego, C., & Glover, F. (2009). A cooperative parallel tabu search algorithm for the quadratic assignment problem. European Journal of Operational Research, 195(3), 810\u2013826.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"2082_CR19","doi-asserted-by":"crossref","first-page":"2279","DOI":"10.1007\/s00500-013-1096-5","volume":"17","author":"M Kalender","year":"2013","unstructured":"Kalender, M., Kheiri, A., \u00d6zcan, E., & Burke, E. K. (2013). A greedy gradient-simulated annealing hyper-heuristic. Soft Computing, 17(12), 2279\u20132292.","journal-title":"Soft Computing"},{"key":"2082_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. New York: Springer."},{"issue":"4598","key":"2082_CR21","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220(4598), 671\u2013680.","journal-title":"Science"},{"issue":"7","key":"2082_CR22","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.cor.2003.11.023","volume":"32","author":"A Bouthillier Le","year":"2005","unstructured":"Le Bouthillier, A., & Crainic, T. G. (2005). A cooperative parallel meta-heuristic for the vehicle routing problem with time windows. Computers & Operations Research, 32(7), 1685\u20131708. doi: 10.1016\/j.cor.2003.11.023 .","journal-title":"Computers & Operations Research"},{"key":"2082_CR23","doi-asserted-by":"crossref","unstructured":"Lehre, P., & \u00d6zcan, E. (2013). A runtime analysis of simple hyper-heuristics: To mix or not to mix operators. In Proceedings of the 12th ACM workshop on foundations of genetic algorithms (pp. 97\u2013104).","DOI":"10.1145\/2460239.2460249"},{"issue":"2","key":"2082_CR24","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241\u2013252. doi: 10.1016\/S0377-2217(02)00123-6 .","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2082_CR25","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1287\/opre.48.2.256.12386","volume":"48","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., & Vigo, D. (2000). The three-dimensional bin packing problem. Operations Research, 48(2), 256\u2013267. doi: 10.1287\/opre.48.2.256.12386 .","journal-title":"Operations Research"},{"issue":"2","key":"2082_CR26","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF00999302","volume":"6","author":"K Maruyama","year":"1977","unstructured":"Maruyama, K., Chang, S., & Tang, D. (1977). A general packing algorithm for multidimensional resource requirements. International Journal of Computer & Information Sciences, 6(2), 131\u2013149. doi: 10.1007\/BF00999302 .","journal-title":"International Journal of Computer & Information Sciences"},{"key":"2082_CR27","doi-asserted-by":"publisher","first-page":"2589","DOI":"10.1016\/j.cor.2005.10.001","volume":"34","author":"FK Miyazawa","year":"2007","unstructured":"Miyazawa, F. K., & Wakabayashi, Y. (2007). Two- and three-dimensional parametric packing. Computers and Operations Research, 34, 2589\u20132603. doi: 10.1016\/j.cor.2005.10.001 .","journal-title":"Computers and Operations Research"},{"key":"2082_CR28","first-page":"131","volume":"39","author":"K Nonobe","year":"2001","unstructured":"Nonobe, K., & Ibaraki, T. (2001). An improved tabu search method for the weighted constraint satisfaction problem. INFOR: Information Systems and Operational Research, 39, 131\u2013151.","journal-title":"INFOR: Information Systems and Operational Research"},{"key":"2082_CR29","doi-asserted-by":"crossref","unstructured":"Ouelhadj, D., & Petrovic, S. (2008). A cooperative distributed hyper-heuristic framework for scheduling. In IEEE international conference on systems, man and cybernetics (SMC) (pp. 2560\u20132565). IEEE.","DOI":"10.1109\/ICSMC.2008.4811681"},{"issue":"2","key":"2082_CR30","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1016\/j.ejor.2005.09.014","volume":"176","author":"DW Pentico","year":"2007","unstructured":"Pentico, D. W. (2007). Assignment problems: A golden anniversary survey. European Journal of Operational Research, 176(2), 774\u2013793. doi: 10.1016\/j.ejor.2005.09.014 .","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"2082_CR31","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403\u20132435.","journal-title":"Computers & Operations Research"},{"issue":"3","key":"2082_CR32","doi-asserted-by":"publisher","first-page":"1304","DOI":"10.1016\/j.ejor.2005.11.064","volume":"183","author":"J Puchinger","year":"2007","unstructured":"Puchinger, J., & Raidl, G. R. (2007). Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research, 183(3), 1304\u20131327. doi: 10.1016\/j.ejor.2005.11.064 .","journal-title":"European Journal of Operational Research"},{"key":"2082_CR33","doi-asserted-by":"publisher","unstructured":"Rattadilok, P., Gaw, A., & Kwan, R. (2005). Distributed choice function hyper-heuristics for timetabling and scheduling. In E. Burke & M. Trick (Eds.), Practice and theory of automated timetabling V, Lecture notes in computer science (Vol. 3616, pp. 51\u201367). Berlin, Heidelberg: Springer. doi: 10.1007\/11593577_4 .","DOI":"10.1007\/11593577_4"},{"issue":"13","key":"2082_CR34","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0166-218X(99)00224-3","volume":"103","author":"HE Romeijn","year":"2000","unstructured":"Romeijn, H. E., & Morales, D. R. (2000). A class of greedy algorithms for the generalized assignment problem. Discrete Applied Mathematics, 103(13), 209\u2013235. doi: 10.1016\/S0166-218X(99)00224-3 .","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"2082_CR35","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40(4), 455\u2013472. doi: 10.1287\/trsc.1050.0135 .","journal-title":"Transportation Science"},{"issue":"1","key":"2082_CR36","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0305-0548(94)90059-0","volume":"21","author":"FCR Spieksma","year":"1994","unstructured":"Spieksma, F. C. R. (1994). A branch-and-bound algorithm for the two-dimensional vector packing problem. Computers & Operations Research, 21(1), 19\u201325. doi: 10.1016\/0305-0548(94)90059-0 .","journal-title":"Computers & Operations Research"},{"key":"2082_CR37","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V. V. (2001). Approximation algorithms. New York: Springer."},{"key":"2082_CR38","unstructured":"Wood, T., Shenoy, P. J., Venkataramani, A., & Yousif, M. S. (2007). Black-box and gray-box strategies for virtual machine migration. In Proceedings of the 4th USENIX conference on Networked systems design and implementation (NSDI\u201907) (Vol. 7, pp. 229\u2013242)."},{"issue":"2","key":"2082_CR39","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.1030.0036","volume":"16","author":"M Yagiura","year":"2004","unstructured":"Yagiura, M., Ibaraki, T., & Glover, F. (2004a). An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing, 16(2), 133\u2013151. doi: 10.1287\/ijoc.1030.0036 .","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"2082_CR40","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.ejor.2004.08.015","volume":"169","author":"M Yagiura","year":"2006","unstructured":"Yagiura, M., Ibaraki, T., & Glover, F. (2006). A path relinking approach with ejection chains for the generalized assignment problem. European Journal of Operational Research, 169(2), 548\u2013569. doi: 10.1016\/j.ejor.2004.08.015 .","journal-title":"European Journal of Operational Research"},{"key":"2082_CR41","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2004.03.005","volume":"1","author":"M Yagiura","year":"2004","unstructured":"Yagiura, M., Iwasaki, S., Ibaraki, T., & Glover, F. (2004). A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem. Discrete Optimization, 1, 87\u201398. doi: 10.1016\/j.disopt.2004.03.005 .","journal-title":"Discrete Optimization"},{"key":"2082_CR42","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1080\/10556789808805722","volume":"10","author":"M Yagiura","year":"1998","unstructured":"Yagiura, M., Yamaguchi, T., & Ibaraki, T. (1998). A variable depth search algorithm with branching search for the generalized assignment problem. Optimization Methods and Software, 10, 419\u2013441. doi: 10.1080\/10556789808805722 .","journal-title":"Optimization Methods and Software"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2082-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2082-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2082-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:17Z","timestamp":1559153357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2082-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,24]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["2082"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2082-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,24]]}}}