{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T22:30:27Z","timestamp":1652567427583},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"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":8478,"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":[[1990,5]]},"DOI":"10.1016\/0166-218x(90)90132-v","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"101-112","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic single processor scheduling"],"prefix":"10.1016","volume":"27","author":[{"given":"Janelie J.","family":"Harms","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90132-V_BIB1","series-title":"Modeling and Performance Evaluation","first-page":"57","article-title":"Scheduling dependent tasks with different arrival times to meet deadlines","author":"Blazewicz","year":"1976"},{"key":"10.1016\/0166-218X(90)90132-V_BIB2","series-title":"The Combinatorics of Network Reliability","author":"Colbourn","year":"1987"},{"key":"10.1016\/0166-218X(90)90132-V_BIB3","series-title":"Res. Rept. CORR 87-8","article-title":"Matroid Steiner problems, the Tutte polynomial and network reliability","author":"Colbourn","year":"1987"},{"key":"10.1016\/0166-218X(90)90132-V_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","article-title":"Transversals and matroid partition","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0166-218X(90)90132-V_BIB5","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0020-0190(83)90117-5","article-title":"Scheduling unit-time tasks with integer release times and deadlines","volume":"16","author":"Frederickson","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(90)90132-V_BIB6","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0196-6774(84)90042-7","article-title":"Efficient algorithms for a family of matroid intersection problems","volume":"5","author":"Gabow","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(90)90132-V_BIB7","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","article-title":"Optimal assignments in an ordered set: an application of matroid theory","volume":"4","author":"Gale","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0166-218X(90)90132-V_BIB8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0206029","article-title":"Two-processor scheduling with start times and deadlines","volume":"6","author":"Garey","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90132-V_BIB9","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","article-title":"Scheduling unit-time tasks with arbitrary release times and deadlines","volume":"10","author":"Garey","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90132-V_BIB10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/nav.3800140304","article-title":"Maximum matching in convex bipartite graphs","volume":"14","author":"Glover","year":"1967","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(90)90132-V_BIB11","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1137\/0211014","article-title":"Complexity of matroid property algorithms","volume":"11","author":"Jensen","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90132-V_BIB12","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1111\/j.1467-9574.1976.tb00264.x","article-title":"Minimizing maximum lateness on one machine: computational experience and some applications","volume":"30","author":"Lageweg","year":"1976","journal-title":"Statist. Neerlandica"},{"key":"10.1016\/0166-218X(90)90132-V_BIB13","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","article-title":"Optimal sequencing of a single machine subject to precedence constraints","volume":"18","author":"Lawler","year":"1973","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(90)90132-V_BIB14","series-title":"Networks and Matroids","article-title":"Combinatorial Optimization","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(90)90132-V_BIB15","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090132V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090132V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:56:54Z","timestamp":1555135014000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090132V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["0166218X9090132V"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90132-v","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}