{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:01:41Z","timestamp":1648710101312},"reference-count":7,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":[[2003,9]]},"DOI":"10.1016\/s0305-0548(02)00084-9","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"1745-1749","source":"Crossref","is-referenced-by-count":9,"title":["A note on the maximum number of on-time jobs on parallel identical machines"],"prefix":"10.1016","volume":"30","author":[{"given":"Avital","family":"Lann","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(02)00084-9_BIB1","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 tardy jobs","volume":"15","author":"Moore","year":"1968","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(02)00084-9_BIB2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0305-0548(02)00084-9_BIB3","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(80)90111-3","article-title":"Complexity results for scheduling chains on a single machine","volume":"4","author":"Lenstra","year":"1980","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(02)00084-9_BIB4","first-page":"97","article-title":"Minimizing the number of late jobs with release time constraints","volume":"11","author":"Du","year":"1992","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"10.1016\/S0305-0548(02)00084-9_BIB5","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1287\/opre.37.2.314","article-title":"Preemptive scheduling of two uniform machines to minimize the number of late jobs","volume":"37","author":"Lawler","year":"1989","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(02)00084-9_BIB6","doi-asserted-by":"crossref","unstructured":"Brucker P. Complexity results for scheduling problems. 1998; www.mathemtik.uni-osnabrueck.de\/research\/OR\/class\/.","DOI":"10.1007\/978-3-662-03612-9_1"},{"key":"10.1016\/S0305-0548(02)00084-9_BIB7","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/0305-0548(95)00078-X","article-title":"Single machine scheduling to minimize the number of early and tardy jobs","volume":"8","author":"Lann","year":"1996","journal-title":"Computers and Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000849?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054802000849?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T09:27:16Z","timestamp":1554974836000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054802000849"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":7,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0305054802000849"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(02)00084-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}