{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:49Z","timestamp":1740122389319,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T00:00:00Z","timestamp":1663200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T00:00:00Z","timestamp":1663200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s10878-022-00906-6","type":"journal-article","created":{"date-parts":[[2022,9,15]],"date-time":"2022-09-15T18:12:18Z","timestamp":1663265538000},"page":"3535-3548","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Online scheduling with migration on two hierarchical machines"],"prefix":"10.1007","volume":"44","author":[{"given":"Islam","family":"Akaria","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6761-8521","authenticated-orcid":false,"given":"Leah","family":"Epstein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,15]]},"reference":[{"key":"906_CR1","doi-asserted-by":"crossref","unstructured":"Akaria I, Epstein L(2022) Bin stretching with migration on two hierarchical machines. CoRR, arXiv: abs\/2206.06102","DOI":"10.1007\/s10878-022-00906-6"},{"issue":"2","key":"906_CR2","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/s00453-016-0209-9","volume":"79","author":"S Albers","year":"2017","unstructured":"Albers S, Hellwig M (2017) On the value of job migration in online makespan minimization. Algorithmica 79(2):598\u2013623","journal-title":"Algorithmica"},{"issue":"2","key":"906_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y Azar","year":"1995","unstructured":"Azar Y, Naor JS, Rom R (1995) The competitiveness of on-line assignments. J Algorithms 18(2):221\u2013237","journal-title":"J Algorithms"},{"issue":"2","key":"906_CR4","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1137\/S0097539798346135","volume":"31","author":"A Bar-Noy","year":"2001","unstructured":"Bar-Noy A, Freund A, Naor JS (2001) On-line load balancing in a hierarchical server topology. SIAM J Comput 31(2):527\u2013549","journal-title":"SIAM J Comput"},{"issue":"1","key":"906_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10107-018-1325-x","volume":"179","author":"S Berndt","year":"2020","unstructured":"Berndt S, Jansen K, Klein K (2020) Fully dynamic bin packing revisited. Math Program 179(1):109\u2013155","journal-title":"Math Program"},{"issue":"45","key":"906_CR6","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 (2011) Optimal algorithms for online scheduling with bounded rearrangement at the end. Theor Comput Sci 412(45):6269\u20136278","journal-title":"Theor Comput Sci"},{"issue":"4","key":"906_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ipl.2012.12.007","volume":"113","author":"X Chen","year":"2013","unstructured":"Chen X, Xu Z, D\u00f3sa G, Han X, Jiang H (2013) Semi-online hierarchical scheduling problems with buffer or rearrangements. Inf Process Lett 113(4):127\u2013131","journal-title":"Inf Process Lett"},{"issue":"3","key":"906_CR8","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0166-218X(03)00341-X","volume":"137","author":"P Crescenzi","year":"2004","unstructured":"Crescenzi P, Gambosi G, Penna P (2004) On-line algorithms for the channel assignment problem in cellular networks. Discrete Appl Math 137(3):237\u2013266","journal-title":"Discrete Appl Math"},{"issue":"1","key":"906_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-007-0200-y","volume":"119","author":"L Epstein","year":"2009","unstructured":"Epstein L, Levin A (2009) A robust APTAS for the classical bin packing problem. Math Program 119(1):33\u201349","journal-title":"Math Program"},{"issue":"10","key":"906_CR10","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/s00453-012-9718-3","volume":"69","author":"L Epstein","year":"2014","unstructured":"Epstein L, Levin A (2014) Robust algorithms for preemptive scheduling. Algorithmica 69(10):26\u201357","journal-title":"Algorithmica"},{"key":"906_CR11","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.disopt.2019.03.001","volume":"33","author":"L Epstein","year":"2019","unstructured":"Epstein L, Levin A (2019) Robust algorithms for total completion time. Discrete Optim 33:70\u201386","journal-title":"Discrete Optim"},{"issue":"2","key":"906_CR12","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1137\/0222026","volume":"22","author":"G Galambos","year":"1993","unstructured":"Galambos G, Woeginger GJ (1993) An on-line scheduling heuristic with better worst case ratio than Graham\u2019s list scheduling. SIAM J Comput 22(2):349\u2013355","journal-title":"SIAM J Comput"},{"issue":"4","key":"906_CR13","doi-asserted-by":"publisher","first-page":"43:1","DOI":"10.1145\/3397535","volume":"16","author":"W G\u00e1lvez","year":"2020","unstructured":"G\u00e1lvez W, Soto JA, Verschae J (2020) Symmetry exploitation for online machine covering with bounded migration. ACM Trans Algorithms 16(4):43:1-43:22","journal-title":"ACM Trans Algorithms"},{"issue":"1","key":"906_CR14","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s10878-007-9095-z","volume":"16","author":"Y Jiang","year":"2008","unstructured":"Jiang Y (2008) Online scheduling on parallel machines with two GoS levels. J Comb Optim 16(1):28\u201338","journal-title":"J Comb Optim"},{"issue":"3","key":"906_CR15","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1631\/jzus.2006.A0309","volume":"7","author":"Y Jiang","year":"2006","unstructured":"Jiang Y, He Y, Tang C (2006) Optimal online algorithms for scheduling on two identical machines under a grade of service. J Zhejiang Univ-Sci A 7(3):309\u2013314","journal-title":"J Zhejiang Univ-Sci A"},{"key":"906_CR16","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.ijpe.2014.03.001","volume":"153","author":"K Lee","year":"2014","unstructured":"Lee K, Hwang H-C, Lim K (2014) Semi-online scheduling with GoS eligibility constraints. Int J Prod Econ 153:204\u2013214","journal-title":"Int J Prod Econ"},{"key":"906_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2021.106211","volume":"174","author":"V Levin","year":"2022","unstructured":"Levin V (2022) Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes. Inf Process Lett 174:106211","journal-title":"Inf Process Lett"},{"issue":"39","key":"906_CR18","doi-asserted-by":"publisher","first-page":"5211","DOI":"10.1016\/j.tcs.2011.05.029","volume":"412","author":"K Lim","year":"2011","unstructured":"Lim K, Lee K, Chang SY (2011) Improved bounds for online scheduling with eligibility constraints. Theor Comput Sci 412(39):5211\u20135224","journal-title":"Theor Comput Sci"},{"issue":"1","key":"906_CR19","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/s10878-009-9231-z","volume":"21","author":"M Liu","year":"2011","unstructured":"Liu M, Chu C, Xu Y, Zheng F (2011) Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times. J Comb Optim 21(1):138\u2013149","journal-title":"J Comb Optim"},{"issue":"1","key":"906_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2015.03.050","volume":"607","author":"T Luo","year":"2015","unstructured":"Luo T, Xu Y (2015) Semi-online hierarchical load balancing problem with bounded processing times. Theor Comput Sci 607(1):75\u201382","journal-title":"Theor Comput Sci"},{"issue":"10","key":"906_CR21","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11590-014-0838-3","volume":"607","author":"T Luo","year":"2016","unstructured":"Luo T, Xu Y (2016) Optimal algorithm for semi-online scheduling on two machines under GoS levels. Optim Lett 607(10):207\u2013213","journal-title":"Optim Lett"},{"issue":"6","key":"906_CR22","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1016\/j.orl.2005.11.004","volume":"34","author":"J Park","year":"2006","unstructured":"Park J, Chang SY, Lee K (2006) Online and semi-online scheduling of two machines under a grade of service provision. Operations Res Lett 34(6):692\u2013696","journal-title":"Operations Res Lett"},{"issue":"2","key":"906_CR23","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 (2009) Online scheduling with bounded migration. Math Operations Res 34(2):481\u2013498","journal-title":"Math Operations Res"},{"issue":"3","key":"906_CR24","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1287\/moor.2015.0765","volume":"41","author":"M Skutella","year":"2016","unstructured":"Skutella M, Verschae J (2016) Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures. Math Operations Res 41(3):991\u20131021","journal-title":"Math Operations Res"},{"issue":"3","key":"906_CR25","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.tcs.2009.08.014","volume":"412","author":"Z Tan","year":"2011","unstructured":"Tan Z, Zhang A (2011) Online hierarchical scheduling: an approach using mathematical programming. Theor Comput Sci 412(3):246\u2013256","journal-title":"Theor Comput Sci"},{"key":"906_CR26","unstructured":"Wakrat I (2012). Online and semi-online scheduling with reordering and reassignment. Master\u2019s thesis, Department of Computer Science, University of Haifa, Haifa, Israel"},{"issue":"1","key":"906_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/j.ijpe.2011.07.021","volume":"135","author":"Y Wu","year":"2012","unstructured":"Wu Y, Ji M, Yang Q (2012) Optimal semi-online scheduling algorithms on two parallel identical machines under a grade of service provision. Int J Prod Econ 135(1):367\u2013371","journal-title":"Int J Prod Econ"},{"key":"906_CR28","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1007\/s10878-013-9627-7","volume":"29","author":"A Zhang","year":"2015","unstructured":"Zhang A, Jiang Y, Fan L, Hu J (2015) Optimal online algorithms on two hierarchical machines with tightly-grouped processing times. J Comb Optim 29:781\u2013795","journal-title":"J Comb Optim"},{"issue":"38\u201340","key":"906_CR29","doi-asserted-by":"publisher","first-page":"3597","DOI":"10.1016\/j.tcs.2009.04.007","volume":"410","author":"A Zhang","year":"2009","unstructured":"Zhang A, Jiang Y, Tan Z (2009) Online parallel machines scheduling with two hierarchies. Theor Comput Sci 410(38\u201340):3597\u20133605","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00906-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00906-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00906-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T09:40:25Z","timestamp":1667036425000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00906-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,15]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["906"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00906-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,9,15]]},"assertion":[{"value":"1 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no conflicts of interest or competing interests for this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}