{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:21:41Z","timestamp":1759666901213},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1016\/0196-6774(82)90030-x","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"344-361","source":"Crossref","is-referenced-by-count":27,"title":["Complexity results for scheduling tasks with discrete starting times"],"prefix":"10.1016","volume":"3","author":[{"given":"Kazuo","family":"Nakajima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.Louis","family":"Hakimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90030-X_BIB1","series-title":"Proc. 3rd Ann. ACM Symp. on Theory of Computing","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0196-6774(82)90030-X_BIB2","series-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing","first-page":"13","article-title":"Network flows and generalized path compression","author":"Galil","year":"1979"},{"key":"10.1016\/0196-6774(82)90030-X_BIB3","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","article-title":"Two-processor scheduling with start-times and deadlines","volume":"6","author":"Garey","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90030-X_BIB4","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","article-title":"\u201cStrong\u201d NP-completeness results: Motivation, examples, and implications","volume":"25","author":"Garey","year":"1978","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(82)90030-X_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0196-6774(82)90030-X_BIB6","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","article-title":"Scheduling unit-time tasks with arbitrary release times and deadlines","volume":"10","author":"Garey","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90030-X_BIB7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1287\/opre.26.1.68","article-title":"Minimal resources for fixed and variable job schedules","volume":"26","author":"Gertsbakh","year":"1978","journal-title":"Operations Res."},{"key":"10.1016\/0196-6774(82)90030-X_BIB8","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1109\/TC.1979.1675260","article-title":"An optimal solution for the channel-assignment problem","volume":"C-28","author":"Gupta","year":"1979","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0196-6774(82)90030-X_BIB9","series-title":"Proc. 8th Design Automation Workshop","first-page":"155","article-title":"Wire routing by optimizing channel assignment within large aperture","author":"Hashimoto","year":"1971"},{"key":"10.1016\/0196-6774(82)90030-X_BIB10","series-title":"Proc. 10th Design Automation Workshop","first-page":"50","article-title":"An optimum channel-routing algorithm for polycell layouts of integrated circuits","author":"Kernighan","year":"1973"},{"key":"10.1016\/0196-6774(82)90030-X_BIB11","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1287\/opre.26.1.121","article-title":"A solvable case of the one-machine scheduling problem with ready and due times","volume":"26","author":"Kise","year":"1978","journal-title":"Operations Res."},{"key":"10.1016\/0196-6774(82)90030-X_BIB12","series-title":"Proc. 16th Ann. Conf. on Information Sciences and Systems","first-page":"75","article-title":"On scheduling equal execution time tasks with discrete starting times","author":"Nakajima","year":"1982"},{"key":"10.1016\/0196-6774(82)90030-X_BIB13","series-title":"Proc. 10th Ann. ACM Symp. on Theory of Computing","first-page":"216","article-title":"The complexity of satisfiability problems","author":"Schaefer","year":"1978"},{"key":"10.1016\/0196-6774(82)90030-X_BIB14","series-title":"Proc. 19th Ann. Symp. on Foundations of Computer Science","first-page":"246","article-title":"A fast algorithm for single processor scheduling","author":"Simons","year":"1978"},{"key":"10.1016\/0196-6774(82)90030-X_BIB15","series-title":"Proc. 21st Ann. Symp. on Foundations of Computer Science","first-page":"50","article-title":"A fast algorithm for multiprocessor scheduling","author":"Simons","year":"1980"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748290030X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667748290030X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:51:40Z","timestamp":1548726700000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667748290030X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["019667748290030X"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90030-x","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}