{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:57:03Z","timestamp":1725559023337},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_8","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"77-89","source":"Crossref","is-referenced-by-count":3,"title":["Optimally Competitive List Batching"],"prefix":"10.1007","author":[{"given":"Wolfgang W.","family":"Bein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence L.","family":"Larmore","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Noga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Albers, S., Bals, H.: Dynamic TCP acknowledgement: Penalizing long delays. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 47\u201355 (2003)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s001860000088","volume":"52","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P.: Batching identical jobs. Mathematical Methods of Operation Research\u00a052, 355\u2013367 (2000)","journal-title":"Mathematical Methods of Operation Research"},{"key":"8_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2001","unstructured":"Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (2001)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P. Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M., Potts, C., Tautenhahn, T., van de Velde, S.: Scheduling a batch processing machine. Journal of Scheduling\u00a01(1), 31\u201354 (1998)","journal-title":"Journal of Scheduling"},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1145\/375827.375843","volume":"48","author":"D.R. Dooly","year":"2001","unstructured":"Dooly, D.R., Goldman, S.A., Scott, S.D.: On-line analysis of the TCP acknowledgement delay problem. Journal of the ACM\u00a048(2), 243\u2013273 (2001)","journal-title":"Journal of the ACM"},{"key":"8_CR6","unstructured":"Epstein, L., Kesselman, A.: On the remote server problem or more about TCP acknowledgments (2003)(manuscript)"},{"issue":"6","key":"8_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"L. Epstein","year":"2002","unstructured":"Epstein, L., Noga, J., Woeginger, G.J.: On-line scheduling of unit time jobs with rejection: Minimizing the total completion time. Operations Research Letters\u00a030(6), 415\u2013420 (2002)","journal-title":"Operations Research Letters"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s002360050162","volume":"36","author":"A. Fiat","year":"1999","unstructured":"Fiat, A., Woeginger, G.J.: On-line scheduling on a single machine: Minimizing the total completion time. Acta Informatica\u00a036, 287\u2013293 (1999)","journal-title":"Acta Informatica"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0196-6774(03)00058-0","volume":"48","author":"J.S. Frederiksen","year":"2003","unstructured":"Frederiksen, J.S., Larsen, K.S., Noga, J., Uthaisombut, P.: Dynamic TCP acknowledgment in the logP model. Journal of Algorithms\u00a048(2), 407\u2013428 (2003)","journal-title":"Journal of Algorithms"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Hoogeveen, J.A., Vestjens, A.P.A.: Optimal on-line algorithms for singlemachine scheduling. In: Proc. 5th Conf. Integer Programming and Combinatorial (IPCO), pp. 404\u2013414 (1996)","DOI":"10.1007\/3-540-61310-2_30"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Lu, X., Sitters, R., Stougie, L.: A class of on-line scheduling algorithms to minimize total completion time. Operations Research Letters (2003) (to appear)","DOI":"10.1016\/S0167-6377(03)00016-6"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-60220-8_53","volume-title":"Algorithms and Data Structures","author":"C.A. Phillips","year":"1995","unstructured":"Phillips, C.A., Stein, C., Wein, J.: Scheduling jobs that arrive over time. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995. LNCS, vol.\u00a0955, pp. 86\u201397. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:21:47Z","timestamp":1605759707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}