{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:39:32Z","timestamp":1725557972915},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642143540"},{"type":"electronic","value":"9783642143557"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14355-7_31","type":"book-chapter","created":{"date-parts":[[2010,6,23]],"date-time":"2010-06-23T13:34:40Z","timestamp":1277300080000},"page":"304-313","source":"Crossref","is-referenced-by-count":0,"title":["Online Splitting Interval Scheduling on m Identical Machines"],"prefix":"10.1007","author":[{"given":"Feifeng","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"A.W.J. Kolen","year":"2007","unstructured":"Kolen, A.W.J., Lenstra, J.K., Papadimitriou, C.H., Spieksma, F.C.R.: Interval Scheduling: A survey. Naval Research Logistics\u00a054, 530\u2013543 (2007)","journal-title":"Naval Research Logistics"},{"key":"31_CR2","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: Proceedings of Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1994), pp. 302\u2013311 (1994)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Faigle, U., Garbe, R., Kern, W.: Randomized online algorithms for maximizing busy time interval scheduling. Computing, 95\u2013104 (1996)","DOI":"10.1007\/BF02309339"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(95)00112-5","volume":"58","author":"U. Faigle","year":"1995","unstructured":"Faigle, U., Nawijn, W.M.: Note on scheduling intervals on-line. Discrete Applied Mathmatics\u00a058, 13\u201317 (1995)","journal-title":"Discrete Applied Mathmatics"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(93)E0174-W","volume":"59","author":"M.C. Carlisle","year":"1995","unstructured":"Carlisle, M.C., Lloyd, E.L.: On the k-coloring of intervals. Discrete Applied Mathmatics\u00a059, 225\u2013235 (1995)","journal-title":"Discrete Applied Mathmatics"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Thibault, N., Laforest, C.: On-line time-constrained scheduling problem for the size on k machines. In: The 8th International Symposium on Parallel Architectures, Algorithms and Networks, pp. 20\u201324 (2005)","DOI":"10.1109\/ISPAN.2005.65"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"G.J. Woeginger","year":"1994","unstructured":"Woeginger, G.J.: On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science\u00a0130, 5\u201316 (1994)","journal-title":"Theoretical Computer Science"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1137\/S0097539795283292","volume":"27","author":"R. Canetti","year":"1998","unstructured":"Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM Journal of Computing\u00a027, 993\u20131015 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Seiden, S.S.: Randomized online interval scheduling. Operations Research Letters, 171\u2013177 (1998)","DOI":"10.1016\/S0167-6377(98)00019-4"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/s10878-007-9131-z","volume":"16","author":"S.P.Y. Fung","year":"2008","unstructured":"Fung, S.P.Y., Poon, C.K., Zheng, F.F.: Online Interval Scheduling: Randomized and Multiprocessor Cases. Journal of Combinatorial Optimization\u00a016, 248\u2013262 (2008)","journal-title":"Journal of Combinatorial Optimization"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-93980-1_5","volume-title":"Approximation and Online Algorithms","author":"S.P.Y. Fung","year":"2009","unstructured":"Fung, S.P.Y., Poon, C.K., Zheng, F.F.: Improved Randomized Online Scheduling of Unit Length Intervals and Jobs. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol.\u00a05426, pp. 53\u201366. Springer, Heidelberg (2009)"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0166-218X(00)00176-1","volume":"103","author":"W. Xing","year":"2000","unstructured":"Xing, W., Zhang, J.: Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics\u00a0103, 259\u2013269 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"4531","DOI":"10.1080\/00207540410001720745","volume":"42","author":"Y.D. Kim","year":"2004","unstructured":"Kim, Y.D., Shim, S.O., Kim, S.B., Choi, Y.C., Yoon, H.: Parallel machine scheduling considering a job splitting property. International Journal of Production Research\u00a042, 4531\u20134546 (2004)","journal-title":"International Journal of Production Research"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1016\/j.cor.2006.04.006","volume":"35","author":"S.O. Shim","year":"2008","unstructured":"Shim, S.O., Kim, Y.D.: A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. Computers and Operations Research\u00a035, 863\u2013875 (2008)","journal-title":"Computers and Operations Research"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Annals of Discrete Mathematics"},{"key":"31_CR16","volume-title":"Online computation and competitive analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-yaniv, R.: Online computation and competitive analysis. Cambridge University Press, Cambridge (1998)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14355-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:25:13Z","timestamp":1619785513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14355-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642143540","9783642143557"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14355-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}