{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:56:31Z","timestamp":1773798991648,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":[[1995,6]]},"DOI":"10.1016\/0167-6377(95)00027-h","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"221-229","source":"Crossref","is-referenced-by-count":24,"title":["On decomposition of the total tardiness problem"],"prefix":"10.1016","volume":"17","author":[{"given":"S.","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Q.","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(95)00027-H_BIB1","series-title":"An introduction to sequencing and scheduling","author":"Baker","year":"1974"},{"issue":"3","key":"10.1016\/0167-6377(95)00027-H_BIB2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one machine is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(95)00027-H_BIB3","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":"Oper. Res."},{"key":"10.1016\/0167-6377(95)00027-H_BIB4","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\/0167-6377(95)00027-H_BIB5","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":"Oper. Res. Lett."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500027H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779500027H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:53:30Z","timestamp":1555563210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779500027H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["016763779500027H"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(95)00027-h","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}