{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:06:05Z","timestamp":1777597565485,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0167-6377(03)00064-6","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T13:48:54Z","timestamp":1057585734000},"page":"68-72","source":"Crossref","is-referenced-by-count":67,"title":["An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem"],"prefix":"10.1016","volume":"32","author":[{"given":"A","family":"Grosso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F","family":"Della Croce","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R","family":"Tadei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(03)00064-6_BIB1","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/ijoc.14.1.52.7712","article-title":"An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem","volume":"14","author":"Congram","year":"2002","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/S0167-6377(03)00064-6_BIB2","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0377-2217(95)00009-F","article-title":"Generalized pairwise interchanges and machine scheduling","volume":"83","author":"Della Croce","year":"1995","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(03)00064-6_BIB3","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A pseudopolynomial algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0167-6377(03)00064-6_BIB4","series-title":"Dynasearch\u2014iterative local improvement by dynamic programming: part I, the traveling salesman problem, Technical Report","author":"Potts","year":"1995"},{"key":"10.1016\/S0167-6377(03)00064-6_BIB5","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/opre.23.5.908","article-title":"Minimizing total costs in one-machine scheduling","volume":"23","author":"Rinnooy Kan","year":"1975","journal-title":"Oper. Res."},{"key":"10.1016\/S0167-6377(03)00064-6_BIB6","doi-asserted-by":"crossref","unstructured":"T. St\u00fctzle, M. Den Besten, M. Dorigo, Ant Colony Optimization for the total weighted tardiness problem, Technical Report IRIDIA\/99-16, Universit\u00e9 Libre de Bruxelles, Belgium, 1999.","DOI":"10.1007\/3-540-45356-3_60"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637703000646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T17:04:12Z","timestamp":1585069452000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637703000646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0167637703000646"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(03)00064-6","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}