{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:23:25Z","timestamp":1648578205262},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":4855,"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":[[2000,4]]},"DOI":"10.1016\/s0166-218x(99)00211-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T01:44:34Z","timestamp":1027647874000},"page":"269-289","source":"Crossref","is-referenced-by-count":4,"title":["Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays"],"prefix":"10.1016","volume":"101","author":[{"given":"Jacques","family":"Verriet","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0166-218X(99)00211-5_BIB1","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1006\/jcss.1995.1068","article-title":"An optimal algorithm for scheduling interval ordered tasks with communication on n processors","volume":"51","author":"Ali","year":"1995","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0166-218X(99)00211-5_BIB2","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/moor.2.3.275","article-title":"Scheduling equal-length tasks under treelike precedence constraints to minimize maximum lateness","volume":"2","author":"Brucker","year":"1977","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00211-5_BIB3","unstructured":"T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, The MIT Press, Cambridge MA, United States, 1990."},{"issue":"2","key":"10.1016\/S0166-218X(99)00211-5_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0304-3975(96)00035-7","article-title":"Scheduling UET-UCT series-parallel graphs on two processors","volume":"162","author":"Finta","year":"1996","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/S0166-218X(99)00211-5_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"issue":"6","key":"10.1016\/S0166-218X(99)00211-5_BIB6","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","article-title":"Scheduling tasks with nonuniform deadlines on two processors","volume":"23","author":"Garey","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(99)00211-5_BIB7","doi-asserted-by":"crossref","unstructured":"A. Goral\u010d\u0131\u0301kova, V. Koubek, A reduct-and-closure algorithm for graphs, in: J. Be\u010dv\u00e1\u0159 (Ed.), Proceedings of the 8th Conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 74, Springer, Berlin, Germany, 1979, pp. 301\u2013307.","DOI":"10.1007\/3-540-09526-8_27"},{"key":"10.1016\/S0166-218X(99)00211-5_BIB8","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1966","journal-title":"Bell System Tech. J."},{"issue":"2","key":"10.1016\/S0166-218X(99)00211-5_BIB9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0166-218X(99)00211-5_BIB10","doi-asserted-by":"crossref","unstructured":"L.A. Hall, D.B. Shmoys, Approximation schemes for constrained scheduling problems, in: Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 134\u2013139.","DOI":"10.1109\/SFCS.1989.63468"},{"key":"10.1016\/S0166-218X(99)00211-5_BIB11","unstructured":"C. Hanen, A. Munier, Performances d'algorithmes de liste en presence de delais de communication unitaires, Unpublished manuscript, 1995."},{"issue":"1","key":"10.1016\/S0166-218X(99)00211-5_BIB12","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(99)00211-5_BIB13","unstructured":"C. Picouleau, Etude de Probl\u00e8mes d'Optimisation dans les Syst\u00e8mes Distribu\u00e9s, Th\u00e8se de doctorat, Universit\u00e9 Pierre et Marie Curie, Paris, France, 1992."},{"issue":"1","key":"10.1016\/S0166-218X(99)00211-5_BIB14","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","article-title":"UET scheduling with unit interprocessor communication delays","volume":"18","author":"Rayward-Smith","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00211-5_BIB15","unstructured":"H. Stadtherr, Scheduling interval orders with communication delays in parallel, Unpublished manuscript, 1997."},{"key":"10.1016\/S0166-218X(99)00211-5_BIB16","unstructured":"J. Verriet, Scheduling UET, UCT dags with release dates and deadlines, Technical Report UU-CS-1995-31, Department of Computer Science, Utrecht University, Utrecht, The Netherlands, September 1995."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002115?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99002115?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T11:24:20Z","timestamp":1555327460000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99002115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0166218X99002115"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00211-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}