{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:24:52Z","timestamp":1751635492083},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"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":["Performance Evaluation"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1016\/0166-5316(94)90058-2","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T06:10:42Z","timestamp":1060323042000},"page":"361-371","source":"Crossref","is-referenced-by-count":21,"title":["Scheduling preemptive multiprocessor tasks on dedicated processors"],"prefix":"10.1016","volume":"20","author":[{"given":"L.","family":"Bianco","sequence":"first","affiliation":[]},{"given":"J.","family":"B\u0142a\u017cewicz","sequence":"additional","affiliation":[]},{"given":"P.","family":"Dell'Olmo","sequence":"additional","affiliation":[]},{"given":"M.","family":"Drozdowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-5316(94)90058-2_BIB1","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1080\/05695557008974759","article-title":"A branch-and-bound algorithm for the continuous-process task shop scheduling problem","volume":"2","author":"Bozoki","year":"1970","journal-title":"AIIE Trans."},{"key":"10.1016\/0166-5316(94)90058-2_BIB2","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\/0166-5316(94)90058-2_BIB3","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\u017cewicz","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-5316(94)90058-2_BIB4","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0166-218X(90)90090-Y","article-title":"Scheduling independent two processor tasks on a uniform duo-processor system","volume":"28","author":"B\u0142a\u017cewicz","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-5316(94)90058-2_BIB5","series-title":"Scheduling in Computer and Manufacturing Systems","author":"B\u0142a\u017cewicz","year":"1993"},{"key":"10.1016\/0166-5316(94)90058-2_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\/0166-5316(94)90058-2_BIB7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0165-6074(81)90050-8","article-title":"On the diagnosibility of self-testing multiprocessor systems","volume":"7","author":"Dal Cin","year":"1981","journal-title":"Microprocessing Microprogramming"},{"key":"10.1016\/0166-5316(94)90058-2_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\/0166-5316(94)90058-2_BIB9","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0166-5316(94)90058-2_BIB10","series-title":"Parallel Processing, The Cm\u2217 Experience","author":"Gehringer","year":"1987"},{"key":"10.1016\/0166-5316(94)90058-2_BIB11","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\/0166-5316(94)90058-2_BIB12","series-title":"Complexity of Computer Computation","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-5316(94)90058-2_BIB13","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TC.1985.1676647","article-title":"An approximation algorithm for scheduling diagnostic tests in multicomputer systems","volume":"34","author":"Krawczyk","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-5316(94)90058-2_BIB14","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."},{"issue":"1082","key":"10.1016\/0166-5316(94)90058-2_BIB15","first-page":"145","article-title":"Preemptive scheduling of two-processor tasks on dedicated processors (in Polish)","volume":"100","author":"Kubale","year":"1990","journal-title":"Zeszyty Naukowe Politechniki \u015ala\u0327skiej, Seria: Automatyka"},{"key":"10.1016\/0166-5316(94)90058-2_BIB16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/0605003","article-title":"Preemptive scheduling, linear programming and network flows","volume":"5","author":"de Werra","year":"1984","journal-title":"SIAM J. Algebraic Discrete Meth."},{"key":"10.1016\/0166-5316(94)90058-2_BIB17","doi-asserted-by":"crossref","DOI":"10.1016\/0167-8191(90)90056-F","article-title":"Multiprocessor scheduling with communication delays","author":"Veltman","year":"1990"}],"container-title":["Performance Evaluation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531694900582?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166531694900582?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:21:02Z","timestamp":1552612862000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166531694900582"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0166531694900582"],"URL":"https:\/\/doi.org\/10.1016\/0166-5316(94)90058-2","relation":{},"ISSN":["0166-5316"],"issn-type":[{"value":"0166-5316","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}