{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:52:36Z","timestamp":1760597556053},"reference-count":5,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1016\/j.endm.2012.10.028","type":"journal-article","created":{"date-parts":[[2012,11,27]],"date-time":"2012-11-27T00:45:23Z","timestamp":1353977123000},"page":"209-216","source":"Crossref","is-referenced-by-count":27,"special_numbering":"C","title":["Variable Neighborhood Search for Google Machine Reassignment problem"],"prefix":"10.1016","volume":"39","author":[{"given":"Haris","family":"Gavranovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mirsad","family":"Buljuba\u0161i\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emir","family":"Demirovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2012.10.028_br0010","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0377-2217(00)00305-2","article-title":"The noising methods: A generalization of some metaheuristics","volume":"135","author":"Charon","year":"2001","journal-title":"EJOR"},{"key":"10.1016\/j.endm.2012.10.028_br0020","unstructured":"Diaz, J. A., and E. Fernandez, A Tabu search heuristic for the generalized assignment problem, Technical Report DR. 98\/8 (1998)."},{"key":"10.1016\/j.endm.2012.10.028_br0030","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","article-title":"Variable neighbourhood search: methods and applications","volume":"175","author":"Hansen","year":"2010","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.endm.2012.10.028_br0050","unstructured":"Yagiura, M., T. Ibaraki, and F. Glover, An ejection chain approach for the generalized assignment problem, Technical Report 99013 (1999)."},{"key":"10.1016\/j.endm.2012.10.028_br0060","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1080\/10556789808805722","article-title":"A variable depth search algorithm with branching search for the generalized assignment problem","volume":"10","author":"Yagiura","year":"1998","journal-title":"Optimization Methods and Software"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571065312000297?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S1571065312000297?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,21]],"date-time":"2018-10-21T04:50:46Z","timestamp":1540097446000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065312000297"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":5,"alternative-id":["S1571065312000297"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.endm.2012.10.028","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}