{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T15:06:29Z","timestamp":1767625589158},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s10951-006-5595-4","type":"journal-article","created":{"date-parts":[[2006,1,9]],"date-time":"2006-01-09T13:57:20Z","timestamp":1136815040000},"page":"71-73","source":"Crossref","is-referenced-by-count":30,"title":["A Note on Scheduling Equal-Length Jobs to Maximize Throughput"],"prefix":"10.1007","volume":"9","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"D\u00fcrr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Jawor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kowalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Kurowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5595_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","volume":"2","author":"P. Baptiste","year":"1999","unstructured":"Baptiste, P., \u201cPolynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times,\u201d Journal of Scheduling, 2, 245\u2013252 (1999).","journal-title":"Journal of Scheduling"},{"issue":"4","key":"5595_CR2","first-page":"219","volume":"5","author":"J. Carlier","year":"1981","unstructured":"Carlier J., \u201cProbl\u00e9mes d'ordonnancement \u00e0 dur\u00e9es \u00e9gales\u201d, QUESTIO, 5(4), 219\u2013228 (1981).","journal-title":"QUESTIO"},{"key":"5595_CR3","unstructured":"Chrobak M., C. D\u00fcrr, W. Jawor, \u0141. Kowalik, and M. Kurowski, \u201cA note on scheduling equal-length jobs to maximize throughput\u201d, technical report, arxiv.org, 2004."},{"issue":"2","key":"5595_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M. Garey","year":"1981","unstructured":"Garey M., D. Johnson, B. Simons, and R. Tarjan, \u201cScheduling unit-time tasks with arbitrary release times and deadlines,\u201d SIAM Journal on Computing, 10(2),256\u2013269 (1981).","journal-title":"SIAM Journal on Computing"},{"key":"5595_CR5","doi-asserted-by":"crossref","unstructured":"Simons. B., \u201cA fast algorithm for single processor scheduling,\u201d in Proceedings IEEE 19th Annual Symposium on Foundations of Computer Science (FOCS'78), 1978 pp. 246\u2013252.","DOI":"10.1109\/SFCS.1978.4"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-5595-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-006-5595-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-5595-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-5595-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,14]],"date-time":"2022-05-14T02:32:12Z","timestamp":1652495532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-006-5595-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["5595"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-5595-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}