{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:52:21Z","timestamp":1720641141660},"reference-count":16,"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:\/\/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.032","type":"journal-article","created":{"date-parts":[[2012,11,26]],"date-time":"2012-11-26T19:44:18Z","timestamp":1353959058000},"page":"241-248","source":"Crossref","is-referenced-by-count":10,"special_numbering":"C","title":["MPI Parallelization of Variable Neighborhood Search"],"prefix":"10.1016","volume":"39","author":[{"given":"Tatjana","family":"Davidovi\u0107","sequence":"first","affiliation":[]},{"given":"Teodor Gabriel","family":"Crainic","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2012.10.032_br0010","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","article-title":"Cooperative parallel variable neighborhood search for the p-median","volume":"10","author":"Crainic","year":"2004","journal-title":"J. Heur."},{"key":"10.1016\/j.endm.2012.10.032_br0020","doi-asserted-by":"crossref","first-page":"2155","DOI":"10.1016\/j.cor.2005.01.005","article-title":"Benchmark problem instances for static task scheduling of task graphs with communication delays on homogeneous multiprocessor systems","volume":"33","author":"Davidovi\u0107","year":"2006","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.endm.2012.10.032_br0030","unstructured":"Davidovi\u0107 T., and T. G. Crainic, Parallel local search to schedule communicating tasks on identical processors, (submitted), (2011)."},{"key":"10.1016\/j.endm.2012.10.032_br0040","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1142\/S021759590500056X","article-title":"Permutation based genetic, tabu and variable neighborhood search heuristics for multiprocessor scheduling with communication delays","volume":"22","author":"Davidovi\u0107","year":"2005","journal-title":"Asia Pac. J. Oper. Res."},{"key":"10.1016\/j.endm.2012.10.032_br0050","unstructured":"Davidovi\u0107, T., L. Liberti, N. Maculan, and N. Mladenovi\u0107, Towards the optimal solution of the multiprocessor scheduling problem with communication delays, In Proc. 3rd Multidisciplinary Int. Conf. on Scheduling: Theory and Application, Paris, France, (2007), 128\u2013135."},{"key":"10.1016\/j.endm.2012.10.032_br0060","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1023\/A:1015013919497","article-title":"The parallel variable neighborhood search for the p-median problem","volume":"8","author":"Garc\u00eda-L\u00f3pez","year":"2002","journal-title":"J. Heur."},{"key":"10.1016\/j.endm.2012.10.032_br0070","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.endm.2012.10.032_br0080","series-title":"Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques","first-page":"211","article-title":"Variable neighbourhood search","author":"Hansen","year":"2005"},{"key":"10.1016\/j.endm.2012.10.032_br0090","series-title":"Handbook of Metaheuristics","first-page":"61","article-title":"Variable neighbourhood search","author":"Hansen","year":"2010"},{"key":"10.1016\/j.endm.2012.10.032_br0100","unstructured":"Knausz, M., Parallel variable neighbourhood search for the car sequencing problem, Technical report, Fakult\u00e4t f\u00fcr Informatik der Technischen Universit\u00e4t Wien, 2008."},{"key":"10.1016\/j.endm.2012.10.032_br0110","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. & OR"},{"key":"10.1016\/j.endm.2012.10.032_br0120","unstructured":"Pirkwieser, S., and G. Raidl, Multiple variable neighborhood search enriched with ilp techniques for the periodic vehicle routing problem with time windows, In: Proceedings of the 6th International Workshop on Hybrid Metaheuristics, Udine, Italy, (2009), 45\u201359."},{"key":"10.1016\/j.endm.2012.10.032_br0130","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF03343534","article-title":"A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows","volume":"1","author":"Polacek","year":"2008","journal-title":"Business Research"},{"key":"10.1016\/j.endm.2012.10.032_br0140","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1093\/imaman\/dpm009","article-title":"Parallel variable neighbourhood search algorithms for job shop scheduling problems","volume":"18","author":"Sevkli","year":"2007","journal-title":"IMA Journal of Management Mathematics"},{"key":"10.1016\/j.endm.2012.10.032_br0150","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","volume":"16","author":"Veltman","year":"1990","journal-title":"Parallel Computing"},{"key":"10.1016\/j.endm.2012.10.032_br0160","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1016\/j.eswa.2009.06.007","article-title":"Flexible job-shop scheduling with parallel variable neighborhood search algorithm","volume":"37","author":"Yazdani","year":"2010","journal-title":"Expert Systems with Applications"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065312000339?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065312000339?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,21]],"date-time":"2018-10-21T00:50:56Z","timestamp":1540083056000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065312000339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":16,"alternative-id":["S1571065312000339"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2012.10.032","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}