{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:11Z","timestamp":1725663611199},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:13:32Z","timestamp":1330236812000},"page":"100-109","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling interval ordered tasks in parallel"],"prefix":"10.1007","author":[{"given":"S.","family":"Sunder","sequence":"first","affiliation":[]},{"given":"Xin","family":"He","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"13_CR1","unstructured":"J. D. Ullman. Complexity of sequencing problems. In E. G. Coffman, editor, Computer and Job Scheduling Theory. John Wiley and sons, 1976."},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E. G. Coffman","year":"1971","unstructured":"E. G. Coffman and R. L. Graham. Optimal scheduling for two processor systems. Acta Informatica, 1:200\u2013213, 1971.","journal-title":"Acta Informatica"},{"key":"13_CR3","doi-asserted-by":"crossref","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:461\u2013467, 1976.","journal-title":"Journal of the ACM"},{"key":"13_CR4","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1145\/322326.322335","volume":"29","author":"H. N. Gabow","year":"1982","unstructured":"H. N. Gabow. An almost linear time algorithm for two processor scheduling. J. Assoc. Comput. Mach., 29:766\u2013780, 1982.","journal-title":"J. Assoc. Comput. Mach."},{"key":"13_CR5","first-page":"165","volume-title":"volume 304 of Lecture Notes in Economics and Mathematical Systems","author":"M. Bartusch","year":"1988","unstructured":"M. Bartusch, R. H. Mohring, and F. J. Radermacher. M-machine unit time scheduling: a report of ongoing research, volume 304 of Lecture Notes in Economics and Mathematical Systems, pages 165\u2013212. Springer-Berlin, 1988."},{"key":"13_CR6","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:841\u2013848, 1961.","journal-title":"Operations Research"},{"key":"13_CR7","doi-asserted-by":"crossref","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 J. on Computing, 8:405\u2013409, 1979.","journal-title":"SIAM J. on Computing"},{"key":"13_CR8","unstructured":"E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: Algorithms and complexity. Technical report, Centrum voor Wiskunde en Informatica, 1989."},{"key":"13_CR9","volume-title":"Advances in Computing Research","author":"D. Helmbold","year":"1987","unstructured":"D. Helmbold and E. Mayr. Fast Scheduling Algorithms on Parallel Computers. Advances in Computing Research. Jai press inc., London, 1987."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1137\/0216050","volume":"16","author":"D. HelmBold","year":"1987","unstructured":"D. HelmBold and E. Mayr. Two processor scheduling is in NC. SIAM J. on Computing, 16:747\u2013759, August 1987.","journal-title":"SIAM J. on Computing"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"H. Jung, P. Spirakis, and M. Serna. A parallel algorithm for two processors precedence constrained scheduling. In Proceedings of ICALP, 1991.","DOI":"10.1007\/3-540-54233-7_152"},{"key":"13_CR12","unstructured":"D. Dolev, E. Upfal, and M. Warmuth. Scheduling trees in parallel. In P. Bertolazzi and F. Luccio, editors, VLSI: Algorithms and Architectures, 1985."}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:07Z","timestamp":1605629047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}