{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:52:35Z","timestamp":1778860355205,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1975,6,1]],"date-time":"1975-06-01T00:00:00Z","timestamp":170812800000},"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":13926,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["GJ 35570"],"award-info":[{"award-number":["GJ 35570"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["GJ 474"],"award-info":[{"award-number":["GJ 474"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1975,6]]},"DOI":"10.1016\/s0022-0000(75)80008-0","type":"journal-article","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T21:06:12Z","timestamp":1273007172000},"page":"384-393","source":"Crossref","is-referenced-by-count":1081,"title":["NP-complete scheduling problems"],"prefix":"10.1016","volume":"10","author":[{"given":"J.D.","family":"Ullman","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(75)80008-0_bib1","series-title":"Proc. SJCC","first-page":"205","article-title":"Bounds on multiprocessing anomalies and packing algorithms","author":"Graham","year":"1972"},{"key":"10.1016\/S0022-0000(75)80008-0_bib2","series-title":"Proc. 3rd ACM Conference on Theory of Computing","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1970"},{"key":"10.1016\/S0022-0000(75)80008-0_bib3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-2001-2_9","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0022-0000(75)80008-0_bib4","author":"Aho","year":"1974"},{"key":"10.1016\/S0022-0000(75)80008-0_bib5","series-title":"5th Annual ACM Symp. on Theory of Computing","article-title":"Complete register allocation problems","author":"Sethi","year":"1973"},{"key":"10.1016\/S0022-0000(75)80008-0_bib6_1","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/957195.808056","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"7","author":"Bruno","year":"1973","journal-title":"Operating Systems Rev."},{"key":"10.1016\/S0022-0000(75)80008-0_bib6_2","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"CACM"},{"key":"10.1016\/S0022-0000(75)80008-0_bib7","series-title":"Proc. 8th Annual Princeton Conf. on Inf. Sci. and Systems","article-title":"Complexity results for multiprocessor scheduling under resource constraints","author":"Garey","year":"1974"},{"key":"10.1016\/S0022-0000(75)80008-0_bib8","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two-processor systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta. Inf."},{"key":"10.1016\/S0022-0000(75)80008-0_bib9","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1137\/0117070","article-title":"Optimal sequence of two equivalent processors","volume":"17","author":"Fuji","year":"1969","journal-title":"SIAM J. Appl. Math."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800080?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000075800080?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,16]],"date-time":"2022-06-16T04:26:47Z","timestamp":1655353607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000075800080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,6]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1975,6]]}},"alternative-id":["S0022000075800080"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(75)80008-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1975,6]]}}}