{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:07:24Z","timestamp":1725502044130},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540779179"},{"type":"electronic","value":"9783540779186"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77918-6_4","type":"book-chapter","created":{"date-parts":[[2008,2,8]],"date-time":"2008-02-08T03:41:19Z","timestamp":1202442079000},"page":"41-54","source":"Crossref","is-referenced-by-count":3,"title":["Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Brueggemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johann L.","family":"Hurink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tjark","family":"Vredeveld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"Local search in combinatorial optimization","year":"1997","key":"4_CR1","unstructured":"Aarts, E.H.L., Lenstra, J.K. (eds.): Local search in combinatorial optimization. John Wiley & Sons, Chichester (1997)"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., \u00d6zlem, E., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics\u00a0123, 75\u2013102 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0166-218X(96)00036-4","volume":"72","author":"P. Brucker","year":"1997","unstructured":"Brucker, P., Hurink, J.L., Werner, F.: Improving local search heuristics for some scheduling problems II. Discrete Applied Mathematics\u00a072, 47\u201369 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.orl.2005.08.003","volume":"34","author":"T. Brueggemann","year":"2006","unstructured":"Brueggemann, T., Hurink, J.L., Kern, W.: Quality of move-optimal schedules for minimizing total weighted completion time. Operations Research Letters\u00a034, 583\u2013590 (2006)","journal-title":"Operations Research Letters"},{"key":"4_CR5","unstructured":"Brueggemann, T., Hurink, J.L., Vredeveld, T., Woeginger, G.J.: Very large-scale neighborhoods with performance guarantees for minimizing makespan on parallel machines, Tech. Report No.\u00a01801, University of Twente, Dep.\u00a0of Mathematical Sciences (2006)"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s101070050010","volume":"87","author":"V.G. De\\u{i}neko","year":"2000","unstructured":"De\u012dneko, V.G. Woeginger, G.J.: A study of exponential neighborhoods for the travelling salesman problem and for the quadratic assignment problem. Mathematical Programming, Series A\u00a087, 519\u2013542 (2000)","journal-title":"Mathematical Programming, Series A"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G. Finn","year":"1979","unstructured":"Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT\u00a019, 312\u2013320 (1979)","journal-title":"BIT"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing\u00a04, 397\u2013411 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing anomalies. SIAM Journal on Applied Mathematics\u00a017, 416\u2013429 (1969)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0167-6377(02)00212-2","volume":"31","author":"C.A.J. Hurkens","year":"2003","unstructured":"Hurkens, C.A.J., Vredeveld, T.: Local search for multiprocessor scheduling: How many moves does it take to a local optimum? Operations Research Letters\u00a031, 137\u2013141 (2003)","journal-title":"Operations Research Letters"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.1050.0152","volume":"19","author":"P. Schuurman","year":"2007","unstructured":"Schuurman, P., Vredeveld, T.: Performance guarantees of local search for multiprocessor scheduling. Informs Journal on Computing\u00a019, 52\u201363 (2007)","journal-title":"Informs Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77918-6_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:17Z","timestamp":1619506577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77918-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540779179","9783540779186"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77918-6_4","relation":{},"subject":[]}}