{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:03:57Z","timestamp":1648998237494},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T00:00:00Z","timestamp":1443052800000},"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-2002-6","type":"journal-article","created":{"date-parts":[[2015,9,24]],"date-time":"2015-09-24T16:54:05Z","timestamp":1443113645000},"page":"115-132","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An optimization-based heuristic for the machine reassignment problem"],"prefix":"10.1007","volume":"242","author":[{"given":"Mehdi","family":"Mrad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anis","family":"Gharbi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Haouari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Kharbeche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,24]]},"reference":[{"issue":"3","key":"2002_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391\u2013401.","journal-title":"Management Science"},{"issue":"1","key":"2002_CR2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/trsc.1070.0204","volume":"42","author":"C Archetti","year":"2008","unstructured":"Archetti, C., Speranza, M. G., & Savelsbergh, M. W. P. (2008). An optimization-based heuristic for the split delivery vehicle routing problem. Transportation Science, 42(1), 22\u201331.","journal-title":"Transportation Science"},{"key":"2002_CR3","unstructured":"Baykasoglu, A., Ozbakir, L., & Tapkan, P. (2007). Artificial bee colony algorithm and its application to generalized assignment problem. Swarm Intelligence: Focus on Ant and Particle Swarm Optimization, 113\u2013144."},{"key":"2002_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-642-04918-7_13","volume-title":"Hybrid metaheuristics","author":"MA Boschetti","year":"2009","unstructured":"Boschetti, M. A., Maniezzo, V., Roffilli, M., & R\u00f6hler, A. B. (2009). Matheuristics: Optimization, simulation and control. Hybrid metaheuristics (pp. 171\u2013177). Berlin: Springer."},{"issue":"3","key":"2002_CR5","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":"2002_CR6","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2009.06.035","volume":"202","author":"J Carlier","year":"2010","unstructured":"Carlier, J., Haouari, M., Kharbeche, M., & Moukrim, A. (2010). An optimization-based heuristic for the robotic cell problem. European Journal of Operational Research, 202(3), 636\u2013645.","journal-title":"European Journal of Operational Research"},{"key":"2002_CR7","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/2425248.2425269","volume":"40","author":"P Cremonesi","year":"2012","unstructured":"Cremonesi, P., & Sansottera, A. (2012). Modeling response times in the Google ROADEF\/EURO Challenge. Performance Evaluation Review, 40, 80\u201382.","journal-title":"Performance Evaluation Review"},{"issue":"1","key":"2002_CR8","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.future.2011.05.022","volume":"28","author":"AJ Ferrer","year":"2012","unstructured":"Ferrer, A. J., Hern\u00e1Ndez, F., Tordsson, J., Elmroth, E., Ali-Eldin, A., Zsigri, C., et al. (2012). OPTIMIS: A holistic approach to cloud service provisioning. Future Generation Computer Systems, 28(1), 66\u201377.","journal-title":"Future Generation Computer Systems"},{"key":"2002_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.endm.2012.10.028","volume":"39","author":"H Gavranovi\u0107","year":"2012","unstructured":"Gavranovi\u0107, H., Buljubasi\u0107, M., & Demirovi\u0107, E. (2012). Variable neighborhood search for google machine reassignment problem. Electronic Notes in Discrete Mathematics, 39, 209\u2013216.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2002_CR10","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1016\/j.cor.2005.05.012","volume":"34","author":"A Gharbi","year":"2007","unstructured":"Gharbi, A., & Haouari, M. (2007). An approximate decomposition algorithm for scheduling on parallel machines with heads and tails. Computers and Operations Research, 34, 868\u2013883.","journal-title":"Computers and Operations Research"},{"key":"2002_CR11","unstructured":"Google roadef\/euro challenge. (2012). Final results. http:\/\/challenge.roadef.org\/2012\/en\/results.php ."},{"key":"2002_CR12","unstructured":"Google roadef\/euro challenge. (2012). Machine reassignment. http:\/\/challenge.roadef.org\/2012\/files\/problem_definition_v1 ."},{"issue":"1","key":"2002_CR13","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0377-2217(02)00710-5","volume":"153","author":"S Haddadi","year":"2004","unstructured":"Haddadi, S., & Ouzia, H. (2004). Effective algorithm and heuristic for the generalized assignment problem. European Journal of Operational Research, 153(1), 184\u2013190.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2002_CR14","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1111\/j.1475-3995.2006.00562.x","volume":"13","author":"M Haouari","year":"2006","unstructured":"Haouari, M., Gharbi, A., & Jemmali, M. (2006). Tight bounds for the identical parallel machine scheduling problem. International Transactions in Operational Research, 13(6), 529\u2013548.","journal-title":"International Transactions in Operational Research"},{"issue":"1","key":"2002_CR15","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0167-6377(02)00173-6","volume":"31","author":"H Kellerer","year":"2003","unstructured":"Kellerer, H., & Kotov, V. (2003). An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Operations Research Letters, 31(1), 35\u201341.","journal-title":"Operations Research Letters"},{"key":"2002_CR16","first-page":"128","volume-title":"CPAIOR 2013 LNCS","author":"B Kell","year":"2013","unstructured":"Kell, B., & van Hoeve, W.-J. (2013). An MDD approach to multidimensional bin packing. In C. Gomes & M. Sellmann (Eds.), CPAIOR 2013 LNCS (Vol. 7874, pp. 128\u2013143). Heidelberg: Springer."},{"key":"2002_CR17","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/978-3-642-38171-3_12","volume-title":"Integration of AI and OR techniques in constraint programming for combinatorial optimization problems","author":"Y Malitsky","year":"2013","unstructured":"Malitsky, Y., Mehta, D., O\u2019Sullivan, B., & Simonis, H. (2013). Tuning parameters of large neighborhood search for the machine reassignment problem. Integration of AI and OR techniques in constraint programming for combinatorial optimization problems (pp. 176\u2013192). Berlin: Springer."},{"key":"2002_CR18","doi-asserted-by":"crossref","first-page":"5266","DOI":"10.1016\/j.eswa.2013.03.037","volume":"40","author":"R Masson","year":"2013","unstructured":"Masson, R., Vidal, T., Michallet, J., Penna, P. H. V., Petrucci, V., Subramanian, A., et al. (2013). An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Systems with Applications, 40, 5266\u20135275.","journal-title":"Expert Systems with Applications"},{"issue":"8","key":"2002_CR19","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1287\/mnsc.44.8.1100","volume":"44","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra, A., Johnson, E. L., & Nemhauser, G. L. (1998). An optimization based heuristic for political districting. Management Science, 44(8), 1100\u20131114.","journal-title":"Management Science"},{"key":"2002_CR20","doi-asserted-by":"crossref","unstructured":"Mehta, D., Sullivan, B. \u00d3., & Simonis, H. (2012). Comparing solution methods for the machine reassignment problem. In Lecture notes in computer science: principles and practice of constraint programming (pp. 782\u2013797).","DOI":"10.1007\/978-3-642-33558-7_56"},{"key":"2002_CR21","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/978-3-642-40627-0_39","volume-title":"Principles and practice of constraint programming","author":"MD Moffitt","year":"2013","unstructured":"Moffitt, M. D. (2013). Multidimensional bin packing revisited. Principles and practice of constraint programming (pp. 513\u2013528). Berlin: Springer."},{"issue":"1","key":"2002_CR22","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1287\/ijoc.1040.0089","volume":"18","author":"M Monaci","year":"2006","unstructured":"Monaci, M., & Toth, P. (2006). A set-covering-based heuristic approach for bin-packing problems. INFORMS Journal on Computing, 18(1), 71\u201385.","journal-title":"INFORMS Journal on Computing"},{"key":"2002_CR23","unstructured":"Nauss, R. M. (2006). The generalized assignment problem. Integer Programming: Theory and Practice, 39\u201355."},{"key":"2002_CR24","unstructured":"Panigrahy, R., Talwar, K., Uyeda, L., & Wieder, U. (2011). Heuristics for vector bin packing. Microsoft: Technical Report."},{"key":"2002_CR25","doi-asserted-by":"crossref","unstructured":"Petrucci, V., Carrera, E. V., Loques, O., Leite, J. C. B., & Mosse, D. (2011). Optimized management of power and performance for virtualized heterogeneous server clusters. In Cluster, cloud and grid computing (CCGrid), 2011 11th IEEE\/ACM international symposium on (pp. 23\u201332). IEEE.","DOI":"10.1109\/CCGrid.2011.15"},{"key":"2002_CR26","volume-title":"An algorithmic study of the machine reassignment problem","author":"GM Portal","year":"2012","unstructured":"Portal, G. M. (2012). An algorithmic study of the machine reassignment problem. Porto Alegre: Universidade Federal do Rio Grande do Sul."},{"issue":"1","key":"2002_CR27","doi-asserted-by":"crossref","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(1), 209\u2013235.","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"2002_CR28","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M Savelsbergh","year":"1997","unstructured":"Savelsbergh, M. (1997). A branch-and-price algorithm for the generalized assignment problem. Operations Research, 45(6), 831\u2013841.","journal-title":"Operations Research"},{"issue":"1","key":"2002_CR29","doi-asserted-by":"crossref","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 and Operations Research, 21(1), 19\u201325.","journal-title":"Computers and Operations Research"},{"key":"2002_CR30","unstructured":"Wauters, T. (2012). Reinforcement learning enhanced heuristic search for combinatorial optimization. University of Maastricht, The Netherlands, Ph.D. Dissertation (2012)."},{"key":"2002_CR31","doi-asserted-by":"crossref","unstructured":"Wilcox, D., McNabb, A., & Seppi, K. (2011). Solving virtual machine packing with a reordering grouping genetic algorithm. In IEEE congress on evolutionary computation (CEC), pp. 362\u2013369.","DOI":"10.1109\/CEC.2011.5949641"},{"issue":"2","key":"2002_CR32","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.1030.0036","volume":"16","author":"M Yagiura","year":"2004","unstructured":"Yagiura, M., Ibaraki, T., & Glover, F. (2004). An ejection chain approach for the generalized assignment problem. INFORMS Journal on Computing, 16(2), 133\u2013151.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"2002_CR33","doi-asserted-by":"crossref","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.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2002-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2002-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2002-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:10:03Z","timestamp":1559139003000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2002-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,24]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["2002"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2002-6","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,24]]}}}