{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T21:14:58Z","timestamp":1660252498616},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3766,"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":[[2003,5]]},"DOI":"10.1016\/s0166-218x(02)00247-0","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:10:20Z","timestamp":1052766620000},"page":"461-476","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling unitary task systems with zero\u2013one communication delays for quasi-interval orders"],"prefix":"10.1016","volume":"127","author":[{"given":"Aziz","family":"Moukrim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00247-0_BIB1","doi-asserted-by":"crossref","unstructured":"Ph. Chr\u00e9tienne, A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints, European J. Oper. Res. (43) (1989) 225\u2013230.","DOI":"10.1016\/0377-2217(89)90216-6"},{"key":"10.1016\/S0166-218X(02)00247-0_BIB2","series-title":"Scheduling Theory and its Applications","article-title":"Scheduling with communication delays: a survey","author":"Chr\u00e9tienne","year":"1995"},{"key":"10.1016\/S0166-218X(02)00247-0_BIB3","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0166-218X(02)00247-0_BIB4","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1137\/0606066","article-title":"Profile scheduling of opposing forests and level orders","volume":"6","author":"Dolev","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(02)00247-0_BIB5","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(96)00035-7","article-title":"Scheduling UET-UCT series\u2013parallel graphs on two processors","volume":"162","author":"Finta","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(02)00247-0_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(02)00247-0_BIB7","unstructured":"F. Guinand, D. Trystram, Optimal scheduling of UECT trees on two processors, Technical Report, Rapport Apache No. 3, Laboratoire de Mod\u00e9lisation et de Calcul-IMAG, Grenoble, November 1993."},{"key":"10.1016\/S0166-218X(02)00247-0_BIB8","unstructured":"E.L. Lawler, Scheduling trees on multiprocessors with unit communication delays, Workshop on Models and Algorithms for Planning and Scheduling Problems, Villa Vigoni, Lake Como, Italy, June 14\u201318, 1993."},{"key":"10.1016\/S0166-218X(02)00247-0_BIB9","series-title":"Handbooks in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and scheduling: algorithms and complexity","volume":"Vol. 4","author":"Lawler","year":"1993"},{"key":"10.1016\/S0166-218X(02)00247-0_BIB10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1006\/jagm.1996.0007","article-title":"The complexity of scheduling trees with communication delays","volume":"20","author":"Lenstra","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(02)00247-0_BIB11","unstructured":"R.H. M\u00f6hring, M.W. Sch\u00e4ffter, A simple approximation algorithm for scheduling forests with unit processing times and zero-one communication delays, Technical Report 506, Technische Universitat, Berlin, 1995."},{"issue":"1","key":"10.1016\/S0166-218X(02)00247-0_BIB12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0167-8191(98)00100-8","article-title":"Scheduling series\u2013parallel orders subject to 0\/1-communication delays","volume":"25","author":"M\u00f6hring","year":"1999","journal-title":"Parallel Comput."},{"key":"10.1016\/S0166-218X(02)00247-0_BIB13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-6377(99)00003-6","article-title":"Optimal scheduling on parallel machines for a new order class","volume":"24","author":"Moukrim","year":"1999","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(02)00247-0_BIB14","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0208031","article-title":"Scheduling interval-ordered tasks","volume":"8","author":"Papadimitriou","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(02)00247-0_BIB15","unstructured":"C. Picouleau, Etude de probl\u00e8mes d'optimisation dans les syst\u00e8mes distribu\u00e9s, Th\u00e8se de Doctorat, d'Universit\u00e9 Paris VI, 1992."},{"issue":"1\u20133","key":"10.1016\/S0166-218X(02)00247-0_BIB16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0166-218X(94)00063-J","article-title":"New complexity results on scheduling with small communication delays","volume":"60","author":"Picouleau","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00247-0_BIB17","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","article-title":"UET scheduling with interprocessor communication delays","volume":"18","author":"Rayward-Smith","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(02)00247-0_BIB18","unstructured":"M.W. Sch\u00e4ffter, Scheduling jobs with communication delays, complexity results and approximation algorithms, Ph.D. Thesis, Technische Universitat, Berlin, 1996."},{"key":"10.1016\/S0166-218X(02)00247-0_BIB19","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","article-title":"The recognition of series\u2013parallel digraphs","volume":"11","author":"Valdes","year":"1982","journal-title":"SIAM J. Comput."},{"issue":"10","key":"10.1016\/S0166-218X(02)00247-0_BIB20","doi-asserted-by":"crossref","DOI":"10.1109\/71.539738","article-title":"Scheduling in and out forests in the presence of communication delays","volume":"7","author":"Varvarigou","year":"1996","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"key":"10.1016\/S0166-218X(02)00247-0_BIB21","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:S0166218X02002470?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002470?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T09:25:19Z","timestamp":1555147519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0166218X02002470"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00247-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}