{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T13:24:50Z","timestamp":1648560290643},"reference-count":10,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1994,8,1]],"date-time":"1994-08-01T00:00:00Z","timestamp":775699200000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1994,8]]},"DOI":"10.1016\/0305-0548(94)90008-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T12:15:45Z","timestamp":1056975345000},"page":"787-795","source":"Crossref","is-referenced-by-count":1,"title":["One machine scheduling to minimize expected mean tardiness\u2014Part II"],"prefix":"10.1016","volume":"21","author":[{"given":"B.V.","family":"Cadambi","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90008-6_BIB1","series-title":"Computers and Interactabilily: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0305-0548(94)90008-6_BIB2","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/0305-0548(91)90015-J","article-title":"One maching scheduling to minimise expected mean tardiness\u2014Part I","volume":"18","author":"Cadambi","year":"1991","journal-title":"Computers Ops Res."},{"key":"10.1016\/0305-0548(94)90008-6_BIB3","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","article-title":"Choosing the job sequence and processing times to minimise total processing plus flow cost on a single machine","volume":"28","author":"Vickson","year":"1980","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90008-6_BIB4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1002\/nav.3800180304","article-title":"A hybrid algorithm for one machine sequencing problem to minimise total tardiness","volume":"18","author":"Srinivasan","year":"1971","journal-title":"Nav. Res. Logist Quart."},{"key":"10.1016\/0305-0548(94)90008-6_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":"Ops Res. Letters"},{"key":"10.1016\/0305-0548(94)90008-6_BIB6","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1974"},{"key":"10.1016\/0305-0548(94)90008-6_BIB7","doi-asserted-by":"crossref","first-page":"86","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":"Ops Res."},{"key":"10.1016\/0305-0548(94)90008-6_BIB8","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1287\/opre.23.5.908","article-title":"Minimising total costs in one machine scheduling","volume":"23","author":"Rinnoykan","year":"1975","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90008-6_BIB9","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","article-title":"One machine sequencing problem to minimise certain function of job tardiness","volume":"17","author":"Emmons","year":"1969","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90008-6_BIB10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1080\/05695557108974812","article-title":"An improved method for scheduling independent tasks","volume":"3","author":"Wilkerson","year":"1971","journal-title":"A.I.I.E. Trans."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900086?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900086?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:27:22Z","timestamp":1552915642000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,8]]},"references-count":10,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1994,8]]}},"alternative-id":["0305054894900086"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90008-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,8]]}}}