{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T08:21:30Z","timestamp":1761985290574,"version":"build-2065373602"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,1,13]],"date-time":"2015-01-13T00:00:00Z","timestamp":1421107200000},"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-014-1771-7","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T10:02:47Z","timestamp":1421056967000},"page":"93-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Simulated annealing for the machine reassignment problem"],"prefix":"10.1007","volume":"242","author":[{"given":"Gabriel M.","family":"Portal","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Ritt","sequence":"additional","affiliation":[]},{"given":"Leonardo M.","family":"Borba","sequence":"additional","affiliation":[]},{"given":"Luciana S.","family":"Buriol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,13]]},"reference":[{"key":"1771_CR1","unstructured":"Brandt, F., V\u00f6lker, M., & Speck, J. (2012). Constraint-based large neighborhood search for machine reassignment. In 25th European conference on operational research, Vilnius."},{"key":"1771_CR2","unstructured":"Burke, E. K., & Bykov, Y. (2012). The late acceptance hill-climbing heuristic. Tech. Rep. CSM-192, Computing Science and Mathematics, University of Stirling."},{"key":"1771_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V Cerny","year":"1985","unstructured":"Cerny, V. (1985). Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45, 41\u201351.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"1771_CR4","doi-asserted-by":"publisher","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. Eletronic Notes in Discrete Mathematics, 39, 209\u2013216. doi: 10.1016\/j.endm.2012.10.028 .","journal-title":"Eletronic Notes in Discrete Mathematics"},{"key":"1771_CR5","unstructured":"Google Inc. (2011). Google ROADEF\/EURO challenge 2011\u20132012: Machine reassignment. http:\/\/challenge.roadef.org\/2012\/files\/problem_definition_v1.pdf , version 1"},{"key":"1771_CR6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","volume":"13","author":"B Hajek","year":"1988","unstructured":"Hajek, B. (1988). Cooling schedules for optimal annealing. Mathematics of Operations Research, 13, 311\u2013329.","journal-title":"Mathematics of Operations Research"},{"key":"1771_CR7","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"DS Johnson","year":"1989","unstructured":"Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1989). Optimization by simulated annealing. Part I, Graph partitioning. Operations Research, 37, 865\u2013892.","journal-title":"Operations Research"},{"key":"1771_CR8","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, 671\u2013680.","journal-title":"Science"},{"key":"1771_CR9","unstructured":"Lopes, R., Morais, V. W., Noronha, T. F., & Souza, V. A. A. (2014). Heuristics and matheuristics for a real-life machine reassignment problem. International Transactions in Operational Research, 1\u201319."},{"key":"1771_CR10","doi-asserted-by":"crossref","unstructured":"Malitsky, Y., Mehta, D., O\u2019Sullivan, B., Simonis, H. (2013). Tuning parameters of large neighborhood search for the machine reassignment problem. In Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, pp. 176\u2013192.","DOI":"10.1007\/978-3-642-38171-3_12"},{"key":"1771_CR11","doi-asserted-by":"crossref","first-page":"5266","DOI":"10.1016\/j.eswa.2013.03.037","volume":"40","author":"R Masson","year":"2012","unstructured":"Masson, R., Vidal, T., Michallet, J., Penna, P. H. V., Petrucci, V., Subramanian, A., et al. (2012). 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"},{"key":"1771_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., & Nishimura, T. (1998). Mersenne twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation, 8, 3\u201330.","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"key":"1771_CR13","doi-asserted-by":"crossref","unstructured":"Mehta, D., OSullivan, B., & Simonis, H. (2012a). Comparing solution methods for the machine reassignment problem. In Principles and practice of constraint programming, pp. 782\u2013797.","DOI":"10.1007\/978-3-642-33558-7_56"},{"key":"1771_CR14","unstructured":"Mehta, D., O\u2019Sullivan, B., & Simonis, H. (2012b). Team S38 Google ROADEF challenge 2012. In European conference on operational research."},{"key":"1771_CR15","unstructured":"P\u00e9cot, M. (2012). Team S34 Google ROADEF challenge 2012."},{"key":"1771_CR16","volume-title":"Team J33 Google ROADEF challenge 2012","author":"A Sansottera","year":"2012","unstructured":"Sansottera, A., Ferrucci, L., Sironi, F., & Calcavecchia, N. (2012). Team J33 Google ROADEF challenge 2012. Italy: Politecnico di Milano."},{"key":"1771_CR17","volume-title":"Team S14 Google ROADEF challenge 2012","author":"N Teypaz","year":"2012","unstructured":"Teypaz, N. (2012). Team S14 Google ROADEF challenge 2012. France: Probayes SAS."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1771-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1771-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1771-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T15:03:45Z","timestamp":1566227025000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1771-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,13]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1771"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1771-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2015,1,13]]}}}