{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T09:27:39Z","timestamp":1770974859647,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"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,7]]},"DOI":"10.1016\/0305-0548(94)90080-9","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T16:15:45Z","timestamp":1056989745000},"page":"653-659","source":"Crossref","is-referenced-by-count":265,"title":["Scheduling jobs under simple linear deterioration"],"prefix":"10.1016","volume":"21","author":[{"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(94)90080-9_BIB1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/opre.38.3.495","article-title":"Scheduling deteriorating jobs on a single processor","volume":"38","author":"Browne","year":"1990","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90080-9_BIB2","article-title":"Scheduling problems with general earliness and tardiness cost structures","author":"Mosheiov","year":"1990"},{"key":"10.1016\/0305-0548(94)90080-9_BIB3","doi-asserted-by":"crossref","first-page":"979","DOI":"10.1287\/opre.39.6.979","article-title":"V-Shaped policies to schedule deteriorating jobs","volume":"39","author":"Mosheiov","year":"1991","journal-title":"Ops Res."},{"key":"10.1016\/0305-0548(94)90080-9_BIB4","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","article-title":"An n Job, one machine sequencing algorithm for minimizing the number of late jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90080-9_BIB5","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/mnsc.17.1.116","article-title":"A simple optimality proof of Moore's sequencing algorithm","volume":"17","author":"Sturm","year":"1970","journal-title":"Mgmt Sci."},{"key":"10.1016\/0305-0548(94)90080-9_BIB6","article-title":"Scheduling a production line to minimize maximum tardiness","author":"Jackson","year":"1955"},{"key":"10.1016\/0305-0548(94)90080-9_BIB7","series-title":"Introduction to Sequencing and Scheduling","author":"Baker","year":"1975"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900809?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0305054894900809?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T17:27:10Z","timestamp":1552930030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0305054894900809"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0305054894900809"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(94)90080-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}