{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T17:25:43Z","timestamp":1772817943811,"version":"3.50.1"},"reference-count":5,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"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":[[1992,4]]},"DOI":"10.1016\/0020-0190(92)90172-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"275-280","source":"Crossref","is-referenced-by-count":83,"title":["Scheduling multiprocessor tasks on three dedicated processors"],"prefix":"10.1016","volume":"41","author":[{"given":"J.","family":"B\u0142\u017cewicz","sequence":"first","affiliation":[]},{"given":"P.","family":"Dell'Olmo","sequence":"additional","affiliation":[]},{"given":"M.","family":"Drozdowski","sequence":"additional","affiliation":[]},{"given":"M.G.","family":"Speranza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90172-R_BIB1","author":"Bianco","year":"1991","journal-title":"Nonpreemptive scheduling of independent tasks under resource constraints"},{"key":"10.1016\/0020-0190(92)90172-R_BIB2","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multi-processor tasks to minimize schedule length","volume":"35","author":"B\u0142\u017cewicz","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0020-0190(92)90172-R_BIB3","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","article-title":"Complexity of scheduling paralel task systems","volume":"2","author":"Du","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(92)90172-R_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. ACM"},{"key":"10.1016\/0020-0190(92)90172-R_BIB5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90176-1","article-title":"The complexity of scheduling two-processor tasks on dedicated processors","volume":"24","author":"Kubale","year":"1987","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290172R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290172R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:26:37Z","timestamp":1555129597000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290172R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["002001909290172R"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90172-r","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}