{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T22:52:53Z","timestamp":1761519173161,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501260"},{"type":"electronic","value":"9783319501277"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50127-7_13","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T01:04:06Z","timestamp":1480381446000},"page":"163-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Parallel Late Acceptance Hill-Climbing Algorithm for the Google Machine Reassignment Problem"],"prefix":"10.1007","author":[{"given":"Ayad","family":"Turky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nasser R.","family":"Sabar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andy","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,29]]},"reference":[{"key":"13_CR1","unstructured":"ROADEF\/EURO challenge: Machine reassignment (2011). http:\/\/challenge.roadef.org\/2012\/en\/"},{"issue":"4","key":"13_CR2","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1145\/1721654.1721672","volume":"53","author":"M Armbrust","year":"2010","unstructured":"Armbrust, M., Fox, A., Griffith, R., Joseph, A.D., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I., et al.: A view of cloud computing. Commun. ACM 53(4), 50\u201358 (2010)","journal-title":"Commun. ACM"},{"key":"13_CR3","first-page":"1","volume":"242","author":"F Brandt","year":"2012","unstructured":"Brandt, F., Speck, J., V\u00f6lker, M.: Constraint-based large neighborhood search for machine reassignment. Ann. Oper. Res. 242, 1\u201329 (2012)","journal-title":"Ann. Oper. Res."},{"key":"13_CR4","unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: PATAT 2008 Conference, Montreal, Canada (2008)"},{"key":"13_CR5","unstructured":"Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. University of Stirling. Technical report (2012)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.995","volume":"41","author":"RN Calheiros","year":"2011","unstructured":"Calheiros, R.N., Ranjan, R., Beloglazov, A., De Rose, C.A., Buyya, R.: Cloudsim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw. Pract. Exp. 41(1), 23\u201350 (2011)","journal-title":"Softw. Pract. Exp."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-1-4419-1665-5_17","volume-title":"Handbook of metaheuristics","author":"TG Crainic","year":"2010","unstructured":"Crainic, T.G., Toulouse, M.: Parallel meta-heuristics. In: Gendreau, M., Potvin, J.-Y. (eds.) Handbook of metaheuristics, vol. 146, pp. 497\u2013541. Springer, US (2010). doi:10.1007\/978-1-4419-1665-5_17"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s11047-012-9360-7","volume":"12","author":"J Dom\u00ednguez","year":"2013","unstructured":"Dom\u00ednguez, J., Alba, E.: Dealing with hardware heterogeneity: a new parallel search model. Natural Comput. 12(2), 179\u2013193 (2013)","journal-title":"Natural Comput."},{"key":"13_CR9","first-page":"1","volume":"19","author":"GHG Fonseca","year":"2015","unstructured":"Fonseca, G.H.G., Santos, H.G., Carrano, E.G.: Late acceptance hill-climbing for high school timetabling. J. Sched. 19, 1\u201313 (2015)","journal-title":"J. Sched."},{"issue":"10","key":"13_CR10","doi-asserted-by":"publisher","first-page":"2044","DOI":"10.1016\/j.ins.2009.12.010","volume":"180","author":"S Garc\u00eda","year":"2010","unstructured":"Garc\u00eda, S., Fern\u00e1ndez, A., Luengo, J., Herrera, F.: Advanced nonparametric tests for multiple comparisons in the design of experiments in computational intelligence and data mining: experimental analysis of power. Inf. Sci. 180(10), 2044\u20132064 (2010)","journal-title":"Inf. Sci."},{"key":"13_CR11","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., Buljuba\u0161i\u0107, M., Demirovi\u0107, E.: Variable neighborhood search for Google Machine Reassignment Problem. Electron. Notes Discrete Math. 39, 209\u2013216 (2012)","journal-title":"Electron. Notes Discrete Math."},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-41019-2_13","volume-title":"Computational Logistics","author":"A Goerler","year":"2013","unstructured":"Goerler, A., Schulte, F., Vo\u00df, S.: An application of late acceptance hill-climbing to the traveling purchaser problem. In: Pacino, D., Vo\u00df, S., Jensen, R.M. (eds.) ICCL 2013. LNCS, vol. 8197, pp. 173\u2013183. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-41019-2_13"},{"issue":"1","key":"13_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1111\/itor.12063","volume":"22","author":"R Lopes","year":"2015","unstructured":"Lopes, R., Morais, V.W.C., Noronha, T.F., Souza, V.A.A.: Heuristics and matheuristics for a real-life machine reassignment problem. Int. Trans. Oper. Res. 22(1), 77\u201395 (2015)","journal-title":"Int. Trans. Oper. Res."},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/11839088_20","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"M Manfrin","year":"2006","unstructured":"Manfrin, M., Birattari, M., St\u00fctzle, T., Dorigo, M.: Parallel ant colony optimization for the traveling salesman problem. In: Dorigo, M., Gambardella, L.M., Birattari, M., Martinoli, A., Poli, R., St\u00fctzle, T. (eds.) ANTS 2006. LNCS, vol. 4150, pp. 224\u2013234. Springer, Heidelberg (2006). doi:10.1007\/11839088_20"},{"issue":"13","key":"13_CR15","doi-asserted-by":"publisher","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., Dubedout, H.: An iterated local search heuristic for multi-capacity bin packing and machine reassignment problems. Expert Syst. Appl. 40(13), 5266\u20135275 (2013)","journal-title":"Expert Syst. Appl."},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1007\/978-3-642-33558-7_56","volume-title":"Principles and Practice of Constraint Programming","author":"D Mehta","year":"2012","unstructured":"Mehta, D., O\u2019Sullivan, B., Simonis, H.: Comparing solution methods for the machine reassignment problem. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 782\u2013797. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-33558-7_56"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Bykov, Y., Birben, M., Burke, E.K.: Examination timetabling using late acceptance hyper-heuristics. In: IEEE Congress on Evolutionary Computation, 2009. CEC 2009, pp. 997\u20131004. IEEE (2009)","DOI":"10.1109\/CEC.2009.4983054"},{"key":"13_CR18","unstructured":"Ritt, M.R.P.: An algorithmic study of the machine reassignment problem. PhD thesis, Universidade Federal do Rio Grande do Sul (2012)"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Sabar, N.R., Song, A.: Grammatical evolution enhancing simulated annealing for the load balancing problem in cloud computing. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, pp. 997\u20131003. ACM (2016)","DOI":"10.1145\/2908812.2908861"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-31204-0_18","volume-title":"Applications of Evolutionary Computation","author":"NR Sabar","year":"2016","unstructured":"Sabar, N.R., Song, A., Zhang, M.: A variable local search based memetic algorithm for the load balancing problem in cloud computing. In: Squillero, G., Burelli, P. (eds.) EvoApplications 2016, Part I. LNCS, vol. 9597, pp. 267\u2013282. Springer, Heidelberg (2016). doi:10.1007\/978-3-319-31204-0_18"},{"key":"13_CR21","unstructured":"Turky, A., Abdullah, S., McCollum, B., Sabar, N.R: An evolutionary hill climbing algorithm for dynamic optimization problems. In: The 6th Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2013), 27\u201330 August 2013"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Turky, A., Sabar, N.R., Song, A.: An evolutionary simulating annealing algorithm for Google Machine Reassignment Problem. In: The 20th Asia-Pacific Symposium on Intelligent, Evolutionary Systems. Proceedings in Adaptation, Learning and Optimization. Springer Book Series (2016)","DOI":"10.1007\/978-3-319-49049-6_31"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-7908-2362-2_23","volume-title":"Logistik Management","author":"J Verstichel","year":"2009","unstructured":"Verstichel, J., Berghe, G.V.: A late acceptance algorithm for the lock scheduling problem. In: Vo\u00df, S., Pahl, J., Schwarze, S. (eds.) Logistik Management, pp. 457\u2013478. Physica, Heidelberg (2009). doi:10.1007\/978-3-7908-2362-2_23"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cor.2015.10.015","volume":"68","author":"Z Wang","year":"2016","unstructured":"Wang, Z., L\u00fc, Z., Ye, T.: Multi-neighborhood local search optimization for machine reassignment problem. Comput. Oper. Res. 68, 16\u201329 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"13_CR25","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s10845-013-0770-x","volume":"26","author":"B Yuan","year":"2015","unstructured":"Yuan, B., Zhang, C., Shao, X.: A late acceptance hill-climbing algorithm for balancing two-sided assembly lines with multiple constraints. J. Intell. Manuf. 26(1), 159\u2013168 (2015)","journal-title":"J. Intell. Manuf."}],"container-title":["Lecture Notes in Computer Science","AI 2016: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50127-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T19:04:15Z","timestamp":1699297455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50127-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501260","9783319501277"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50127-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"29 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hobart, TAS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ai2016.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}