{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T19:28:51Z","timestamp":1773689331746,"version":"3.50.1"},"reference-count":114,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T00:00:00Z","timestamp":1523577600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"German-Israeli Foundation for Scientific Research and Development (IL)","award":["I-1366-407.6\/2016"],"award-info":[{"award-number":["I-1366-407.6\/2016"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10951-018-0567-z","type":"journal-article","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T06:14:48Z","timestamp":1523600088000},"page":"269-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["A survey on makespan minimization in semi-online environments"],"prefix":"10.1007","volume":"21","author":[{"given":"Leah","family":"Epstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,13]]},"reference":[{"key":"567_CR1","doi-asserted-by":"crossref","unstructured":"Albers, S. (2002) On randomized online scheduling. In Proceedings of the on 34th annual ACM symposium on theory of computing (STOC2002) (pp. 134\u2013143).","DOI":"10.1145\/509907.509930"},{"key":"567_CR2","doi-asserted-by":"crossref","unstructured":"Albers, S. (2013). Recent advances for a classical scheduling problem. In Proceedings of the 40th international colloquium on automata, languages, and programming, (ICALP2013), part II (pp. 4\u201314).","DOI":"10.1007\/978-3-642-39212-2_2"},{"issue":"2","key":"567_CR3","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1137\/S0097539797324874","volume":"29","author":"S Albers","year":"1999","unstructured":"Albers, S. (1999). Better bounds for online scheduling. SIAM Journal on Computing, 29(2), 459\u2013473.","journal-title":"SIAM Journal on Computing"},{"key":"567_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2012.03.031","volume":"443","author":"S Albers","year":"2012","unstructured":"Albers, S., & Hellwig, M. (2012). Semi-online scheduling revisited. Theoretical Computer Science, 443, 1\u20139.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"567_CR5","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1007\/s00453-016-0209-9","volume":"79","author":"S Albers","year":"2017","unstructured":"Albers, S., & Hellwig, M. (2017a). On the value of job migration in online makespan minimization. Algorithmica, 79(2), 598\u2013623.","journal-title":"Algorithmica"},{"issue":"2","key":"567_CR6","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1007\/s00453-016-0172-5","volume":"78","author":"S Albers","year":"2017","unstructured":"Albers, S., & Hellwig, M. (2017b). Online makespan minimization with parallel schedules. Algorithmica, 78(2), 492\u2013520.","journal-title":"Algorithmica"},{"issue":"4","key":"567_CR7","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/PL00009263","volume":"23","author":"M Andrews","year":"1999","unstructured":"Andrews, M., Goemans, M. X., & Zhang, L. (1999). Improved bounds for on-line load balancing. Algorithmica, 23(4), 278\u2013301.","journal-title":"Algorithmica"},{"issue":"4","key":"567_CR8","first-page":"285","volume":"8","author":"E Angelelli","year":"2000","unstructured":"Angelelli, E. (2000). Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks. Central European Journal of Operations Research, 8(4), 285\u2013295.","journal-title":"Central European Journal of Operations Research"},{"issue":"6","key":"567_CR9","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/B:JOSH.0000046074.03560.5d","volume":"7","author":"E Angelelli","year":"2004","unstructured":"Angelelli, E., Nagy, \u00c1. B., Speranza, M. G., & Tuza, Z. (2004). The on-line multiprocessor scheduling problem with known sum of the tasks. Journal of Scheduling, 7(6), 421\u2013428.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"567_CR10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10951-007-0023-y","volume":"10","author":"E Angelelli","year":"2007","unstructured":"Angelelli, E., Nagy, \u00c1. B., Speranza, M. G., & Tuza, Z. (2007). Semi on-line scheduling on three processors with known sum of the tasks. Journal of Scheduling, 10(4), 263\u2013269.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"567_CR11","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s00453-003-1037-2","volume":"37","author":"E Angelelli","year":"2003","unstructured":"Angelelli, E., Speranza, M. G., & Tuza, Z. (2003). Semi-on-line scheduling on two parallel processors with an upper bound on the items. Algorithmica, 37(4), 243\u2013262.","journal-title":"Algorithmica"},{"issue":"1","key":"567_CR12","first-page":"1","volume":"8","author":"E Angelelli","year":"2006","unstructured":"Angelelli, E., Speranza, M. G., & Tuza, Z. (2006). New bounds and algorithms for on-line scheduling: Two identical processors, known sum and upper bound on the tasks. Discrete Mathematics and Theoretical Computer Science, 8(1), 1\u201316.","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"issue":"1\u20133","key":"567_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.tcs.2007.12.005","volume":"393","author":"E Angelelli","year":"2008","unstructured":"Angelelli, E., Speranza, M. G., & Tuza, Z. (2008). Semi-online scheduling on two uniform processors. Theoretical Computer Science, 393(1\u20133), 211\u2013219.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"567_CR14","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S. A., & Waarts, O. (1997). On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3), 486\u2013504.","journal-title":"Journal of the ACM"},{"issue":"1","key":"567_CR15","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0304-3975(00)00258-9","volume":"268","author":"Y Azar","year":"2001","unstructured":"Azar, Y., & Regev, O. (2001). On-line bin-stretching. Theoretical Computer Science, 268(1), 17\u201341.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"567_CR16","first-page":"241","volume":"4","author":"G Baram","year":"2014","unstructured":"Baram, G., & Tamir, T. (2014). Reoptimization of the minimum total flow-time scheduling problem. Sustainable Computing: Informatics and Systems, 4(4), 241\u2013251.","journal-title":"Sustainable Computing: Informatics and Systems"},{"issue":"5","key":"567_CR17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1002\/1099-1425(200009\/10)3:5<259::AID-JOS47>3.0.CO;2-3","volume":"3","author":"A Bar-Noy","year":"2000","unstructured":"Bar-Noy, A., Freund, A., & Naor, J. (2000). New algorithms for related machines with temporary jobs. Journal of Scheduling, 3(5), 259\u2013272.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"567_CR18","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Karloff, H. J., & Vohra, R. (1995). New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences, 51(3), 359\u2013366.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"567_CR19","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(94)00026-3","volume":"50","author":"Y Bartal","year":"1994","unstructured":"Bartal, Y., Karloff, H. J., & Rabani, Y. (1994). A better lower bound for on-line scheduling. Information Processing Letters, 50(3), 113\u2013116.","journal-title":"Information Processing Letters"},{"issue":"1","key":"567_CR20","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jagm.1999.1070","volume":"35","author":"P Berman","year":"2000","unstructured":"Berman, P., Charikar, M., & Karpinski, M. (2000). On-line load balancing for related machines. Journal of Algorithms, 35(1), 108\u2013121.","journal-title":"Journal of Algorithms"},{"issue":"6","key":"567_CR21","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/s10951-016-0504-y","volume":"20","author":"M B\u00f6hm","year":"2017","unstructured":"B\u00f6hm, M., Sgall, J., van Stee, R., & Vesel\u00fd, P. (2017a). Online bin stretching with three bins. Journal of Scheduling, 20(6), 601\u2013621.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"567_CR22","first-page":"810","volume":"34","author":"M B\u00f6hm","year":"2017","unstructured":"B\u00f6hm, M., Sgall, J., van Stee, R., & Vesel\u00fd, P. (2017b). A two-phase algorithm for bin stretching with stretching factor 1.5. Journal of Combinaorial. Optimization, 34(3), 810\u2013828.","journal-title":"Optimization"},{"key":"567_CR23","doi-asserted-by":"crossref","unstructured":"Boyar, J., Favrholdt, L. M., Kudahl, C., & Mikkelsen, J. W. (2016). Weighted online problems with advice. In Proceedings of the 27th international workshop on combinatorial algorithms (IWOCA2016) (pp. 179\u2013190).","DOI":"10.1007\/978-3-319-44543-4_14"},{"issue":"4","key":"567_CR24","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/s10878-009-9254-5","volume":"21","author":"S-Y Cai","year":"2011","unstructured":"Cai, S.-Y., & Yang, Q.-F. (2011). Semi-online scheduling on two uniform machines with the known largest size. Journal of Combinatorial Optimization, 21(4), 393\u2013408.","journal-title":"Journal of Combinatorial Optimization"},{"key":"567_CR25","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.tcs.2012.07.005","volume":"457","author":"Q Cao","year":"2012","unstructured":"Cao, Q., Cheng, T., Wan, G., & Li, Y. (2012). Several semi-online scheduling problems on two identical machines with combined information. Theoretical Computer Science, 457, 35\u201344.","journal-title":"Theoretical Computer Science"},{"issue":"31\u201333","key":"567_CR26","doi-asserted-by":"crossref","first-page":"2890","DOI":"10.1016\/j.tcs.2010.04.020","volume":"411","author":"Q Cao","year":"2010","unstructured":"Cao, Q., & Liu, Z. (2010a). Online scheduling with reassignment on two uniform machines. Theoretical Computer Science, 411(31\u201333), 2890\u20132898.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"567_CR27","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10878-009-9214-0","volume":"20","author":"Q Cao","year":"2010","unstructured":"Cao, Q., & Liu, Z. (2010b). Semi-online scheduling with known maximum job size on two uniform machines. Journal of Combinatorial Optimization, 20(4), 369\u2013384.","journal-title":"Journal of Combinatorial Optimization"},{"key":"567_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.08.022","volume":"652","author":"Q Cao","year":"2016","unstructured":"Cao, Q., & Liu, Z. (2016). Semi-online scheduling with bounded job sizes on two uniform machines. Theoretical Computer Science, 652, 1\u201317.","journal-title":"Theoretical Computer Science"},{"issue":"29","key":"567_CR29","doi-asserted-by":"crossref","first-page":"3731","DOI":"10.1016\/j.tcs.2011.03.032","volume":"412","author":"Q Cao","year":"2011","unstructured":"Cao, Q., Liu, Z., & Cheng, T. C. E. (2011). Semi-online scheduling with known partial information about job sizes on two identical machines. Theoretical Computer Science, 412(29), 3731\u20133737.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"567_CR30","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1007\/s10878-014-9778-1","volume":"31","author":"Q Cao","year":"2016","unstructured":"Cao, Q., & Wan, G. (2016). Semi-online scheduling with combined information on two identical machines in parallel. Journal of Combinatorial Optimization, 31(2), 686\u2013695.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"567_CR31","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1137\/S0097539793258775","volume":"26","author":"R Chandrasekaran","year":"1997","unstructured":"Chandrasekaran, R., Chen, B., Galambos, G., Narayanan, P. R., & van Vliet, A. (1997). A note on \u201can on-line scheduling heuristic with better worst case ratio than Graham\u2019s list scheduling\u201d. SIAM Journal on Computing, 26(3), 870\u2013872.","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20133","key":"567_CR32","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.tcs.2004.11.018","volume":"337","author":"TCE Cheng","year":"2005","unstructured":"Cheng, T. C. E., Kellerer, H., & Kotov, V. (2005). Semi-on-line multiprocessor scheduling with given total processing time. Theoretical Computer Science, 337(1\u20133), 134\u2013146.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"567_CR33","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/j.orl.2012.05.009","volume":"40","author":"TCE Cheng","year":"2012","unstructured":"Cheng, T. C. E., Kellerer, H., & Kotov, V. (2012). Algorithms better than LPT for semi-online scheduling with decreasing processing times. Operations Research Letters, 40(5), 349\u2013352.","journal-title":"Operations Research Letters"},{"issue":"3","key":"567_CR34","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.ipl.2006.02.012","volume":"99","author":"TCE Cheng","year":"2006","unstructured":"Cheng, T. C. E., Ng, C. T., & Kotov, V. (2006). A new algorithm for online uniform-machine scheduling to minimize the makespan. Information Processing Letters, 99(3), 102\u2013105.","journal-title":"Information Processing Letters"},{"issue":"45","key":"567_CR35","doi-asserted-by":"crossref","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. (2011). Optimal algorithms for online scheduling with bounded rearrangement at the end. Theoretical Computer Science, 412(45), 6269\u20136278.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"567_CR36","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0167-6377(94)90071-X","volume":"16","author":"B Chen","year":"1994","unstructured":"Chen, B., van Vliet, A., & Woeginger, G. J. (1994). New lower and upper bounds for on-line scheduling. Operations Research Letters, 16(4), 221\u2013230.","journal-title":"Operations Research Letters"},{"issue":"1","key":"567_CR37","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","volume":"9","author":"Y Cho","year":"1980","unstructured":"Cho, Y., & Sahni, S. (1980). Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1), 91\u2013103.","journal-title":"SIAM Journal on Computing"},{"issue":"05","key":"567_CR38","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1142\/S0129054114500191","volume":"25","author":"N Ding","year":"2014","unstructured":"Ding, N., Lan, Y., Chen, X., D\u00f3sa, G., Guo, H., & Han, X. (2014). Online minimum makespan scheduling with a buffer. International Journal of Foundations of Computer Science, 25(05), 525\u2013536.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"4","key":"567_CR39","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1137\/0213044","volume":"13","author":"G Dobson","year":"1984","unstructured":"Dobson, G. (1984). Scheduling independent tasks on uniform processors. SIAM Journal on Computing, 13(4), 705\u2013716.","journal-title":"SIAM Journal on Computing"},{"key":"567_CR40","doi-asserted-by":"crossref","unstructured":"Dohrau, J. (2015). Online makespan scheduling with sublinear advice. In Proceedings of the 41st international conference on current trends in theory and practice of computer science (SOFSEM2015) (pp. 177\u2013188).","DOI":"10.1007\/978-3-662-46078-8_15"},{"key":"567_CR41","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ipl.2018.01.009","volume":"134","author":"A Dolgui","year":"2018","unstructured":"Dolgui, A., Kotov, V., Nekrashevich, A., & Quilliot, A. (2018). General parametric scheme for the online uniform machine scheduling problem with two different speeds. Information Processing Letters, 134, 18\u201323.","journal-title":"Information Processing Letters"},{"issue":"2","key":"567_CR42","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10878-008-9200-y","volume":"20","author":"G D\u00f3sa","year":"2010","unstructured":"D\u00f3sa, G., & Epstein, L. (2010). Online scheduling with a buffer on related machines. Journal of Combinatorial Optimization, 20(2), 161\u2013179.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"567_CR43","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10100-017-0481-z","volume":"26","author":"G D\u00f3sa","year":"2018","unstructured":"D\u00f3sa, G., F\u00fcgenschuh, A., Tan, Z., Tuza, Z., & W\u0119sek, K. (2018). Tight upper bounds for semi-online scheduling on two uniform machines with known optimum. Central European Journal of Operations Research, 26(1), 161\u2013180.","journal-title":"Central European Journal of Operations Research"},{"issue":"3\u20134","key":"567_CR44","first-page":"355","volume":"72","author":"G D\u00f3sa","year":"2004","unstructured":"D\u00f3sa, G., & He, Y. (2004). Semi-online algorithms for parallel machine scheduling problems. Computing, 72(3\u20134), 355\u2013363.","journal-title":"Computing"},{"issue":"4","key":"567_CR45","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1007\/s10878-009-9265-2","volume":"21","author":"G D\u00f3sa","year":"2011","unstructured":"D\u00f3sa, G., Speranza, M. G., & Tuza, Z. (2011). Two uniform machines with nearly equal speeds: Unified approach to known sum and known optimum in semi on-line scheduling. Journal of Combinatorial Optimization, 21(4), 458\u2013480.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"8\u201310","key":"567_CR46","doi-asserted-by":"crossref","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. (2011). Online scheduling with rearrangement on two related machines. Theoretical Computer Science, 412(8\u201310), 642\u2013653.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"567_CR47","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s10951-009-0119-7","volume":"12","author":"T Ebenlendr","year":"2009","unstructured":"Ebenlendr, T., & Sgall, J. (2009). Optimal and online preemptive scheduling on uniformly related machines. Journal of Scheduling, 12(5), 517\u2013527.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"567_CR48","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/s00224-010-9287-2","volume":"48","author":"T Ebenlendr","year":"2011","unstructured":"Ebenlendr, T., & Sgall, J. (2011). Semi-online preemptive scheduling: One algorithm for all variants. Theory of Computing Systems, 48(3), 577\u2013613.","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"567_CR49","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s00224-013-9451-6","volume":"56","author":"T Ebenlendr","year":"2015","unstructured":"Ebenlendr, T., & Sgall, J. (2015). A lower bound on deterministic online algorithms for scheduling on related machines without preemption. Theory of Computing Systems, 56(1), 73\u201381.","journal-title":"Theory of Computing Systems"},{"key":"567_CR50","doi-asserted-by":"crossref","unstructured":"Ehlers, T., & Jansen, K. (2013). Online-scheduling on identical machines with bounded migration. In Proceedings of the 15th international symposium on symbolic and numeric algorithms for scientific computing (SYNASC2013) (pp. 361\u2013366). New York: IEEE.","DOI":"10.1109\/SYNASC.2013.54"},{"key":"567_CR51","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s00450-011-0180-2","volume":"27","author":"M Englert","year":"2012","unstructured":"Englert, M. (2012). An overview of some results for reordering buffers. Computer Science-Research and Development, 27, 217\u2013223.","journal-title":"Computer Science-Research and Development"},{"issue":"3","key":"567_CR52","doi-asserted-by":"crossref","first-page":"1220","DOI":"10.1137\/130919738","volume":"43","author":"M Englert","year":"2014","unstructured":"Englert, M., \u00d6zmen, D., & Westermann, M. (2014). The power of reordering for online minimum makespan scheduling. SIAM Journal on Computing, 43(3), 1220\u20131237.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"567_CR53","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00236-002-0102-7","volume":"39","author":"L Epstein","year":"2003","unstructured":"Epstein, L. (2003). Bin stretching revisited. Acta Informatica, 39(2), 97\u2013117.","journal-title":"Acta Informatica"},{"issue":"1","key":"567_CR54","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/j.jalgor.2004.11.002","volume":"57","author":"L Epstein","year":"2005","unstructured":"Epstein, L., & Favrholdt, L. M. (2005). Optimal non-preemptive semi-online scheduling on two related machines. Journal of Algorithms, 57(1), 49\u201373.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"567_CR55","doi-asserted-by":"crossref","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. (2001). Randomized online scheduling on two uniform machines. Journal of Scheduling, 4(2), 71\u201392.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"567_CR56","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10878-006-9040-6","volume":"14","author":"L Epstein","year":"2007","unstructured":"Epstein, L., & Ye, D. (2007). Semi-online scheduling with \u201cend of sequence\u201d information. Journal of Combinatorial Optimization, 14(1), 45\u201361.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"567_CR57","first-page":"107","volume":"9","author":"U Faigle","year":"1989","unstructured":"Faigle, U., Kern, W., & Tur\u00e1n, G. (1989). On the performance of online algorithms for partition problems. Acta Cybernetica, 9(2), 107\u2013119.","journal-title":"Acta Cybernetica"},{"issue":"6","key":"567_CR58","doi-asserted-by":"crossref","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. (2000). Online scheduling revisited. Journal of Scheduling, 3(6), 343\u2013353.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"567_CR59","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1137\/0216037","volume":"16","author":"DK Friesen","year":"1987","unstructured":"Friesen, D. K. (1987). Tighter bounds for LPT scheduling on uniform processors. SIAM Journal on Computing, 16(3), 554\u2013560.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"567_CR60","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10288-016-0330-2","volume":"15","author":"M Gabay","year":"2017","unstructured":"Gabay, M., Brauner, N., & Kotov, V. (2017). Improved lower bounds for the online bin stretching problem. 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 15(2), 183\u2013199.","journal-title":"4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies"},{"key":"567_CR61","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.tcs.2015.07.065","volume":"602","author":"M Gabay","year":"2015","unstructured":"Gabay, M., Kotov, V., & Brauner, N. (2015). Online bin stretching with bunch techniques. Theoretical Computer Science, 602, 103\u2013113.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"567_CR62","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0222026","volume":"22","author":"G Galambos","year":"1993","unstructured":"Galambos, G., & Woeginger, G. J. (1993). An on-line scheduling heuristic with better worst case ratio than Graham\u2019s list scheduling. SIAM Journal on Computing, 22(2), 349\u2013355.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"567_CR63","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10951-009-0115-y","volume":"14","author":"M Gatto","year":"2011","unstructured":"Gatto, M., & Widmayer, P. (2011). On robust online scheduling algorithms. Journal of Scheduling, 14(2), 141\u2013156.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"567_CR64","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"TF Gonzalez","year":"1977","unstructured":"Gonzalez, T. F., Ibarra, O. H., & Sahni, S. (1977). Bounds for LPT schedules on uniform processors. SIAM Journal on Computing, 6(1), 155\u2013166.","journal-title":"SIAM Journal on Computing"},{"key":"567_CR65","unstructured":"Gormley, T., Reingold, N., Torng, E., & Westbrook, J. (2000). Generating adversaries for request-answer games. In Proceedings of the 11th annual ACM-SIAM symposium on discrete algorithms (SODA2000) (pp. 564\u2013565)."},{"issue":"9","key":"567_CR66","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell System Technical Journal, 45(9), 1563\u20131581.","journal-title":"Bell System Technical Journal"},{"issue":"2","key":"567_CR67","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2), 416\u2013429.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"7","key":"567_CR68","doi-asserted-by":"crossref","first-page":"1551","DOI":"10.1007\/s11590-011-0335-x","volume":"6","author":"F Han","year":"2012","unstructured":"Han, F., Tan, Z., & Yang, Y. (2012). On the optimality of list scheduling for online uniform machines scheduling. Optimization Letters, 6(7), 1551\u20131571.","journal-title":"Optimization Letters"},{"issue":"7\u20138","key":"567_CR69","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0898-1221(00)00070-5","volume":"39","author":"Y He","year":"2000","unstructured":"He, Y. (2000). The optimal on-line parallel machine scheduling. Computers and Mathematics with Applications, 39(7\u20138), 117\u2013121.","journal-title":"Computers and Mathematics with Applications"},{"issue":"1\u20133","key":"567_CR70","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.dam.2004.12.005","volume":"150","author":"Y He","year":"2005","unstructured":"He, Y., & D\u00f3sa, G. (2005). Semi-online scheduling jobs with tightly-grouped processing times on three identical machines. Discrete Applied Mathematics, 150(1\u20133), 140\u2013159.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"567_CR71","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10100-006-0003-x","volume":"15","author":"Y He","year":"2007","unstructured":"He, Y., & D\u00f3sa, G. (2007). Extension of algorithm list scheduling for a semi-online scheduling problem. Central European Journal of Operations Research, 15(1), 97\u2013104.","journal-title":"Central European Journal of Operations Research"},{"issue":"1","key":"567_CR72","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1631\/jzus.2002.0060","volume":"3","author":"Y He","year":"2002","unstructured":"He, Y., Yang, Q., Tan, Z., & Yao, E. (2002). Algorithms for semi on-line multiprocessor scheduling problems. Journal of Zhejiang University-Science A, 3(1), 60\u201364.","journal-title":"Journal of Zhejiang University-Science A"},{"issue":"3","key":"567_CR73","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s006070050020","volume":"62","author":"Y He","year":"1999","unstructured":"He, Y., & Zhang, G. (1999). Semi on-line scheduling on two identical machines. Computing, 62(3), 179\u2013187.","journal-title":"Computing"},{"issue":"1","key":"567_CR74","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D. S., & Shmoys, D. B. (1987). Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM, 34(1), 144\u2013162.","journal-title":"Journal of the ACM"},{"issue":"5","key":"567_CR75","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1007\/s10951-012-0288-7","volume":"16","author":"\u0141 Je\u017c","year":"2013","unstructured":"Je\u017c, \u0141., Schwartz, J., Sgall, J., & B\u00e9k\u00e9si, J. (2013). Lower bounds for online makespan minimization on a small number of related machines. Journal of Scheduling, 16(5), 539\u2013547.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"567_CR76","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1006\/jagm.1996.0019","volume":"20","author":"DR Karger","year":"1996","unstructured":"Karger, D. R., Phillips, S. J., & Torng, E. (1996). A better algorithm for an ancient scheduling problem. Journal of Algorithms, 20(2), 400\u2013430.","journal-title":"Journal of Algorithms"},{"issue":"4","key":"567_CR77","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.orl.2013.03.005","volume":"41","author":"H Kellerer","year":"2013","unstructured":"Kellerer, H., & Kotov, V. (2013). An efficient algorithm for bin stretching. Operations Research Letters, 41(4), 343\u2013346.","journal-title":"Operations Research Letters"},{"issue":"6","key":"567_CR78","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s10951-015-0430-4","volume":"18","author":"H Kellerer","year":"2015","unstructured":"Kellerer, H., Kotov, V., & Gabay, M. (2015). An efficient algorithm for semi-online multiprocessor scheduling with given total processing time. Journal of Scheduling, 18(6), 623\u2013630.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"567_CR79","doi-asserted-by":"crossref","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. (1997). Semi on-line algorithms for the partition problem. Operations Research Letters, 21(5), 235\u2013242.","journal-title":"Operations Research Letters"},{"key":"567_CR80","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs, A. (2005). Fast monotone 3-approximation algorithm for scheduling related machines. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA2005) (pp. 616\u2013627).","DOI":"10.1007\/11561071_55"},{"issue":"3","key":"567_CR81","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.jda.2008.11.004","volume":"7","author":"A Kov\u00e1cs","year":"2009","unstructured":"Kov\u00e1cs, A. (2009). Tighter approximation bounds for LPT scheduling in two special cases. Journal of Discrete Algorithms, 7(3), 327\u2013340.","journal-title":"Journal of Discrete Algorithms"},{"issue":"2","key":"567_CR82","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s00453-008-9224-9","volume":"57","author":"A Kov\u00e1cs","year":"2010","unstructured":"Kov\u00e1cs, A. (2010). New approximation bounds for LPT scheduling. Algorithmica, 57(2), 413\u2013433.","journal-title":"Algorithmica"},{"issue":"1","key":"567_CR83","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10479-012-1271-6","volume":"204","author":"K Lee","year":"2013","unstructured":"Lee, K., Leung, J. Y., & Pinedo, M. L. (2013). Makespan minimization in online scheduling with machine eligibility. Annals of Operations Research, 204(1), 189\u2013222.","journal-title":"Annals of Operations Research"},{"issue":"5","key":"567_CR84","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s10951-013-0329-x","volume":"16","author":"K Lee","year":"2013","unstructured":"Lee, K., & Lim, K. (2013). Semi-online scheduling problems on a small number of machines. Journal of Scheduling, 16(5), 461\u2013477.","journal-title":"Journal of Scheduling"},{"key":"567_CR85","doi-asserted-by":"crossref","unstructured":"Li, S., Zhou, Y., Sun, G., & Chen, G . (2007) Study on parallel machine scheduling problem with buffer. In Proceedings of the 2nd international multisymposium on computer and computational sciences (IMSCCS2007) (pp. 278\u2013281).","DOI":"10.1109\/IMSCCS.2007.32"},{"issue":"2","key":"567_CR86","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1137\/S0097539799527969","volume":"27","author":"R Li","year":"1998","unstructured":"Li, R., & Shi, L. (1998). An on-line algorithm for some uniform processor scheduling. SIAM Journal on Computing, 27(2), 414\u2013422.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"567_CR87","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0167-6377(95)00058-5","volume":"18","author":"W Liu","year":"1996","unstructured":"Liu, W., Sidney, J. B., & van Vliet, A. (1996). Ordinal algorithms for parallel machine scheduling. Operations Research Letters, 18(5), 223\u2013232.","journal-title":"Operations Research Letters"},{"issue":"21\u201323","key":"567_CR88","doi-asserted-by":"crossref","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. (2009). Online scheduling on two uniform machines to minimize the makespan. Theoretical Computer Science, 410(21\u201323), 2099\u20132109.","journal-title":"Theoretical Computer Science"},{"issue":"9","key":"567_CR89","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ipl.2011.01.002","volume":"111","author":"X Min","year":"2011","unstructured":"Min, X., Liu, J., & Wang, Y. (2011). Optimal semi-online algorithms for scheduling problems with reassignment on two identical machines. Information Processing Letters, 111(9), 423\u2013428.","journal-title":"Information Processing Letters"},{"key":"567_CR90","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/opre.45.1.116","volume":"45","author":"P Mireault","year":"1997","unstructured":"Mireault, P., Orlin, J. B., & Vohra, R. V. (1997). A parametric worst case analysis of the LPT heuristic for two uniform machines. Operations Research, 45, 116\u2013125.","journal-title":"Operations Research"},{"issue":"1","key":"567_CR91","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S. J., & Torng, E. (1994). Non-clairvoyant scheduling. Theoretical Computer Science, 130(1), 17\u201347.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"567_CR92","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10951-010-0177-x","volume":"14","author":"A Musitelli","year":"2011","unstructured":"Musitelli, A., & Nicoletti, J.-M. (2011). Competitive ratio of list scheduling on uniform machines and randomized heuristics. Journal of Scheduling, 14(1), 89\u2013101.","journal-title":"Journal of Scheduling"},{"issue":"8\u201310","key":"567_CR93","first-page":"776","volume":"410","author":"CT Ng","year":"2009","unstructured":"Ng, C. T., Tan, Z., He, Y., & Cheng, T. C. E. (2009). Two semi-online scheduling problems on two uniform machines. Theoretical Computer Science, 410(8\u201310), 776\u2013792.","journal-title":"Theoretical Computer Science"},{"key":"567_CR94","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.tcs.2015.07.050","volume":"600","author":"MP Renault","year":"2015","unstructured":"Renault, M. P., Ros\u00e9n, A., & van Stee, R. (2015). Online algorithms with advice for bin packing and scheduling problems. Theoretical Computer Science, 600, 155\u2013170.","journal-title":"Theoretical Computer Science"},{"key":"567_CR95","unstructured":"Rudin III, J.F. (2001) Improved bounds for the on-line scheduling problem. PhD thesis, The University of Texas at Dallas."},{"issue":"3","key":"567_CR96","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1137\/S0097539702403438","volume":"32","author":"JF Rudin III","year":"2003","unstructured":"Rudin, J. F, I. I. I., & Chandrasekaran, R. (2003). Improved bounds for the online scheduling problem. SIAM Journal on Computing, 32(3), 717\u2013735.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"567_CR97","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1287\/moor.1090.0381","volume":"34","author":"P Sanders","year":"2009","unstructured":"Sanders, P., Sivadasan, N., & Skutella, M. (2009). Online scheduling with bounded migration. Mathematics of Operations Research, 34(2), 481\u2013498.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"567_CR98","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/s00453-017-0274-8","volume":"80","author":"B Schieber","year":"2018","unstructured":"Schieber, B., Shachnai, H., Tamir, G., & Tamir, T. (2018). A theory and algorithms for combinatorial reoptimization. Algorithmica, 80(2), 576\u2013607.","journal-title":"Algorithmica"},{"issue":"5","key":"567_CR99","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0167-6377(00)00053-5","volume":"27","author":"SS Seiden","year":"2000","unstructured":"Seiden, S. S., Sgall, J., & Woeginger, G. J. (2000). Semi-online scheduling with decreasing job sizes. Operations Research Letters, 27(5), 215\u2013221.","journal-title":"Operations Research Letters"},{"key":"567_CR100","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BFb0029570","volume-title":"Online algorithms, the state of the art","author":"J Sgall","year":"1998","unstructured":"Sgall, J. (1998). On-line scheduling. In A. Fiat & G. J. Woeginger (Eds.), Online algorithms, the state of the art (pp. 196\u2013231). Berlin: Springer."},{"issue":"6","key":"567_CR101","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"DB Shmoys","year":"1995","unstructured":"Shmoys, D. B., Wein, J., & Williamson, D. P. (1995). Scheduling parallel machines on-line. SIAM Jounral on Computing, 24(6), 1313\u20131331.","journal-title":"SIAM Jounral on Computing"},{"issue":"12","key":"567_CR102","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.ipl.2013.03.007","volume":"113","author":"H Sun","year":"2013","unstructured":"Sun, H., & Fan, R. (2013). Improved semi-online makespan scheduling with a reordering buffer. Information Processing Letters, 113(12), 434\u2013439.","journal-title":"Information Processing Letters"},{"issue":"5","key":"567_CR103","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0167-6377(01)00071-2","volume":"28","author":"Z Tan","year":"2001","unstructured":"Tan, Z., & He, Y. (2001). Semi-on-line scheduling with ordinal data on two uniform machines. Operations Research Letters, 28(5), 221\u2013231.","journal-title":"Operations Research Letters"},{"issue":"6","key":"567_CR104","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/S0167-6377(02)00164-5","volume":"30","author":"Z Tan","year":"2002","unstructured":"Tan, Z., & He, Y. (2002). Semi-on-line problems on two identical machines with combined partial information. Operations Research Letters, 30(6), 408\u2013414.","journal-title":"Operations Research Letters"},{"issue":"1\u20133","key":"567_CR105","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.tcs.2007.02.014","volume":"377","author":"Z Tan","year":"2007","unstructured":"Tan, Z., & He, Y. (2007). Semi-online scheduling problems on two identical machines with inexact partial information. Theoretical Computer Science, 377(1\u20133), 110\u2013125.","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"567_CR106","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/j.orl.2015.07.002","volume":"43","author":"Z Tan","year":"2015","unstructured":"Tan, Z., & Li, R. (2015). Pseudo lower bounds for online parallel machine scheduling. Operations Research Letters, 43(5), 489\u2013494.","journal-title":"Operations Research Letters"},{"issue":"2","key":"567_CR107","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.orl.2007.06.004","volume":"36","author":"Z Tan","year":"2008","unstructured":"Tan, Z., & Yu, S. (2008). Online scheduling with reassignment. Operations Research Letters, 36(2), 250\u2013254.","journal-title":"Operations Research Letters"},{"key":"567_CR108","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1007\/978-1-4419-7997-1_2","volume-title":"Handbook of combinatorial optimization","author":"Z Tan","year":"2013","unstructured":"Tan, Z., & Zhang, A. (2013). Online and semi-online scheduling. In P. M. Pardalos, D.-Z. Du, & R. Graham (Eds.), Handbook of combinatorial optimization (pp. 2191\u20132252). Berlin: Springer."},{"issue":"16","key":"567_CR109","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.ipl.2012.05.009","volume":"112","author":"Y Wang","year":"2012","unstructured":"Wang, Y., Benko, A., Chen, X., D\u00f3sa, G., Guo, H., Han, X., et al. (2012). Online scheduling with one rearrangement at the end: Revisited. Information Processing Letters, 112(16), 641\u2013645.","journal-title":"Information Processing Letters"},{"issue":"1","key":"567_CR110","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.2000.1074","volume":"35","author":"J Westbrook","year":"2000","unstructured":"Westbrook, J. (2000). Load balancing for response time. Jounral of Algorithms, 35(1), 1\u201316.","journal-title":"Jounral of Algorithms"},{"key":"567_CR111","doi-asserted-by":"crossref","unstructured":"Wu, Y., Tan, Z., & Yang, Q. (2007). Optimal semi-online scheduling algorithms on a small number of machines. In Proceedings of the first international symposium on combinatorics, algorithms, probabilistic and experimental methodologies (ESCAPE2007) (pp. 504\u2013515).","DOI":"10.1007\/978-3-540-74450-4_45"},{"key":"567_CR112","doi-asserted-by":"crossref","unstructured":"Wu, Y., Yang, Q., & Huang, Y. (2010). Semi-online bin stretching with non-increasing job processing times. In Proceedings of the international conference on computer application and system modeling (ICCASM2010) (Vol. 10, pp. V10\u2013562\u2013V10\u2013566). New York: IEEE.","DOI":"10.1109\/ICCASM.2010.5622660"},{"key":"567_CR113","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0020-0190(97)00006-9","volume":"61","author":"G Zhang","year":"1997","unstructured":"Zhang, G. (1997). A simple semi on-line algorithm for $${P2}\/\/{{C}_{\\max }}$$P2\/\/Cmax with a buffer. Information Processing Letters, 61, 145\u2013148.","journal-title":"Information Processing Letters"},{"issue":"3\u20134","key":"567_CR114","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/S0898-1221(02)00168-2","volume":"44","author":"G Zhang","year":"2002","unstructured":"Zhang, G., & Ye, D. (2002). A note on on-line scheduling with partial information. Computers and Mathematics with Applications, 44(3\u20134), 539\u2013543.","journal-title":"Computers and Mathematics with Applications"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0567-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0567-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0567-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T15:00:07Z","timestamp":1571151607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0567-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,13]]},"references-count":114,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["567"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0567-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,13]]}}}