{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T02:08:40Z","timestamp":1778033320605,"version":"3.51.4"},"reference-count":9,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1982,11,1]],"date-time":"1982-11-01T00:00:00Z","timestamp":404956800000},"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":[[1982,11]]},"DOI":"10.1016\/0167-6377(82)90035-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"177-181","source":"Crossref","is-referenced-by-count":240,"title":["A decomposition algorithm for the single machine total tardiness problem"],"prefix":"10.1016","volume":"1","author":[{"given":"C.N","family":"Potts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.N","family":"Van Wassenhove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(82)90035-9_BIB1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/opre.26.1.111","article-title":"Finding an optimal sequence by dynamic programming: An extension to precedence-related tasks","volume":"26","author":"Baker","year":"1978","journal-title":"Operations Res."},{"key":"10.1016\/0167-6377(82)90035-9_BIB2","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","article-title":"One-machine sequencing to minimize certain functions of job tardiness","volume":"17","author":"Emmons","year":"1969","journal-title":"Operations Res."},{"key":"10.1016\/0167-6377(82)90035-9_BIB3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01580393","article-title":"A dual algorithm for the one-machine scheduling problem","volume":"11","author":"Fisher","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(82)90035-9_BIB4","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0167-5060(08)70742-8","article-title":"A \u2018pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness","volume":"1","author":"Lawler","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0167-6377(82)90035-9_BIB5","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1287\/opre.26.1.86","article-title":"The time-dependent traveling salesman problem and applications to the tardiness problem in one-machine scheduling","volume":"26","author":"Picard","year":"1978","journal-title":"Operations Res."},{"key":"10.1016\/0167-6377(82)90035-9_BIB6","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":"Operations Res."},{"key":"10.1016\/0167-6377(82)90035-9_BIB7","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1287\/opre.26.3.444","article-title":"Dynamic programming solution of sequencing problems with precedence constraints","volume":"26","author":"Schrage","year":"1978","journal-title":"Operations Res."},{"key":"10.1016\/0167-6377(82)90035-9_BIB8","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1287\/mnsc.18.6.B301","article-title":"On the n-job, one-machine sequence-independent scheduling problem with tardiness penalties: A branch and bound solution","volume":"18","author":"Shwimer","year":"1972","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(82)90035-9_BIB9","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/nav.3800180304","article-title":"A hybrid algorithm for the one-machine sequencing problem to minimize total tardiness","volume":"18","author":"Srinivasan","year":"1971","journal-title":"Naval Res. Logist. Quart."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900359?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637782900359?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T11:52:39Z","timestamp":1552909959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637782900359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,11]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1982,11]]}},"alternative-id":["0167637782900359"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(82)90035-9","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1982,11]]}}}