{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T05:28:16Z","timestamp":1648790896405},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T00:00:00Z","timestamp":1259280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2010,3]]},"DOI":"10.1007\/s11786-009-0003-z","type":"journal-article","created":{"date-parts":[[2009,11,27]],"date-time":"2009-11-27T16:28:57Z","timestamp":1259339337000},"page":"73-84","source":"Crossref","is-referenced-by-count":0,"title":["Preemptive Scheduling of Equal-Length Jobs in Polynomial Time"],"prefix":"10.1007","volume":"3","author":[{"given":"George B.","family":"Mertzios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Unger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,11,27]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.38.3.487","volume":"38","author":"L.A. Herrbach","year":"1990","unstructured":"Herrbach L.A., Leung J.Y.-T.: Preemptive scheduling of equal length jobs on two machines to minimize mean flow time. Oper. Res. 38, 487\u2013494 (1990)","journal-title":"Oper. Res."},{"issue":"2","key":"3_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10951-006-0006-4","volume":"10","author":"P. Baptiste","year":"2007","unstructured":"Baptiste P., Brucker P., Chrobak M., Durr C., Kravchenko S.A., Sourd F.: The complexity of mean flow time scheduling problems with release times. J. Sched. 10(2), 139\u2013146 (2007)","journal-title":"J. Sched."},{"key":"3_CR3","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability, a Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"1\u20134","key":"3_CR4","first-page":"125","volume":"26","author":"E.L. Lawler","year":"1990","unstructured":"Lawler E.L.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Discrete Math. 26(1\u20134), 125\u2013133 (1990)","journal-title":"Ann. Discrete Math."},{"key":"3_CR5","doi-asserted-by":"crossref","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.: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal. J. Sched. 2, 245\u2013252 (1999)","journal-title":"J. Sched."},{"issue":"3","key":"3_CR6","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/j.orl.2003.09.004","volume":"32","author":"P. Baptiste","year":"2004","unstructured":"Baptiste P., Chrobak M., D\u00fcrr Ch., Jawor W., Vakhania N.: Preemptive scheduling of equal-length jobs to maximize weighted throughput. Oper. Res. Lett. 32(3), 258\u2013264 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"3_CR7","first-page":"343","volume":"9","author":"Z. Tian","year":"2006","unstructured":"Tian Z., Ng C.T., Cheng T.C.E.: An O(n 2) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness. SIAM J. Comput. 9(4), 343\u2013364 (2006)","journal-title":"SIAM J. Comput."},{"key":"3_CR8","volume-title":"Introduction to Sequencing and Scheduling","author":"K.R. Baker","year":"1974","unstructured":"Baker K.R.: Introduction to Sequencing and Scheduling. Wiley, New York (1974)"},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0167-6377(98)00045-5","volume":"24","author":"P. Baptiste","year":"1999","unstructured":"Baptiste P.: An o(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24, 175\u2013180 (1999)","journal-title":"Oper. Res. Lett."},{"key":"3_CR10","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2007","unstructured":"Brucker P.: Scheduling Algorithms, 5th edn. Springer, Heidelberg (2007)","edition":"5"},{"key":"3_CR11","unstructured":"Brucker, P., Knust, S.: Complexity results for scheduling problems. http:\/\/www.mathematik.uni-osnabrueck.de\/research\/OR\/class\/"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M.R. Garey","year":"1981","unstructured":"Garey M.R., Johnson D.R., Simons B.B., Tarjan R.E.: Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J. Comput. 10, 256\u2013269 (1981)","journal-title":"SIAM J. Comput."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0212018","volume":"12","author":"B. Simons","year":"1983","unstructured":"Simons B.: Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines. SIAM J. Comput. 12, 294\u2013299 (1983)","journal-title":"SIAM J. Comput."},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra J.K., Rinnooy Kan A.H.G., Brucker P.: Complexity of machine scheduling problems. Ann. Discrete Math. 1, 343\u2013362 (1977)","journal-title":"Ann. Discrete Math."},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1467-9574.1990.tb01276.x","volume":"44","author":"M.I. Dessouky","year":"1990","unstructured":"Dessouky M.I., Lageweg B.J., Lenstra J.K., van de Velde S.L.: Scheduling identical jobs on uniform parallel machines. Stat. Neerl. 44, 115\u2013123 (1990)","journal-title":"Stat. Neerl."},{"key":"3_CR16","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00238-3","volume":"103","author":"P. Baptiste","year":"2000","unstructured":"Baptiste P.: Scheduling equal-length jobs on identical parallel machines. Discrete Appl. Math. 103, 21\u201332 (2000)","journal-title":"Discrete Appl. Math."},{"key":"3_CR17","unstructured":"Baptiste, P., D\u00fcrr, C.: http:\/\/www.lix.polytechnique.fr\/~durr\/OpenProblems\/1_rj_pmtn_pjp_sumWjCj\/"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Labetoulle, J., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Preemptive scheduling of uniform machines subject to release dates. In: Progress in Combinatorial Optimization, pp. 245\u2013261. Academic Press, Toronto (1984)","DOI":"10.1016\/B978-0-12-566780-7.50020-9"},{"key":"3_CR19","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0020-0190(90)90229-Q","volume":"34","author":"J.Y.-T. Leung","year":"1990","unstructured":"Leung J.Y.-T., Young G.H.: Preemptive scheduling to minimize mean weighted flow time. Inform. Process. Lett. 34, 47\u201350 (1990)","journal-title":"Inform. Process. Lett."}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0003-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-009-0003-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-009-0003-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T22:32:27Z","timestamp":1559428347000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-009-0003-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,27]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,3]]}},"alternative-id":["3"],"URL":"https:\/\/doi.org\/10.1007\/s11786-009-0003-z","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,27]]}}}