{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T12:13:07Z","timestamp":1648555987222},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7321,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0012-365x(93)90336-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:34Z","timestamp":1027640614000},"page":"215-223","source":"Crossref","is-referenced-by-count":5,"title":["Minimizing the number of tardy jobs in single machine sequencing"],"prefix":"10.1016","volume":"117","author":[{"given":"Ahmad H.","family":"Sharary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nejib","family":"Zaguia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90336-R_BIB1","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","article-title":"Scheduling tasks with nonuniform deadlines on two processors","volume":"23","author":"Garey","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0012-365X(93)90336-R_BIB2","series-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(93)90336-R_BIB3","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0012-365X(93)90336-R_BIB4","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1287\/mnsc.19.5.544","article-title":"Optimal sequencing of a single machine subject to precedence constraints","volume":"19","author":"Lawler","year":"1973","journal-title":"Management Sci."},{"key":"10.1016\/0012-365X(93)90336-R_BIB5","first-page":"509","article-title":"Two open problems in precedence constrained scheduling","volume":"23","author":"Lenstra","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0012-365X(93)90336-R_BIB6","series-title":"Symposium on the theory of scheduling and its applications","first-page":"393","article-title":"An extension of Moore's due date algorithm","volume":"Vol. 86","author":"Sidney","year":"1973"},{"key":"10.1016\/0012-365X(93)90336-R_BIB7","doi-asserted-by":"crossref","DOI":"10.1007\/BF00420355","article-title":"Finding the largest suborder of fixed width in posets","author":"Steiner","year":"1992","journal-title":"Order"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390336R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390336R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:54:27Z","timestamp":1555120467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390336R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["0012365X9390336R"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90336-r","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}