{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:50Z","timestamp":1761620930271},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,6,3]],"date-time":"2006-06-03T00:00:00Z","timestamp":1149292800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,6,3]],"date-time":"2006-06-03T00:00:00Z","timestamp":1149292800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s00291-006-0052-5","type":"journal-article","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T08:08:08Z","timestamp":1149235688000},"page":"513-533","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Two very large-scale neighborhoods for single machine scheduling"],"prefix":"10.1007","volume":"29","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"}]}],"member":"297","published-online":{"date-parts":[[2006,6,3]]},"reference":[{"issue":"6","key":"52_CR1","doi-asserted-by":"crossref","first-page":"967","DOI":"10.1002\/1520-6750(199012)37:6<967::AID-NAV3220370616>3.0.CO;2-K","volume":"37","author":"RH Ahmadi","year":"1990","unstructured":"Ahmadi RH, Bagchi U (1990) Lower bounds for single-machine scheduling problems. Nav Res Logist 37(6):967\u2013979","journal-title":"Nav Res Logist"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"RK Ahuja","year":"2002","unstructured":"Ahuja RK, \u00d6zlem E, Orlin JB, Punnen AP (2002) A survey of very large-scale neighborhood search techniques. Discrete Appl Math 123:75\u2013102","journal-title":"Discrete Appl Math"},{"key":"52_CR3","volume-title":"Introduction to sequencing and scheduling","author":"KR Baker","year":"1974","unstructured":"Baker KR (1974) Introduction to sequencing and scheduling. Wiley, New York"},{"key":"52_CR4","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1002\/1520-6750(199210)39:6<859::AID-NAV3220390610>3.0.CO;2-W","volume":"39","author":"C Chu","year":"1992","unstructured":"Chu C (1992) A branch-and-bound algorithm to minimize total flow time with unequal release dates. Nav Res Logist 39:859\u2013875","journal-title":"Nav Res Logist"},{"issue":"1","key":"52_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","volume":"14","author":"RK Congram","year":"2002","unstructured":"Congram RK, Potts CN, van de Velde SL (2002) An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS J Comput 14(1):52\u201367","journal-title":"INFORMS J Comput"},{"key":"52_CR6","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287\u2013326","journal-title":"Ann Discrete Math"},{"key":"52_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s002910050098","volume":"21","author":"J Hurink","year":"1999","unstructured":"Hurink J (1999) An exponential neighborhood for a one machine batching problem. OR Spectrum 21:461\u2013476","journal-title":"OR Spectrum"},{"key":"52_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discrete Math 1:343\u2013362","journal-title":"Ann Discrete Math"},{"key":"52_CR9","volume-title":"Dynasearch-iterative local improvement by dynamic programming. Part 1. The traveling salesman problem. Technical Report","author":"CN Potts","year":"1995","unstructured":"Potts CN, van de Velde SL (1995) Dynasearch-iterative local improvement by dynamic programming. Part 1. The traveling salesman problem. Technical Report, University of Twente, The Netherlands"},{"key":"52_CR10","first-page":"79","volume-title":"Machine scheduling problems: classification, complexity and computations","author":"AHG Rinnooy Kan","year":"1976","unstructured":"Rinnooy Kan AHG (1976) Machine scheduling problems: classification, complexity and computations. Martinus Nijhoff, The Hague, pp 79\u201388"},{"key":"52_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith WE (1956) Various optimizers for single-stage production. Nav Res Logist Q 3:59\u201366","journal-title":"Nav Res Logist Q"},{"issue":"2","key":"52_CR12","first-page":"96","volume":"47","author":"S Yanai","year":"2004","unstructured":"Yanai S, Fujie T (2004) On a dominance test for the single machine scheduling problem with release dates to minimize total flow time. J Oper Res Soc Jpn 47(2):96\u2013111","journal-title":"J Oper Res Soc Jpn"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-006-0052-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00291-006-0052-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-006-0052-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-006-0052-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T16:48:37Z","timestamp":1652806117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00291-006-0052-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,3]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["52"],"URL":"https:\/\/doi.org\/10.1007\/s00291-006-0052-5","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,3]]},"assertion":[{"value":"3 June 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}