{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,21]],"date-time":"2026-10-21T04:15:49Z","timestamp":1792556149180,"version":"4.5.0"},"reference-count":12,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1989,8]]},"abstract":"<jats:p>An efficient polynomial time algorithm for the problem of scheduling n unit length jobs with rational release times and deadlines on m identical parallel machines is presented. By using preprocessing, a running time of $O(mn^2 )$ is obtained that is an improvement over the previous best running time of $O(n^3 \\log \\log n)$. The authors also present new NP-completeness results for two closely related problems.<\/jats:p>","DOI":"10.1137\/0218048","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:32:44Z","timestamp":1109226764000},"page":"690-710","source":"Crossref","is-referenced-by-count":50,"title":["A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs"],"prefix":"10.1137","volume":"18","author":[{"given":"Barbara B.","family":"Simons","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","unstructured":"J. Carlier,  Probl\u00e8me \u00e0 une machine dans le cas o\u00f9 les t\u00e2ches ant des dur\u00e9es \u00e9gales, Tech. Report, Institut de Programmation, Universit\u00e9 de Paris VI, Paris, France,  1979"},{"key":"R2","unstructured":"D. Dolev, B. Simons, M. Warmuth, private communication"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90117-5"},{"key":"R4","volume-title":"Computers and intractability","author":"Garey Michael R.","year":"1979"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1137\/0210018"},{"key":"R6","unstructured":"H. Gabow, M. Stallmann,  Scheduling multitask jobs with deadlines on one processor, manuscript"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90014-5"},{"key":"R8","unstructured":"J. R. Jackson,  Scheduling a production line to minimize maximum tardiness, Res. Report, 43, Management Science Research Project, University of California, Los Angeles, CA,  1955"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70743-X"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.4"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/0212018"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80008-0"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0218048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:44:28Z","timestamp":1787337868000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0218048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,8]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,8]]}},"alternative-id":["10.1137\/0218048"],"URL":"https:\/\/doi.org\/10.1137\/0218048","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,8]]}}}