{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:59:03Z","timestamp":1725544743842},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540327554"},{"type":"electronic","value":"9783540327561"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_56","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T06:50:30Z","timestamp":1140159030000},"page":"605-616","source":"Crossref","is-referenced-by-count":2,"title":["Design and Analysis of Online Batching Systems"],"prefix":"10.1007","author":[{"given":"Regant Y. S.","family":"Hung","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hing-Fung","family":"Ting","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"56_CR1","unstructured":"Aggarwal, C.C., Wolf, J.L., Yu, P.S.: On optimal batching policies for video-ondemand storage servers. In: Proceedings of the IEEE International Conference on Multimedia Computing Multimedia Computing and Systems, pp. 200\u2013209 (1996)"},{"key":"56_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0360-8352(01)00009-2","volume":"39","author":"M. Azizoglu","year":"2001","unstructured":"Azizoglu, M., Webster, S.: Scheduling a batch processing machine with incompatible job families. Computer and Industrial Engineering\u00a039, 325\u2013335 (2001)","journal-title":"Computer and Industrial Engineering"},{"key":"56_CR3","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s001860000088","volume":"53","author":"P. Baptiste","year":"2000","unstructured":"Baptiste, P.: Batching identical jobs. Mathematical Methods of Operations Research\u00a053, 355\u2013367 (2000)","journal-title":"Mathematical Methods of Operations Research"},{"key":"56_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(02)00231-7","volume":"129","author":"A. Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., Garay, J.A., Herzberg, A.: Sharing video on demand. Discrete Applied Mathematics\u00a0129, 3\u201330 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Goshi, J., Ladner, R.: Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architecture, pp. 164\u2013173 (2003)","DOI":"10.1145\/777412.777439"},{"key":"56_CR6","unstructured":"Bar-Noy, A., Guha, S., Katz, Y., Naor, J., Schieber, B., Shachnai, H.: Throughput maximization of real-time scheduling with batching. In: Proceedings of the 13th Symposium on Discrete Algorithms, pp. 742\u2013751 (2002)"},{"key":"56_CR7","unstructured":"Bar-Noy, A., Ladner, R.E., Tamir, T.: Scheduling techniques for media-ondemand. In: Proceeding of the Annual ACM\/SIAM Symposium on Discrete Algorithms, pp. 791\u2013800 (2003)"},{"key":"56_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0166-218X(02)00233-0","volume":"129","author":"C. Bouras","year":"2002","unstructured":"Bouras, C., Kapoulas, V., Pantziou, G., Spirakis, P.: Competitive video on demand schedulers for popular movies. Discrete Applied Mathematics\u00a0129, 49\u201361 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"56_CR9","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.Y., Potts, C., Tauthenhahn, T., Van de Velde, S.L.: Scheduling a batching machine. Journal of Scheduling\u00a01, 31\u201354 (1998)","journal-title":"Journal of Scheduling"},{"issue":"3","key":"56_CR10","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s005300050016","volume":"4","author":"A. Dan","year":"1996","unstructured":"Dan, A., Sitaram, D., Shahabuddin, P.: Dynamic batching policies for an ondemand video server. ACM Multimedia Systems Journal\u00a04(3), 112\u2013121 (1996)","journal-title":"ACM Multimedia Systems Journal"},{"key":"56_CR11","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Pruhs, K.: Multicast pull scheduling: when fairness is fine. Algorithmica (2003)","DOI":"10.1007\/s00453-003-1018-5"},{"key":"56_CR12","unstructured":"Engebretsen, L., Sudan, M.: Harmonic broadcasting is optimal. In: Proceeding of the Annual ACM\/SIAM Symposium on Discrete Algorithms, pp. 431\u2013432 (2002)"},{"key":"56_CR13","unstructured":"Evans, W., Kirkpatrick, D.: Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth differ. In: Proceeding of the Annua ACM\/SIAM Symposium on Discrete Algorithms, may 2004, pp. 1041\u20131049 (2004)"},{"key":"56_CR14","unstructured":"Goldwasser, M.: Patience is a virtue: The effect of slack on competitiveness for admission control. In: Proceedings of the 10th Annual Symposium on Discrete Algorithms, pp. 396\u2013405 (1999)"},{"key":"56_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-540-39658-1_30","volume-title":"Algorithms - ESA 2003","author":"B. Kalyanasundaram","year":"2003","unstructured":"Kalyanasundaram, B., Velauthapillai, M.: On-demand broadcasting under deadline. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 313\u2013324. Springer, Heidelberg (2003)"},{"key":"56_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-45071-8_42","volume-title":"Computing and Combinatorics","author":"J.H. Kim","year":"2003","unstructured":"Kim, J.H., Chwa, K.Y.: Scheduling broadcasts with deadlines. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 415\u2013424. Springer, Heidelberg (2003)"},{"key":"56_CR17","first-page":"165","volume":"32","author":"S.V. Mehta","year":"1998","unstructured":"Mehta, S.V., Uzsoy, R.: Minimizing total tardiness on a batch processing machine with incompatible jobs types. IIE Transactions\u00a032, 165\u2013175 (1998)","journal-title":"IIE Transactions"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:43:58Z","timestamp":1552362238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11682462_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}