{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:29:33Z","timestamp":1649129373479},"reference-count":20,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"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":3638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0885-064x(03)00028-1","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T02:16:19Z","timestamp":1051236979000},"page":"597-609","source":"Crossref","is-referenced-by-count":0,"title":["An efficient parallel algorithm for scheduling interval ordered tasks"],"prefix":"10.1016","volume":"19","author":[{"given":"Yoojin","family":"Chung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kunsoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0885-064X(03)00028-1_BIB1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1142\/S0129054199000058","article-title":"Parallel maximum matching algorithms in interval graphs","volume":"10","author":"Chung","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB2","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two processor systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/S0885-064X(03)00028-1_BIB3","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","article-title":"Parallel merge sort","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-7315(84)90004-2","article-title":"A parallel matching algorithm for convex bipartite graphs and applications to scheduling","volume":"1","author":"Dekel","year":"1984","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB5","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1137\/0117070","article-title":"Optimal sequencing of two equivalent processors","volume":"17","author":"Fujii","year":"1969","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"10.1016\/S0885-064X(03)00028-1_BIB6","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1145\/322326.322335","article-title":"An almost-linear algorithm for two-processor scheduling","volume":"29","author":"Gabow","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/S0885-064X(03)00028-1_BIB7","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1006\/jpdc.1994.1053","article-title":"Parallel algorithms for dynamic programming recurrences with more than O(1) dependency","volume":"21","author":"Galil","year":"1994","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB8","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\/S0885-064X(03)00028-1_BIB9","series-title":"Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"issue":"4","key":"10.1016\/S0885-064X(03)00028-1_BIB10","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1137\/0216050","article-title":"Two processor scheduling is in NC","volume":"16","author":"Helmbold","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB11","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB12","doi-asserted-by":"crossref","unstructured":"H. Jung, M. Serna, P. Spirakis, A parallel algorithm for two processors precedence constraint scheduling, Proc. Internat. Colloq. Automata, Languages Program. (1991) 417\u2013428.","DOI":"10.1007\/3-540-54233-7_152"},{"key":"10.1016\/S0885-064X(03)00028-1_BIB13","unstructured":"E.L. Lawler, J.K. Lenstra, A.H.G.R. Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, Technical Report, Centrum voor Wiskunde en Informatica, 1989."},{"issue":"4","key":"10.1016\/S0885-064X(03)00028-1_BIB14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0020-0190(90)90025-S","article-title":"An optimum O(nlogn) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals","volume":"35","author":"Manacher","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1080\/10637199608915542","article-title":"Scheduling interval orders in parallel","volume":"8","author":"Mayr","year":"1996","journal-title":"Parallel Algorithms Appl."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB16","first-page":"114","article-title":"A parallel algorithm for maximum matching on interval graphs","volume":"3","author":"Moitra","year":"1989","journal-title":"Proc. Internat. Conf. Parallel Process."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB17","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\/S0885-064X(03)00028-1_BIB18","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1006\/jagm.1997.0895","article-title":"Scheduling interval ordered tasks in parallel","volume":"26","author":"Sunder","year":"1998","journal-title":"J. Algorithm"},{"key":"10.1016\/S0885-064X(03)00028-1_BIB19","unstructured":"J.D. Ulman, Complexity of sequencing problems, in: E.G. Coffman (Ed.), Computer and Job Scheduling Theory, Wiley, New York, 1976."},{"key":"10.1016\/S0885-064X(03)00028-1_BIB20","doi-asserted-by":"crossref","first-page":"1140","DOI":"10.1137\/0218076","article-title":"The two processor scheduling problem is in random NC","volume":"18","author":"Vazirani","year":"1989","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X03000281?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X03000281?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T13:13:08Z","timestamp":1584623588000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X03000281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0885064X03000281"],"URL":"https:\/\/doi.org\/10.1016\/s0885-064x(03)00028-1","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}