{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T00:01:04Z","timestamp":1752192064443,"version":"3.41.2"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[1976,11,1]],"date-time":"1976-11-01T00:00:00Z","timestamp":215654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1976,11,1]],"date-time":"1976-11-01T00:00:00Z","timestamp":215654400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1976,11,1]],"date-time":"1976-11-01T00:00:00Z","timestamp":215654400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1976,11]]},"DOI":"10.1109\/tc.1976.1674556","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"1067-1073","source":"Crossref","is-referenced-by-count":5,"title":["On the Computational Complexity of a Generalized Scheduling Problem"],"prefix":"10.1109","volume":"C-25","author":[{"family":"Vairavan","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, University of Wisconsin-Milwaukee"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Demillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"A study of schedules as models of synchronous parallel computation","year":"1975","author":"demillo","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803902"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0117070"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1016\/S0022-0000(70)80022-8","article-title":"on formalized computer programs","volume":"4","author":"luckham","year":"1970","journal-title":"J Comput Syst Sci"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80011-5"},{"journal-title":"The Design and Analysis of Computer Algorithms","year":"1974","author":"aho","key":"ref8"},{"journal-title":"Complexity of Computer Computations","year":"1972","author":"karp","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5008918"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80008-0"},{"journal-title":"Operating Systems Theory","year":"1973","author":"coffman","key":"ref1"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35144\/01674556.pdf?arnumber=1674556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:08:09Z","timestamp":1752102489000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1674556\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,11]]},"references-count":10,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tc.1976.1674556","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[1976,11]]}}}