{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T00:35:15Z","timestamp":1769387715897,"version":"3.49.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,11,1]],"date-time":"1984-11-01T00:00:00Z","timestamp":468115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1984,11,1]],"date-time":"1984-11-01T00:00:00Z","timestamp":468115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1984,11]]},"DOI":"10.1016\/0743-7315(84)90004-2","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"185-205","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":47,"title":["A parallel matching algorithm for convex bipartite graphs and applications to scheduling"],"prefix":"10.1016","volume":"1","author":[{"given":"Eliezer","family":"Dekel","sequence":"first","affiliation":[]},{"given":"Sartaj","family":"Sahni","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0743-7315(84)90004-2_BIB1","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.31.1.24","article-title":"Parallel scheduling algorithms","volume":"31","author":"Dekel","year":"1983","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/0743-7315(84)90004-2_BIB2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1983.1676223","article-title":"Binary trees and parallel scheduling algorithms","volume":"C-32","author":"Dekel","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0743-7315(84)90004-2_BIB3","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0210049","article-title":"Parallel matrix and graph algorithms","volume":"10","author":"Dekel","year":"1981","journal-title":"SICOMP"},{"key":"10.1016\/0743-7315(84)90004-2_BIB4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","article-title":"Preserving order in a forest in less than logarithmic time and linear space","volume":"6","author":"Emd Boas","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(84)90004-2_BIB5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","article-title":"Maximum matching in a convex bipartite graph","volume":"14","author":"Glover","year":"1967","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0743-7315(84)90004-2_BIB6","article-title":"Scheduling a production line to minimize maximum tardiness","author":"Jackson","year":"1955"},{"key":"10.1016\/0743-7315(84)90004-2_BIB7_1","unstructured":"Lageweg, B. J., and Lawler, E. L. Private communication."},{"key":"10.1016\/0743-7315(84)90004-2_BIB7_2","first-page":"22","article-title":"Sequencing by Enumerative Methods","author":"Lenstra","year":"1976"},{"key":"10.1016\/0743-7315(84)90004-2_BIB8","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF00264533","article-title":"Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems","volume":"15","author":"Lipski","year":"1981","journal-title":"Acta Inform."},{"key":"10.1016\/0743-7315(84)90004-2_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Sequencing with deadlines and loss functions","volume":"6","author":"McNaughton","year":"1959","journal-title":"Management Sci."},{"key":"10.1016\/0743-7315(84)90004-2_BIB10","doi-asserted-by":"crossref","first-page":"1014","DOI":"10.1109\/T-C.1969.222573","article-title":"Optimal preemtive scheduling on two-processor systems","volume":"C-18","author":"Muntz","year":"1969","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0743-7315(84)90004-2_BIB11","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TC.1979.1675216","article-title":"Bitonic sort on a mesh connected parallel computer","volume":"C-28","author":"Nassimi","year":"1979","journal-title":"IEEE Trans Comput."},{"issue":"7","key":"10.1016\/0743-7315(84)90004-2_BIB12","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","article-title":"New parallel-sorting schemes","volume":"C-27","author":"Preparata","year":"1978","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(84)90004-2_BIB13","series-title":"Machine scheduling problems, classification complexity, and computation","author":"Rinnooy Kan","year":"1976"},{"key":"10.1016\/0743-7315(84)90004-2_BIB14","article-title":"Parallel algorithms for graph theoretic problems","author":"Savage","year":"1978"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731584900042?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731584900042?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:08Z","timestamp":1757514608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731584900042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,11]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,11]]}},"alternative-id":["0743731584900042"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(84)90004-2","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1984,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A parallel matching algorithm for convex bipartite graphs and applications to scheduling","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(84)90004-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1984 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}