{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:49:13Z","timestamp":1758264553559},"reference-count":11,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6041,"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":[[1997,1]]},"DOI":"10.1016\/s0166-218x(96)00037-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"71-84","source":"Crossref","is-referenced-by-count":10,"title":["Comparability graph augmentation for some multiprocessor scheduling problems"],"prefix":"10.1016","volume":"72","author":[{"given":"P.","family":"Dell'Olmo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.Grazia","family":"Speranza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zs.","family":"Tuza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00037-6_BIB1","first-page":"959","volume":"41","author":"Bianco","year":"1994","journal-title":"Nonpreemptive scheduling of independent tasks with prespecified processor allocation Naval Research Logistics"},{"key":"10.1016\/S0166-218X(96)00037-6_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\/S0166-218X(96)00037-6_BIB3","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1080\/05695557008974759","article-title":"A branch-and-bound algorithm for the continuous-process job-shop scheduling problem","volume":"II","author":"Bozoki","year":"1970","journal-title":"AIIE Trans."},{"key":"10.1016\/S0166-218X(96)00037-6_BIB4","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0377-2217(91)90254-S","article-title":"Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lenghts","volume":"51","author":"\u010cangalovi\u0107","year":"1991","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00037-6_BIB5","doi-asserted-by":"crossref","DOI":"10.1016\/S0012-365X(97)84781-4","article-title":"Efficiency and effectiveness of normal schedules on three dedicated processors","author":"Dell'Olmo","year":"1997","journal-title":"Discrete Math"},{"key":"10.1016\/S0166-218X(96)00037-6_BIB6","series-title":"Computers and Intractability: A guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00037-6_BIB7","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(96)00037-6_BIB8","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984","journal-title":"Ann. Discrete Math"},{"key":"10.1016\/S0166-218X(96)00037-6_BIB9","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 allocations","volume":"55","author":"Hoogeveen","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(96)00037-6_BIB10","series-title":"Graphs and Orders","first-page":"3","article-title":"Comparability graphs","author":"Kelly","year":"1985"},{"key":"10.1016\/S0166-218X(96)00037-6_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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000376?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X96000376?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:28:02Z","timestamp":1556130482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X96000376"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":11,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0166218X96000376"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00037-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}