{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T01:41:21Z","timestamp":1773970881752,"version":"3.50.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1986,12]]},"DOI":"10.1016\/0743-7315(86)90014-6","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"553-576","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["The parallel complexity of scheduling with precedence constraints"],"prefix":"10.1016","volume":"3","author":[{"given":"Danny","family":"Dolev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eli","family":"Upfal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(86)90014-6_BIB1","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/moor.2.3.275","article-title":"Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness","volume":"2","author":"Brucker","year":"1977","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0743-7315(86)90014-6_BIB2","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.1982.1675982","article-title":"A regular layout for parallel adders","volume":"TC-31","author":"Brent","year":"1982","journal-title":"Trans. Comput. IEEE"},{"key":"10.1016\/0743-7315(86)90014-6_BIB3","series-title":"Proc. NATO Conference","article-title":"Deterministic and stochastic scheduling problems with treelike precedence constraints","author":"Bruno","year":"1981"},{"key":"10.1016\/0743-7315(86)90014-6_BIB4","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/358141.358144","article-title":"An overview of computational complexity","volume":"26","author":"Cook","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/0743-7315(86)90014-6_BIB5","series-title":"Proc. 1974 Sagamore Computer Conference on Parallel Processing","first-page":"1","article-title":"On a class of scheduling algorithms for multiprocessor computing systems","author":"Chen","year":"1975"},{"issue":"4","key":"10.1016\/0743-7315(86)90014-6_BIB6","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/0743-7315(86)90014-6_BIB7","first-page":"152","article-title":"A parallel matching algorithm for convex bipartite graphs and applications to scheduling","volume":"1","author":"Dekel","year":"1984","journal-title":"J. Parallel Distributed Computation"},{"key":"10.1016\/0743-7315(86)90014-6_BIB8_1","series-title":"Proc. International Workshop on Parallel Computing and VLSI","article-title":"Scheduling trees in parallel","author":"Dolev","year":"1984"},{"key":"10.1016\/0743-7315(86)90014-6_BIB8_2","series-title":"VLSI: Algorithms and Architectures","first-page":"91","year":"1985"},{"issue":"3","key":"10.1016\/0743-7315(86)90014-6_BIB9","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/0214047","article-title":"Scheduling flat graphs","volume":"14","author":"Dolev","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"4","key":"10.1016\/0743-7315(86)90014-6_BIB10","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1137\/0606066","article-title":"Profile scheduling of opposing forests and level orders","volume":"6","author":"Dolev","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0743-7315(86)90014-6_BIB11","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1145\/322326.322335","article-title":"An almost linear algorithm for two processor scheduling","volume":"29","author":"Gabow","year":"1982","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-7315(86)90014-6_BIB12","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10.1016\/0743-7315(86)90014-6_BIB13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0604011","article-title":"Scheduling opposing forests","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0743-7315(86)90014-6_BIB14","unstructured":"Galil, Z., and Warmuth, M. K. Bucket sorting in parallel. Private communication."},{"issue":"6","key":"10.1016\/0743-7315(86)90014-6_BIB15","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/0743-7315(86)90014-6_BIB16","article-title":"Two processor scheduling is in NC","author":"Helmbold","year":"1985"},{"key":"10.1016\/0743-7315(86)90014-6_BIB17","unstructured":"Helmbold, D., and Mayr, E. Fast scheduling algorithms on parallel computers. Adv. in Comput. Res., in press."},{"key":"10.1016\/0743-7315(86)90014-6_BIB18","article-title":"Scheduling a production line to minimize maximum tardiness","author":"Jackson","year":"1955"},{"key":"10.1016\/0743-7315(86)90014-6_BIB19","volume":"Vol. 3","author":"Knuth","year":"1972"},{"issue":"1","key":"10.1016\/0743-7315(86)90014-6_BIB20","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is LOG SPACE complete for P","volume":"7","author":"Lander","year":"1975","journal-title":"SIGACT News"},{"key":"10.1016\/0743-7315(86)90014-6_BIB21","article-title":"Well structured parallel programs are not easier to schedule","author":"Mayr","year":"1981"},{"key":"10.1016\/0743-7315(86)90014-6_BIB22","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/357114.357116","article-title":"Ultracomputers","volume":"2","author":"Schwartz","year":"1980","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0743-7315(86)90014-6_BIB23","unstructured":"Snir, M. Depth-size tradeoffs for parallel prefix computation. J. Assoc. Comput. Mach., in press."},{"issue":"4","key":"10.1016\/0743-7315(86)90014-6_BIB24","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/0743-7315(86)90014-6_BIB25","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0020-0190(85)90025-0","article-title":"An efficient parallel strong orientation","volume":"20","author":"Vishkin","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(86)90014-6_BIB26","article-title":"Scheduling on profiles of constant breadth","author":"Warmuth","year":"1981"},{"key":"10.1016\/0743-7315(86)90014-6_BIB27","article-title":"The complexity of parallel computations","author":"Wyllie","year":"1979"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731586900146?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731586900146?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:21Z","timestamp":1757514561000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731586900146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["0743731586900146"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(86)90014-6","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1986,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The parallel complexity of scheduling with precedence constraints","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(86)90014-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1986 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}