{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:32:07Z","timestamp":1768267927902,"version":"3.49.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"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":8417,"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,7]]},"DOI":"10.1016\/0166-218x(90)90093-r","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:02:11Z","timestamp":1027638131000},"page":"45-57","source":"Crossref","is-referenced-by-count":36,"title":["Minimizing the number of tardy job units under release time constraints"],"prefix":"10.1016","volume":"28","author":[{"given":"Dorit S.","family":"Hochbaum","sequence":"first","affiliation":[]},{"given":"Ron","family":"Shamir","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90093-R_BIB1","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/0024-3795(89)90487-4","article-title":"An algorithm for the detection and construction of Monge sequences","volume":"114\/115","author":"Alon","year":"1989","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/0166-218X(90)90093-R_BIB2","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0166-218X(90)90093-R_BIB3","series-title":"Rept.","article-title":"Monge sequences, antimatroids, and the transportation problem with forbidden arcs","author":"Dietrich","year":"1989"},{"key":"10.1016\/0166-218X(90)90093-R_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(90)90093-R_BIB5","series-title":"Rept. TR-100\u29f888","article-title":"Strongly polynomial algorithms for the high multiplicity scheduling problem","author":"Hochbaum","year":"1988"},{"key":"10.1016\/0166-218X(90)90093-R_BIB6","first-page":"317","article-title":"On simple transportation problems","volume":"7","author":"Hoffman","year":"1963"},{"key":"10.1016\/0166-218X(90)90093-R_BIB7","unstructured":"A. Hoffman, Private communication."},{"key":"10.1016\/0166-218X(90)90093-R_BIB8","first-page":"377","article-title":"A faster strongly polynomial miminum cost flow algorithm","author":"Orlin","year":"1988","journal-title":"Proceedings 20th ACM Symposium of the Theory of Computing"},{"key":"10.1016\/0166-218X(90)90093-R_BIB9","series-title":"Rept. 136\/89","article-title":"A fast algorithm for constructing Monge sequences in transportation problems with forbidden arcs","author":"Shamir","year":"1989"},{"key":"10.1016\/0166-218X(90)90093-R_BIB10","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","article-title":"A strongly polynomial minimum cost circulation algorithm","volume":"5","author":"Tardos","year":"1985","journal-title":"Combinatorica"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090093R?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090093R?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T19:53:32Z","timestamp":1555185212000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090093R"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["0166218X9090093R"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90093-r","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}