{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,10]],"date-time":"2023-09-10T08:01:14Z","timestamp":1694332874583},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/s0012-365x(97)84781-4","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:16:34Z","timestamp":1051128994000},"page":"67-79","source":"Crossref","is-referenced-by-count":19,"title":["Efficiency and effectiveness of normal schedules on three dedicated processors"],"prefix":"10.1016","volume":"164","author":[{"given":"P.","family":"Dell'Olmo","sequence":"first","affiliation":[]},{"given":"M.G.","family":"Speranza","sequence":"additional","affiliation":[]},{"given":"Zs.","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)84781-4_BIB1","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/S0012-365X(97)84781-4_BIB2","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1002\/1520-6750(199412)41:7<959::AID-NAV3220410708>3.0.CO;2-K","article-title":"Nonpreemptive scheduling of independent tasks with dedicated resources","volume":"41","author":"Bianco","year":"1994","journal-title":"Naval Res. Logist."},{"key":"10.1016\/S0012-365X(97)84781-4_BIB3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(95)00003-A","article-title":"Scheduling independent tasks with multiple modes","volume":"62","author":"Bianco","year":"1995","journal-title":"Ann. Oper. Res. Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(97)84781-4_BIB4","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\/S0012-365X(97)84781-4_BIB5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multiprocessor tasks to minimize schedule length","author":"Blazewicz","year":"1986","journal-title":"IEEE Trans. Comp. c-35"},{"key":"10.1016\/S0012-365X(97)84781-4_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":"Blazewicz","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(97)84781-4_BIB7","first-page":"17","article-title":"Graph models for multiprocessor scheduling problems with precedence constraints","volume":"21","author":"Dell'Olmo","year":"1996","journal-title":"Foundations of Computing and Decisions Sciences"},{"key":"10.1016\/S0012-365X(97)84781-4_BIB8","doi-asserted-by":"crossref","unstructured":"P. Dell'Olmo, M.G. Speranza and Zs. Tuza, Comparability graph augmentation for some multiprocessor scheduling problems, Discrete Appl. Math., to appear.","DOI":"10.1016\/S0166-218X(96)00037-6"},{"key":"10.1016\/S0012-365X(97)84781-4_BIB9","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\/S0012-365X(97)84781-4_BIB10","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0166-218X(94)00160-F","article-title":"An approximation algorithm for scheduling on three dedicated processors","volume":"61","author":"Goemans","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(97)84781-4_BIB11","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0012-365X(97)84781-4_BIB12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","article-title":"Complexity of scheduling multiprocessor tasks with prespecified processor allocation","volume":"5","author":"Hoogeveen","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(97)84781-4_BIB13","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."},{"key":"10.1016\/S0012-365X(97)84781-4_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":"Veltman","year":"1990","journal-title":"Parallel Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97847814?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97847814?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:01Z","timestamp":1556130421000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97847814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["S0012365X97847814"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)84781-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}