{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T17:45:01Z","timestamp":1772819101516,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":[[1993,6]]},"DOI":"10.1016\/0020-0190(93)90054-d","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:40Z","timestamp":1027655140000},"page":"109-113","source":"Crossref","is-referenced-by-count":12,"title":["Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness"],"prefix":"10.1016","volume":"46","author":[{"given":"L.","family":"Bianco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"B\u0142a\u017cewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Dell'Olmo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Drozdowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90054-D_BIB1","author":"Baker","year":"1974"},{"key":"10.1016\/0020-0190(93)90054-D_BIB2","unstructured":"L. Bianco, L. B\u0142a\u017cewicz, P. Dell'Olmo and M. Drozdowski, Scheduling preemptive multiprocessor tasks on dedicated processors, in preparation."},{"issue":"5","key":"10.1016\/0020-0190(93)90054-D_BIB3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0020-0190(92)90172-R","article-title":"Scheduling multiprocessor tasks on three dedicated processors","volume":"41","author":"B\u0142a\u017cewicz","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90054-D_BIB4","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multiprocessor tasks to minimize schedule length","volume":"35","author":"B\u0142a\u017cewics","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(93)90054-D_BIB5","author":"B\u0142a\u017cewicz","year":"1992"},{"key":"10.1016\/0020-0190(93)90054-D_BIB6","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","article-title":"Scheduling subject to resource constraints: Classification and complexity","volume":"5","author":"B\u0142a\u017cewicz","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(93)90054-D_BIB7","year":"1976"},{"key":"10.1016\/0020-0190(93)90054-D_BIB8","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","article-title":"Complexity of scheduling parallel task systems","volume":"2","author":"Du","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0020-0190(93)90054-D_BIB9","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0020-0190(93)90054-D_BIB10","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TC.1985.1676647","article-title":"An approximation algorithm for diagnostic test scheduling in multicomputer systems","volume":"34","author":"Krawczyk","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(93)90054-D_BIB11","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(87)90176-1","article-title":"The complexity of scheduling independent two-processor tasks on dedicated processors","volume":"24","author":"Kubale","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90054-D_BIB12","first-page":"245","article-title":"Preemptive scheduling of uniform processors subject to release dates","author":"Labetoulle","year":"1984"},{"key":"10.1016\/0020-0190(93)90054-D_BIB13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0020-0190(90)90096-G","article-title":"Preemptive scheduling of independent jobs with release times and dead-lines on a hypercube","volume":"34","author":"Plehn","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90054-D_BIB14","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","volume":"16","author":"Veltmann","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/0020-0190(93)90054-D_BIB15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1145\/355744.355755","article-title":"An automatic revised simplex method for constrained resource network scheduling","volume":"3","author":"W\u0123eglarz","year":"1977","journal-title":"ACM Trans. Math. Software"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390054D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390054D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:21:47Z","timestamp":1555132907000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390054D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["002001909390054D"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90054-d","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}