{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T03:36:49Z","timestamp":1778038609215,"version":"3.51.4"},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0166-218x(94)90012-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"259-272","source":"Crossref","is-referenced-by-count":121,"title":["Complexity of scheduling multiprocessor tasks with prespecified processor allocations"],"prefix":"10.1016","volume":"55","author":[{"given":"J.A.","family":"Hoogeveen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.L.","family":"van de Velde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Veltman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90012-4_BIB1","article-title":"On scheduling independent tasks with dedicated resources. Program and Abstracts","author":"Bianco","year":"1991","journal-title":"14th International Symposium Mathematical Programming, Amsterdam"},{"key":"10.1016\/0166-218X(94)90012-4_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":"Blazewicz","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(94)90012-4_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":"Blazewicz","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(94)90012-4_BIB4","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":"Blazewicz","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(94)90012-4_BIB5","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-218X(94)90012-4_BIB6","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(94)90012-4_BIB7","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-218X(94)90012-4_BIB8","doi-asserted-by":"crossref","first-page":"869","DOI":"10.1109\/TC.1985.1676647","article-title":"An approximation algorithm for diagnostic test scheduling in multiprocessor systems","volume":"34","author":"Krawczyk","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(94)90012-4_BIB9","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\/0166-218X(94)90012-4_BIB10","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","article-title":"Integer programming with a fixed number of variables","volume":"8","author":"Lenstra","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(94)90012-4_BIB11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","article-title":"Complexity of machine scheduling problems","volume":"1","author":"Lenstra","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(94)90012-4_BIB12","author":"Martello","year":"1990"},{"key":"10.1016\/0166-218X(94)90012-4_BIB13","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":"Veltman","year":"1990","journal-title":"Parallel Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900124?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94900124?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:29:54Z","timestamp":1555136994000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94900124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0166218X94900124"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90012-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}