{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,22]],"date-time":"2025-02-22T00:00:08Z","timestamp":1740182408911,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T00:00:00Z","timestamp":1672876800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T00:00:00Z","timestamp":1672876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Program for Excellent Young Talents of Yunnan University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-022-00189-x","type":"journal-article","created":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T11:02:58Z","timestamp":1672916578000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Mixed Ring Covering Problem with Two Nodes"],"prefix":"10.1007","volume":"4","author":[{"given":"Man","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1650-2625","authenticated-orcid":false,"given":"Xiaofei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,5]]},"reference":[{"issue":"2","key":"189_CR1","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0304-3975(01)00255-9","volume":"287","author":"L Becchetti","year":"2002","unstructured":"Becchetti L, Ianni MD, Marchetti-Spaccamela A (2002) Approximation algorithms for routing and call scheduling in all-optical chains and rings. Theoret Comput Sci 287(2):429\u2013448","journal-title":"Theoret Comput Sci"},{"issue":"2","key":"189_CR2","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1016\/j.jnca.2010.11.003","volume":"34","author":"AM Bernardino","year":"2011","unstructured":"Bernardino AM, Bernardino EM, Sanchez-Perez JM, Gomez-Pulido JA, Vega-Rodriguez MA (2011) Solving ring loading problems using bio-inspired algorithms. J Netw Comput Appl 34(2):668\u2013685","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"189_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF02110141","volume":"3","author":"S Cosares","year":"1994","unstructured":"Cosares S, Saniee I (1994) An optimization problem related to balancing loads on sonet rings. Telecommun Syst 3(2):165\u2013181","journal-title":"Telecommun Syst"},{"key":"189_CR4","doi-asserted-by":"crossref","unstructured":"D\u00e4ubel K (2020) An improved upper bound for the ring loading problem. In: Approximation and Online Algorithms","DOI":"10.1007\/978-3-030-39479-0_7"},{"key":"189_CR5","doi-asserted-by":"crossref","unstructured":"Dell\u2019Amico M, Labb\u00e9 M, Maffioli F (1999) Exact solution of the SONET ring loading problem,\u00a0vol 25. Elsevier Science Publishers B. V.","DOI":"10.1016\/S0167-6377(99)00031-0"},{"key":"189_CR6","doi-asserted-by":"crossref","unstructured":"Guan L, Li J, Zhang X, Li W (2015) The directed ring loading with penalty cost. In: International Workshop on Algorithms and Computation","DOI":"10.1007\/978-3-319-15612-5_3"},{"key":"189_CR7","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1007\/s11590-020-01632-w","volume":"15","author":"L Guan","year":"2021","unstructured":"Guan L, Li W, Xiao M (2021) Online algorithms for the mixed ring loading problem with two nodes. Optim Lett 15:1229\u20131239","journal-title":"Optim Lett"},{"issue":"2","key":"189_CR8","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/net.20400","volume":"57","author":"JT Havill","year":"2011","unstructured":"Havill JT, Hutson KR (2011) Optimal online ring routing. Networks 57(2):187\u2013197","journal-title":"Networks"},{"issue":"2","key":"189_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1002\/bltj.2047","volume":"2","author":"S Khanna","year":"1997","unstructured":"Khanna S (1997) A polynomial time approximation scheme for the sonet ring loading problem. Bell Labs Tech J 2(2):36\u201341","journal-title":"Bell Labs Tech J"},{"key":"189_CR10","doi-asserted-by":"crossref","unstructured":"Lee K, Leung Y, Pinedo ML (2010) Makespan minimization in online scheduling with machine eligibility. 4OR-Q J Oper Res 8(4):331\u2013364","DOI":"10.1007\/s10288-010-0149-1"},{"issue":"1\u20132","key":"189_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ipl.2013.08.004","volume":"114","author":"W Li","year":"2014","unstructured":"Li W, Li J, Guan L (2014) Approximation algorithms for the ring loading problem with penalty cost. Inf Process Lett 114(1\u20132):56\u201359","journal-title":"Inf Process Lett"},{"key":"189_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-021-01831-z","author":"X Liu","year":"2021","unstructured":"Liu X, Li W, Xie R (2021) A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-021-01831-z","journal-title":"Optim Lett"},{"issue":"2","key":"189_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/j.orl.2003.08.001","volume":"32","author":"YS Myung","year":"2004","unstructured":"Myung YS, Kim HG (2004) On the ring loading problem with demand splitting. Oper Res Lett 32(2):167\u2013173","journal-title":"Oper Res Lett"},{"issue":"1","key":"189_CR14","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1287\/opre.45.1.148","volume":"45","author":"YS Myung","year":"1997","unstructured":"Myung YS, Kim HG, Tcha DW (1997) Optimal load balancing on sonet bidirectional rings. Oper Res 45(1):148\u2013152","journal-title":"Oper Res"},{"issue":"1","key":"189_CR15","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s10878-007-9136-7","volume":"18","author":"Q Nong","year":"2009","unstructured":"Nong Q, Yuan J, Lin Y (2009) The weighted link ring loading problem. J Comb Optim 18(1):38\u201350","journal-title":"J Comb Optim"},{"issue":"31\u201333","key":"189_CR16","doi-asserted-by":"publisher","first-page":"2978","DOI":"10.1016\/j.tcs.2010.04.035","volume":"411","author":"Q Nong","year":"2010","unstructured":"Nong Q, Cheng T, Ng C (2010) A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting. Theoretical Computer ence 411(31\u201333):2978\u20132986","journal-title":"Theoretical Computer ence"},{"key":"189_CR17","doi-asserted-by":"crossref","unstructured":"Qi X, Yuan J (2017) Semi-online hierarchical scheduling for $$(l_p)$$-norm load balancing with buffer or rearrangements. 4OR A Quarterly Journal of Operations Research 15:265\u2013276","DOI":"10.1007\/s10288-016-0334-y"},{"key":"189_CR18","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10878-019-00513-y","volume":"39","author":"Y Ran","year":"2020","unstructured":"Ran Y, Shi Y, Tang C, Zhang Z (2020) A primal-dual algorithm for the minimum partial set multi-cover problem. J Comb Optim 39:725\u2013746","journal-title":"J Comb Optim"},{"issue":"4","key":"189_CR19","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1137\/S0036144599356470","volume":"41","author":"A Schrijver","year":"1999","unstructured":"Schrijver A, Winkler P (1999) The ring loading problem. SIAM Rev 41(4):777\u2013791","journal-title":"SIAM Rev"},{"issue":"1","key":"189_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480195294994","volume":"11","author":"A Schrijver","year":"1998","unstructured":"Schrijver A, Seymour P, Winkler P (1998) The ring loading problem. SIAM J Discret Math 11(1):1\u201314","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"189_CR21","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1137\/14099588X","volume":"30","author":"M Skutella","year":"2016","unstructured":"Skutella M (2016) A note on the ring loading problem. SIAM J Discret Math 30(1):327\u2013342","journal-title":"SIAM J Discret Math"},{"issue":"1","key":"189_CR22","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jalgor.2004.03.003","volume":"54","author":"BF Wang","year":"2005","unstructured":"Wang BF (2005) Linear time algorithms for the ring loading problem with demand splitting. J Algorithms 54(1):45\u201357","journal-title":"J Algorithms"},{"key":"189_CR23","unstructured":"Wilfong G, Winkler P (1998) Ring routing and wavelength translation. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. pp 333\u2013341"},{"issue":"11A","key":"189_CR24","first-page":"441","volume":"48","author":"M Xiao","year":"2021","unstructured":"Xiao M, Li W (2021) Semi-online algorithms for mixed ring with two nodes. Comput\u00a0Sci 48(11A):441\u2013445","journal-title":"Comput\u00a0Sci"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-022-00189-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-022-00189-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-022-00189-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T07:08:53Z","timestamp":1682406533000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-022-00189-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,5]]},"references-count":24,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["189"],"URL":"https:\/\/doi.org\/10.1007\/s43069-022-00189-x","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2023,1,5]]},"assertion":[{"value":"8 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"8"}}