{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:11:55Z","timestamp":1725455515188},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540620488"},{"type":"electronic","value":"9783540496335"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0009513","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:32:17Z","timestamp":1129818737000},"page":"366-375","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling interval ordered tasks with non-uniform deadlines"],"prefix":"10.1007","author":[{"given":"Jacques","family":"Verriet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,11]]},"reference":[{"issue":"2","key":"38_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1006\/jcss.1995.1068","volume":"51","author":"H.H. Ali","year":"1995","unstructured":"H.H. Ali and H. El-Rewini. An optimal algorithm for scheduling interval ordered tasks with communication on N processors. Journal of Computer and System Sciences, 51(2):301\u2013307, October 1995.","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"38_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1145\/321958.321967","volume":"23","author":"M.R. Garey","year":"1976","unstructured":"M.R. Garey and D.S. Johnson. Scheduling tasks with nonuniform deadlines on two processors. Journal of the ACM, 23(6):461\u2013467, July 1976.","journal-title":"Journal of the ACM"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0167-6377(94)90024-8","volume":"16","author":"J.A. Hoogeveen","year":"1994","unstructured":"J.A. Hoogeveen, J.K. Lenstra and B. Veltman. Three, four, five, six, or the complexity of scheduling with communication delays. Operations Research Letters, 16:129\u2013137, 1994.","journal-title":"Operations Research Letters"},{"issue":"6","key":"38_CR4","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"T.C. Hu","year":"1961","unstructured":"T.C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9(6):841\u2013848, 1961.","journal-title":"Operations Research"},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1006\/jagm.1996.0007","volume":"20","author":"J.K. Lenstra","year":"1996","unstructured":"J.K. Lenstra, M. Veldhorst and B. Veltman. The complexity of scheduling trees with communication delays. Journal of Algorithms, 20(1):157\u2013173, January 1996.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"38_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1137\/0208031","volume":"8","author":"C.H. Papadimitriou","year":"1979","unstructured":"C.H. Papadimitriou and M. Yannakakis. Scheduling interval-ordered tasks. SIAM Journal on Computing, 8(3):405\u2013409, August 1979.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR7","unstructured":"J. Verriet. Scheduling UET, UCT dags with release dates and deadlines. Technical Report UU-CS-1995-31, Department of Computer Science, Utrecht University, September 1995."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0009513","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T11:56:06Z","timestamp":1548071766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0009513"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540620488","9783540496335"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0009513","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}