{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:48:41Z","timestamp":1757540921151},"reference-count":13,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[1973,8,1]],"date-time":"1973-08-01T00:00:00Z","timestamp":113011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1973,8]]},"DOI":"10.1109\/tc.1973.5009153","type":"journal-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T16:36:47Z","timestamp":1243960607000},"page":"745-751","source":"Crossref","is-referenced-by-count":128,"title":["Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules"],"prefix":"10.1109","volume":"C-22","author":[{"given":"Eduardo B.","family":"Fernandez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertram","family":"Bussell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.841"},{"key":"ref11","author":"kraska","year":"1972","journal-title":"Parallelism exploitation and scheduling"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1972.5008918"},{"key":"ref4","author":"cerf","year":"1971","journal-title":"Formal control-flow properties of a model of computation"},{"key":"ref3","first-page":"59","article-title":"minimizing the number of computing devices needed to realize a computational process within a specified time","author":"barskiy","year":"1968","journal-title":"Eng Cybern (USSR)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/1969503"},{"key":"ref5","first-page":"523","article-title":"bounds on memory requirements of multiprocessings systems","author":"chen","year":"1968","journal-title":"Proc 6th Annu Allerton Conf Circuit and Syst Theory"},{"key":"ref8","first-page":"73","article-title":"scheduling in project networks","author":"fulkerson","year":"1966","journal-title":"Proc IBM Scientific Computing Symp Combinatorial Problems"},{"key":"ref7","first-page":"472","article-title":"restructuring and scheduling of parallel computations","author":"fern\ufffdndez","year":"1971","journal-title":"Conf Rec 5th Asilomar Conf Circuits and Systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/321592.321605"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1012","DOI":"10.1109\/T-C.1969.222572","article-title":"bounds for maxium parallelism in a bilogic graph model of computations","volume":"c 18","author":"baer","year":"1969","journal-title":"IEEE Transactions on Computers"},{"key":"ref9","first-page":"205","article-title":"bounds on multiprocessing anomalies and related packing algorithms","volume":"40","author":"graham","year":"1972","journal-title":"1972 Spring Joint Comput Conf AFIPS Conf Proc"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/5009144\/05009153.pdf?arnumber=5009153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:39:21Z","timestamp":1638200361000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5009153\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,8]]},"references-count":13,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tc.1973.5009153","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[1973,8]]}}}