{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:27:16Z","timestamp":1649129236035},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0020-0190(01)00303-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"27-32","source":"Crossref","is-referenced-by-count":0,"title":["Lower bounds on precedence-constrained scheduling for parallel processors"],"prefix":"10.1016","volume":"83","author":[{"given":"Ivan D.","family":"Baev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Waleed M.","family":"Meleis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Eichenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00303-9_BIB001","series-title":"Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD","first-page":"852","article-title":"Algorithms for total weighted completion time scheduling","author":"Baev","year":"1999"},{"key":"10.1016\/S0020-0190(01)00303-9_BIB002","series-title":"Scheduling equal-length jobs on identical parallel machines, Research Report","author":"Baptiste","year":"1998"},{"key":"10.1016\/S0020-0190(01)00303-9_BIB003","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\/S0020-0190(01)00303-9_BIB004","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":"Comm. ACM"},{"key":"10.1016\/S0020-0190(01)00303-9_BIB005","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 Inform."},{"key":"10.1016\/S0020-0190(01)00303-9_BIB006","series-title":"Proc. 32nd Annual International Symposium on Microarchitecture (IEEE\/ACM), Haifa, Israel","first-page":"272","article-title":"Balance scheduling: Weighting branch tradeoffs in superblocks","author":"Eichenberger","year":"1999"},{"key":"10.1016\/S0020-0190(01)00303-9_BIB007","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1109\/TC.1973.5009153","article-title":"Bounds on the number of processors and time for multiprocessor optimal schedules","author":"Fernandez","year":"1973","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(01)00303-9_BIB008","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.22.3.513","article-title":"Scheduling to minimize average completion time: Off-line and on-line approximation algorithms","volume":"22","author":"Hall","year":"1997","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0020-0190(01)00303-9_BIB009","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\/S0020-0190(01)00303-9_BIB010","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1145\/238997.239002","article-title":"A recursive technique for computing lower-bound performance of schedules","volume":"1","author":"Langevin","year":"1996","journal-title":"ACM Trans. Design Automation"},{"key":"10.1016\/S0020-0190(01)00303-9_BIB011","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/43.285240","article-title":"Estimating implementation bounds for real time DSP application specific circuits","volume":"13","author":"Rabaey","year":"1994","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0020-0190(01)00303-9_BIB012","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/43.275355","article-title":"Lower-bound performance estimation for the high-level synthesis scheduling problem","volume":"13","author":"Rim","year":"1994","journal-title":"IEEE Trans. Comput.-Aided Des."},{"key":"10.1016\/S0020-0190(01)00303-9_BIB013","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0212018","article-title":"Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines","volume":"12","author":"Simons","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00303-9_BIB014","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"J. Comput. Systems Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001003039?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T14:53:04Z","timestamp":1556635984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001003039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0020019001003039"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00303-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}