{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:26:10Z","timestamp":1777613170237,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:00:00Z","timestamp":1641772800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71832001"],"award-info":[{"award-number":["71832001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71771048"],"award-info":[{"award-number":["71771048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"the Fundamental Research Funds for the Central Universities and Graduate Student Innovation Fund of Donghua University","award":["CUSF-DH-D-2020088"],"award-info":[{"award-number":["CUSF-DH-D-2020088"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,8]]},"DOI":"10.1007\/s10878-021-00836-9","type":"journal-article","created":{"date-parts":[[2022,1,10]],"date-time":"2022-01-10T00:03:16Z","timestamp":1641772996000},"page":"414-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Competitive algorithm for scheduling of sharing machines with rental discount"],"prefix":"10.1007","volume":"44","author":[{"given":"Yinfeng","family":"Xu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1059-1372","authenticated-orcid":false,"given":"Rongteng","family":"Zhi","sequence":"additional","affiliation":[]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,10]]},"reference":[{"issue":"2","key":"836_CR1","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.ijpe.2013.08.013","volume":"146","author":"S Adhau","year":"2013","unstructured":"Adhau S, Mittal ML, Mittal A (2013) A multi-agent system for decentralized multi-project scheduling with resource transfers. Int J Prod Econ 146(2):646\u2013661","journal-title":"Int J Prod Econ"},{"key":"836_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10951-019-00629-3","volume":"23","author":"I Akaria","year":"2020","unstructured":"Akaria I, Epstein L (2020) An optimal online algorithm for scheduling with general machine cost functions. J Sched 23:155\u2013162","journal-title":"J Sched"},{"issue":"2","key":"836_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1080\/17517575.2014.928950","volume":"10","author":"P Argoneto","year":"2016","unstructured":"Argoneto P, Renna P (2016) Supporting capacity sharing in the cloud manufacturing environment based on game theory and fuzzy logic. Enterp Inf Syst-UK 10(2):193\u2013210","journal-title":"Enterp Inf Syst-UK"},{"key":"836_CR4","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1016\/j.ejor.2015.10.020","volume":"250","author":"WQ Dai","year":"2016","unstructured":"Dai WQ, Dong YC, Zhang XT (2016) Competitive analysis of the online financial lease problem. Eur J Oper Res 250:865\u2013873","journal-title":"Eur J Oper Res"},{"issue":"1","key":"836_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3934\/jimo.2010.6.1","volume":"6","author":"LL Ding","year":"2010","unstructured":"Ding LL, Liu XM, Xu YF (2010) Competitive risk management for online Bahncard problem. J Ind Manag Optim 6(1):1\u201314","journal-title":"J Ind Manag Optim"},{"key":"836_CR6","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/S009753970343395X","volume":"33","author":"G D\u00f3sa","year":"2004","unstructured":"D\u00f3sa G, He Y (2004) Better online algorithms for scheduling with machine cost. SIAM J Comput 33:1035\u20131051","journal-title":"SIAM J Comput"},{"key":"836_CR7","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10878-006-9003-y","volume":"12","author":"G D\u00f3sa","year":"2006","unstructured":"D\u00f3sa G, He Y (2006) Scheduling with machine cost and rejection. J Comb Optim 12:337\u2013350","journal-title":"J Comb Optim"},{"issue":"3","key":"836_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/j.disopt.2010.02.005","volume":"7","author":"G D\u00f3sa","year":"2010","unstructured":"D\u00f3sa G, Tan Z (2010) New upper and lower bounds for online scheduling with machine cost. Discrete Optim 7(3):125\u2013135","journal-title":"Discrete Optim"},{"key":"836_CR9","doi-asserted-by":"publisher","first-page":"102109","DOI":"10.1016\/j.omega.2019.102109","volume":"97","author":"D Fang","year":"2020","unstructured":"Fang D, Wang JC (2020) Horizontal capacity sharing between asymmetric competitors. Omega-Int J Manage S 97:102109","journal-title":"Omega-Int J Manage S"},{"key":"836_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0304-3975(00)00266-8","volume":"268","author":"R Fleischer","year":"2001","unstructured":"Fleischer R (2001) On the Bahncard problem. Theor Comput Sci 268:161\u2013174","journal-title":"Theor Comput Sci"},{"issue":"6","key":"836_CR11","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1587\/transfun.E99.A.1075","volume":"99","author":"H Fujiwara","year":"2016","unstructured":"Fujiwara H, Satou S, Fujito T (2016) Competitive Analysis for the 3-Slope Ski-Rental Problem with the Discount Rate. IEICE T Fund Electr 99(6):1075\u20131083","journal-title":"IEICE T Fund Electr"},{"issue":"8","key":"836_CR12","doi-asserted-by":"publisher","first-page":"3554","DOI":"10.1287\/mnsc.2017.2796","volume":"64","author":"L Guo","year":"2018","unstructured":"Guo L, Wu XL (2018) Capacity sharing between competitors. Manage Sci 64(8):3554\u20133573","journal-title":"Manage Sci"},{"key":"836_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00170-019-03886-w","volume":"104","author":"JB He","year":"2019","unstructured":"He JB, Zhang J, Gu XJ (2019) Research on sharing manufacturing in Chinese manufacturing industry. Int J Adv Manuf Tech 104:463\u2013476","journal-title":"Int J Adv Manuf Tech"},{"key":"836_CR14","doi-asserted-by":"publisher","first-page":"2070","DOI":"10.1016\/j.dam.2007.10.014","volume":"157","author":"C Imreh","year":"2009","unstructured":"Imreh C (2009) Online scheduling with general machine cost functions. Discrete Appl Math 157:2070\u20132077","journal-title":"Discrete Appl Math"},{"key":"836_CR15","doi-asserted-by":"crossref","unstructured":"Imreh C, Noga J (1999) Scheduling with Machine Cost. In: Proc. RANDOM-APPROX 99 Conf, Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, 1671:168-176","DOI":"10.1007\/978-3-540-48413-4_18"},{"key":"836_CR16","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/j.ins.2013.08.041","volume":"269","author":"Y Jiang","year":"2014","unstructured":"Jiang Y, Hu J, Liu L, Zhu Y, Cheng TCE (2014) Competitive ratios for preemptive and non-preemptive online scheduling with nondecreasing concave machine cost. Inform Sci 269:128\u2013141","journal-title":"Inform Sci"},{"key":"836_CR17","unstructured":"Karp R (1992) On-line algorithms versus off-line algorithms: how much is it worth to know the future? In: Proceedings of IFIP 12th world computer congress (1):416-429"},{"key":"836_CR18","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.eswa.2018.01.027","volume":"99","author":"K Li","year":"2018","unstructured":"Li K, Zhou T, Liu BH, Li H (2018) A multi-agent system for sharing distributed manufacturing resources. Exp Syst Appl 99:32\u201343","journal-title":"Exp Syst Appl"},{"key":"836_CR19","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1016\/j.jnca.2014.08.007","volume":"46","author":"N Liu","year":"2014","unstructured":"Liu N, Li XP, Shen WM (2014) Multi-granularity resource virtualization and sharing strategies in cloud manufacturing. J Netw Comput Appl 46:72\u201382","journal-title":"J Netw Comput Appl"},{"key":"836_CR20","doi-asserted-by":"publisher","first-page":"2546","DOI":"10.1016\/j.dam.2007.07.004","volume":"155","author":"J Nagy-Gy\u00f6rgy","year":"2007","unstructured":"Nagy-Gy\u00f6rgy J, Imreh C (2007) Online scheduling with machine cost and rejection. Discrete Appl Math 155:2546\u20132554","journal-title":"Discrete Appl Math"},{"key":"836_CR21","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10479-018-3005-x","volume":"291","author":"JJ Qin","year":"2020","unstructured":"Qin JJ, Wang K, Wang ZP, Xia LJ (2020) Revenue sharing contracts for horizontal capacity sharing under competition. Ann Oper Res 291:731\u2013760","journal-title":"Ann Oper Res"},{"key":"836_CR22","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ijpe.2013.09.003","volume":"147","author":"H Seok","year":"2014","unstructured":"Seok H, Nof SY (2014) Dynamic coalition reformation for adaptive demand and capacity sharing. Int J Prod Econ 147:136\u2013146","journal-title":"Int J Prod Econ"},{"key":"836_CR23","unstructured":"Shao XF (2020) Capacity sharing: the impacts of agreement and contracting timing. J Oper Res Soc pp. 1-18"},{"key":"836_CR24","doi-asserted-by":"publisher","first-page":"106602","DOI":"10.1016\/j.cie.2020.106602","volume":"146","author":"CY Yu","year":"2020","unstructured":"Yu CY, Xu X, Yu SQ, Sang ZQ, Yang C, Jiang XL (2020) Shared manufacturing in the sharing economy: concept, definition and service operations. Comput Ind Eng 146:106602","journal-title":"Comput Ind Eng"},{"issue":"18","key":"836_CR25","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1016\/j.ipl.2011.06.012","volume":"111","author":"GQ Zhang","year":"2011","unstructured":"Zhang GQ, Ponn CK, Xu YF (2011) The ski-rental problem with multiple discount options. Inform Process Lett 111(18):903\u2013906","journal-title":"Inform Process Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00836-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-021-00836-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-021-00836-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,29]],"date-time":"2022-07-29T07:30:11Z","timestamp":1659079811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-021-00836-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,10]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["836"],"URL":"https:\/\/doi.org\/10.1007\/s10878-021-00836-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,10]]},"assertion":[{"value":"5 November 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}