{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:35:59Z","timestamp":1759847759923},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":[[1996,11]]},"DOI":"10.1016\/s0167-6377(96)00031-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:14:29Z","timestamp":1027638869000},"page":"243-250","source":"Crossref","is-referenced-by-count":21,"title":["Decomposition of the single machine total tardiness problem"],"prefix":"10.1016","volume":"19","author":[{"given":"Wlodzimierz","family":"Szwarc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samar K.","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(96)00031-4_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":"Oper. Res."},{"key":"10.1016\/S0167-6377(96)00031-4_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-L","article-title":"A branch and bound algorithm to minimize total tardiness with different release times","volume":"39","author":"Chu","year":"1992","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0167-6377(96)00031-4_BIB3","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","article-title":"Minimizing total tardiness on one processor is NP-hard","volume":"15","author":"Du","year":"1990","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(96)00031-4_BIB4","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\/S0167-6377(96)00031-4_BIB5","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":"Fischer","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/S0167-6377(96)00031-4_BIB6","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(96)00031-4_BIB7","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."},{"key":"10.1016\/S0167-6377(96)00031-4_BIB8","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0377-2217(87)80008-5","article-title":"Dynamic programming and decomposition approaches for single machine total tardiness problem","volume":"32","author":"Potts","year":"1987","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0167-6377(96)00031-4_BIB9","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(96)00031-4_BIB10","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":"Oper. Res."},{"key":"10.1016\/S0167-6377(96)00031-4_BIB11","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."},{"key":"10.1016\/S0167-6377(96)00031-4_BIB12","series-title":"Creative and Innovative Approaches to the Science of Management","first-page":"407","article-title":"Single machine total tardiness problem revisited","author":"Szwarc","year":"1993"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000314?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637796000314?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:53:51Z","timestamp":1555577631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637796000314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["S0167637796000314"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(96)00031-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}