{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:13Z","timestamp":1725565873763},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_32","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"358-370","source":"Crossref","is-referenced-by-count":11,"title":["Online Scheduling of Equal-Length Jobs: Randomization and Restarts Help"],"prefix":"10.1007","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Jawor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Sgall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Tich\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","first-page":"134","volume-title":"Proc. 34th Symp. Theory of Computing (STOC)","author":"S. Albers","year":"2002","unstructured":"Albers, S.: On randomized online scheduling. In: Proc. 34th Symp. Theory of Computing (STOC), pp. 134\u2013143. ACM, New York (2002)"},{"key":"32_CR2","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.: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times. J. of Scheduling\u00a02, 245\u2013252 (1999)","journal-title":"J. of Scheduling"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1999.2809","volume":"158","author":"Y. Bartal","year":"2000","unstructured":"Bartal, Y., Chrobak, M., Larmore, L.L.: A randomized algorithm for two servers on the line. Information and Computation\u00a0158, 53\u201369 (2000)","journal-title":"Information and Computation"},{"issue":"4","key":"32_CR4","first-page":"219","volume":"5","author":"J. Carlier","year":"1981","unstructured":"Carlier, J.: Probl\u00e8mes d\u2019ordonnancement \u00e0 dur\u00e9es \u00e9gales. QUESTIO\u00a05(4), 219\u2013228 (1981)","journal-title":"QUESTIO"},{"key":"32_CR5","unstructured":"Chrobak, M., D\u00fcrr, C., Jawor, W., Kowalik, \u0141., Kurowski, M.: A note on scheduling equal-length jobs to maximize throughput (2004) (manuscript)"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1002\/jos.60","volume":"4","author":"L. Epstein","year":"2001","unstructured":"Epstein, L., Noga, J., Seiden, S.S., Sgall, J., Woeginger, G.J.: Randomized on-line scheduling for two related machines. J. of Scheduling\u00a04, 71\u201392 (2001)","journal-title":"J. of Scheduling"},{"issue":"2","key":"32_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1137\/0210018","volume":"10","author":"M. Garey","year":"1981","unstructured":"Garey, M., Johnson, D., Simons, B., Tarjan, R.: Scheduling unit-time tasks with arbitrary release times and deadlines. SIAM J. on Computing\u00a010(2), 256\u2013269 (1981)","journal-title":"SIAM J. on Computing"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1006\/jagm.1999.1060","volume":"34","author":"S.A. Goldman","year":"2000","unstructured":"Goldman, S.A., Parwatikar, J., Suri, S.: Online scheduling with hard deadlines. J. of Algorithms\u00a034, 370\u2013389 (2000)","journal-title":"J. of Algorithms"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1022994010777","volume":"6","author":"M.H. Goldwasser","year":"2003","unstructured":"Goldwasser, M.H.: Patience is a virtue: The effect of slack on the competitiveness for admission control. J. of Scheduling\u00a06, 183\u2013211 (2003)","journal-title":"J. of Scheduling"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1023\/A:1022956425198","volume":"6","author":"M.H. Goldwasser","year":"2003","unstructured":"Goldwasser, M.H., Kerbikov, B.: Admission control with immediate notification. J. of Scheduling\u00a06, 269\u2013285 (2003)","journal-title":"J. of Scheduling"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/S0167-6377(00)00061-4","volume":"27","author":"H. Hoogeveen","year":"2000","unstructured":"Hoogeveen, H., Potts, C.N., Woeginger, G.J.: On-line scheduling on a single machine: Maximizing the number of early jobs. Operations Research Letters\u00a027, 193\u2013196 (2000)","journal-title":"Operations Research Letters"},{"key":"32_CR12","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: Proc. 5th Symp. on Discrete Algorithms (SODA), pp. 302\u2013311. ACM\/SIAM (1994)"},{"key":"32_CR13","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF01294261","volume":"11","author":"N. Reingold","year":"1994","unstructured":"Reingold, N., Westbrook, J., Sleator, D.D.: Randomized competitive algorithms for the list update problem. Algorithmica\u00a011, 15\u201332 (1994)","journal-title":"Algorithmica"},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1023\/A:1022960526107","volume":"6","author":"S. Seiden","year":"2003","unstructured":"Seiden, S.: Barely random algorithms for multiprocessor scheduling. J. of Scheduling\u00a06, 309\u2013334 (2003)","journal-title":"J. of Scheduling"},{"key":"32_CR15","first-page":"246","volume-title":"Proc. 19th Symp. on Foundations of Computer Science (FOCS)","author":"B. Simons","year":"1978","unstructured":"Simons, B.: A fast algorithm for single processor scheduling. In: Proc. 19th Symp. on Foundations of Computer Science (FOCS), pp. 246\u2013252. IEEE, Los Alamitos (1978)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:56Z","timestamp":1620012656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}