{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:47:02Z","timestamp":1770972422296,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642296994","type":"print"},{"value":"9783642297007","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_15","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"161-171","source":"Crossref","is-referenced-by-count":8,"title":["Online Minimum Makespan Scheduling with a Buffer"],"prefix":"10.1007","author":[{"given":"Yan","family":"Lan","sequence":"first","affiliation":[]},{"given":"Xin","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Ning","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Gy\u00f6rgy","family":"D\u00f3sa","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S. Albers","year":"1999","unstructured":"Albers, S.: Better bounds for online scheduling. SIAM J. Comput.\u00a029(2), 459\u2013473 (1999)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y. Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Karloff, H., Vohra, R.: New algorithms for an ancient scheduling problem. J. Comput. Syst. Sci.\u00a051(3), 359\u2013366 (1995)","journal-title":"J. Comput. Syst. Sci."},{"issue":"45","key":"15_CR3","doi-asserted-by":"publisher","first-page":"6269","DOI":"10.1016\/j.tcs.2011.07.014","volume":"412","author":"X. Chen","year":"2011","unstructured":"Chen, X., Lan, Y., Benko, A., D\u00f3sa, G., Han, X.: Optimal algorithms for online scheduling with bounded rearrangement at the end. Theor. Comput. Sci.\u00a0412(45), 6269\u20136278 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10878-008-9200-y","volume":"20","author":"G. D\u00f3sa","year":"2010","unstructured":"D\u00f3sa, G., Epstein, L.: Online scheduling with a buffer on related machines. J. Comb. Optim.\u00a020(2), 161\u2013179 (2010)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"15_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1137\/090766139","volume":"25","author":"G. D\u00f3sa","year":"2011","unstructured":"D\u00f3sa, G., Epstein, L.: Preemptive online scheduling with reordering. SIAM J. Discrete Math.\u00a025(1), 21\u201349 (2011)","journal-title":"SIAM J. Discrete Math."},{"issue":"8-10","key":"15_CR6","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.tcs.2010.10.019","volume":"412","author":"G. D\u00f3sa","year":"2011","unstructured":"D\u00f3sa, G., Wang, Y., Han, X., Guo, H.: Online scheduling with rearrangement on two related machines. Theor. Comput. Sci.\u00a0412(8-10), 642\u2013653 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Englert, M., \u00d6zmen, D., Westermann, M.: The power of reordering for online minimum makespan scheduling. In: Proc. 48th Symp. Foundations of Computer Science (FOCS), pp. 603\u2013612 (2008)","DOI":"10.1109\/FOCS.2008.46"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1002\/1099-1425(200011\/12)3:6<343::AID-JOS54>3.0.CO;2-2","volume":"3","author":"R. Fleischer","year":"2000","unstructured":"Fleischer, R., Wahl, M.: Online scheduling revisited. Journal of Scheduling\u00a03, 343\u2013353 (2000)","journal-title":"Journal of Scheduling"},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/0216037","volume":"16","author":"D.K. Friesen","year":"1987","unstructured":"Friesen, D.K.: Tighter bounds for lpt scheduling on uniform processors. SIAM J. Comput.\u00a016(3), 554\u2013560 (1987)","journal-title":"SIAM J. Comput."},{"key":"15_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)"},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R.L. Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics\u00a017(2), 416\u2013429 (1969)","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"3","key":"15_CR12","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D.S. Hochbaum","year":"1988","unstructured":"Hochbaum, D.S., Shmoys, D.B.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1137\/S0097539702403438","volume":"32","author":"J.F. Rudin III","year":"2003","unstructured":"Rudin III, J.F., Chandrasekaran, R.: Improved bounds for the online scheduling problem. SIAM J. Comput.\u00a032(3), 717\u2013735 (2003)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR14","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"D.R. Karger","year":"1996","unstructured":"Karger, D.R., Phillips, S.J., Torng, E.: A better algorithm for an ancient scheduling problem. J. Algorithms\u00a020(2), 400\u2013430 (1996)","journal-title":"J. Algorithms"},{"issue":"5","key":"15_CR15","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/S0167-6377(98)00005-4","volume":"21","author":"H. Kellerer","year":"1997","unstructured":"Kellerer, H., Kotov, V., Speranza, M.G., Tuza, Z.: Semi on-line algorithms for the partition problem. Oper. Res. Lett.\u00a021(5), 235\u2013242 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"21-23","key":"15_CR16","doi-asserted-by":"publisher","first-page":"2099","DOI":"10.1016\/j.tcs.2009.01.007","volume":"410","author":"M. Liu","year":"2009","unstructured":"Liu, M., Xu, Y., Chu, C., Zheng, F.: Online scheduling on two uniform machines to minimize the makespan. Theor. Comput. Sci.\u00a0410(21-23), 2099\u20132109 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR17","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1287\/moor.1090.0381","volume":"34","author":"P. Sanders","year":"2009","unstructured":"Sanders, P., Sivadasan, N., Skutella, M.: Online scheduling with bounded migration. Math. Oper. Res.\u00a034(2), 481\u2013498 (2009)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"15_CR18","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.orl.2007.06.004","volume":"36","author":"Z. Tan","year":"2008","unstructured":"Tan, Z., Yu, S.: Online scheduling with reassignment. Oper. Res. Lett.\u00a036(2), 250\u2013254 (2008)","journal-title":"Oper. Res. Lett."},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(97)00006-9","volume":"61","author":"G. Zhang","year":"1997","unstructured":"Zhang, G.: A simple semi on-line algorithm for p2\/\/c\n                  max\n                 with a buffer. Information Processing Letters\u00a061, 145\u2013148 (1997)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:14:01Z","timestamp":1620126841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}