{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:50:54Z","timestamp":1720641054080},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"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":[[2006,8]]},"DOI":"10.1016\/j.endm.2006.06.058","type":"journal-article","created":{"date-parts":[[2006,7,25]],"date-time":"2006-07-25T07:55:22Z","timestamp":1153814122000},"page":"29-33","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines"],"prefix":"10.1016","volume":"25","author":[{"given":"Tobias","family":"Brueggemann","sequence":"first","affiliation":[]},{"given":"Johann L.","family":"Hurink","sequence":"additional","affiliation":[]},{"given":"Tjark","family":"Vredeveld","sequence":"additional","affiliation":[]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2006.06.058_bib001","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","article-title":"A survey of very large-scale neighborhood search techniques","volume":"123","author":"Ahuja","year":"2002","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.endm.2006.06.058_bib002","unstructured":"T. Brueggemann, J.L. Hurink, W. Kern [2006]: Quality of move-optimal schedules for minimizing total weighted completion time. To appear in: Operations Research Letters"},{"issue":"3","key":"10.1016\/j.endm.2006.06.058_bib003","first-page":"312","article-title":"A linear time approximation algorithm for multiprocessor scheduling","volume":"19","author":"Finn","year":"1979","journal-title":"Nordisk Tidskrift for Informationsbehandling (BIT)"},{"issue":"2","key":"10.1016\/j.endm.2006.06.058_bib004","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"10.1016\/j.endm.2006.06.058_bib005","unstructured":"P. Schuurman and T. Vredeveld [2006]: Performance guarantees of local search for multiprocessor scheduling. To appear in: Informs Journal on Computing"},{"key":"10.1016\/j.endm.2006.06.058_bib006","unstructured":"T. Vredeveld [2002]: Combinatorial Approximation Algorithms. PhD-Thesis. Eindhoven, The Netherlands. ISBN: 90-386-0532-3"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106530600059X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106530600059X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,14]],"date-time":"2019-01-14T16:58:00Z","timestamp":1547485080000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106530600059X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":6,"alternative-id":["S157106530600059X"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2006.06.058","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}