{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T21:48:25Z","timestamp":1777758505895,"version":"3.51.4"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0377-2217(01)00302-2","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:56:01Z","timestamp":1034596561000},"page":"271-281","source":"Crossref","is-referenced-by-count":89,"title":["Tabu search for single machine scheduling with distinct due windows and weighted earliness\/tardiness penalties"],"prefix":"10.1016","volume":"142","author":[{"given":"Guohua","family":"Wan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin P.-C.","family":"Yen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00302-2_BIB1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1057\/jors.1988.26","article-title":"Dynamic programming state\u2013space relaxation for single machine scheduling","volume":"39","author":"Abdul-Razaq","year":"1988","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: a review","volume":"38","author":"Baker","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/ijoc.10.3.341","article-title":"Local search heuristic for the single machine total weighted tardiness scheduling problem","volume":"10","author":"Crauwels","year":"1998","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB4","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1002\/1520-6750(199302)40:1<85::AID-NAV3220400106>3.0.CO;2-C","article-title":"Single machine scheduling with early and tardy completion costs","volume":"40","author":"Davis","year":"1993","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB5","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/07408178708975418","article-title":"Minimize weighted absolute deviation in single machine scheduling","volume":"19","author":"Fry","year":"1987","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB6","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","article-title":"One-processor scheduling with symmetric earliness and tardiness penalties","volume":"13","author":"Garey","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","article-title":"Tabu search: Part 1","volume":"1","author":"Glover","year":"1989","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB8","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1287\/inte.20.4.74","article-title":"Tabu search: A tutorial","volume":"20","author":"Glover","year":"1990","journal-title":"Interfaces"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB9","series-title":"Tabu Search","author":"Glover","year":"1997"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB10","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1287\/ijoc.8.4.402","article-title":"A branch and bound algorithm for single-machine earliness\u2013tardiness scheduling with idle time","volume":"8","author":"Hoogeveen","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/0377-2217(95)00116-6","article-title":"Single machine scheduling with time windows and earliness\/tardiness penalties","volume":"91","author":"Koulamas","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB12","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/0305-0548(94)00073-H","article-title":"A genetic algorithm for job sequencing problem with distinct due dates and general early\u2013tardy penalty weights","volume":"22","author":"Lee","year":"1995","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB13","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(96)00062-8","article-title":"Single machine earliness and tardiness scheduling","volume":"96","author":"Li","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB14","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1016\/S0305-0548(98)00081-1","article-title":"A Branch and Bound algorithm for the single machine earliness and tardiness scheduling problem","volume":"26","author":"Liaw","year":"1999","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/mnsc.35.2.177","article-title":"The single machine early\/tardy problem","volume":"35","author":"Ow","year":"1989","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(82)90035-9","article-title":"A decomposition algorithm for the single machine total tardiness problem","volume":"1","author":"Potts","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB17","series-title":"Modern Heuristic Search Methods","year":"1996"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB18","series-title":"Modern Heuristic Techniques for Combinatorial Problems","year":"1993"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/1520-6750(199303)40:2<229::AID-NAV3220400207>3.0.CO;2-R","article-title":"Adjacent ordering in single machine scheduling with earliness and tardiness penalties","volume":"40","author":"Szwarc","year":"1993","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB20","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1002\/1520-6750(199510)42:7<1109::AID-NAV3220420709>3.0.CO;2-5","article-title":"Optimal timing in tardiness and earliness single machine sequencing","volume":"42","author":"Szwarc","year":"1995","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB21","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1016\/S0305-0548(97)00093-2","article-title":"A local search template","volume":"25","author":"Vaessens","year":"1998","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(01)00302-2_BIB22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0377-2217(91)90078-A","article-title":"Algorithms for a class of single machine weighted tardiness and earliness problems","volume":"52","author":"Yano","year":"1991","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003022?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701003022?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:24:46Z","timestamp":1556425486000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701003022"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0377221701003022"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00302-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}