{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T12:56:23Z","timestamp":1784379383281,"version":"3.55.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"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":["61762091"],"award-info":[{"award-number":["61762091"]}],"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":["61662088"],"award-info":[{"award-number":["61662088"]}],"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":["62062065"],"award-info":[{"award-number":["62062065"]}],"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":["11663007"],"award-info":[{"award-number":["11663007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Grid Computing"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10723-021-09563-1","type":"journal-article","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T16:02:51Z","timestamp":1624982571000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Strategy-Proof Mechanism for Online Time-Varying Resource Allocation with Restart"],"prefix":"10.1007","volume":"19","author":[{"given":"Jixian","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ning","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuejie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,29]]},"reference":[{"key":"9563_CR1","doi-asserted-by":"crossref","unstructured":"Nisan, T., Roughgarden, E., Tardos, E., Vazirani, V.: Algorithmic Game Theory (2007)","DOI":"10.1017\/CBO9780511800481"},{"key":"9563_CR2","unstructured":"Amazon EC2: [Online]. Available: https:\/\/amazonaws-china.com\/cn\/ec2\/instance-types\/ (2019)"},{"key":"9563_CR3","unstructured":"Alibaba Cloud: [Online]. Available: https:\/\/help.aliyun.com\/document_detail\/52088.html (2019)"},{"key":"9563_CR4","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1613\/jair.5100","volume":"56","author":"X Chen","year":"2016","unstructured":"Chen, X., Hu, X., Wang, C., Zheng, B.: Efficient mechanism design for online scheduling. J. Artif. Intell. Res. 56, 429\u2013461 (2016)","journal-title":"J. Artif. Intell. Res."},{"issue":"5","key":"9563_CR5","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.jpdc.2012.02.002","volume":"72","author":"J Li","year":"2012","unstructured":"Li, J., Qiu, M., Ming, Z., Quan, G., Qin, X., Gu, Z.: Online optimization for scheduling preemptable tasks on IaaS cloud systems. J Parallel Distrib. Comput. 72(5), 666\u2013677 (2012). https:\/\/doi.org\/10.1016\/j.jpdc.2012.02.002","journal-title":"J Parallel Distrib. Comput."},{"key":"9563_CR6","doi-asserted-by":"publisher","unstructured":"Jiao, Y., Wang, P., Niyato, D., Xiong, Z.: Social welfare maximization auction in edge computing resource allocation for mobile blockchain. In: IEEE International Conference on Communications 2018-May, pp 1\u20136 (2018). https:\/\/doi.org\/10.1109\/ICC.2018.8422632","DOI":"10.1109\/ICC.2018.8422632"},{"key":"9563_CR7","doi-asserted-by":"publisher","unstructured":"Cao, X., Zhang, J., Poor, H.V.: An optimal auction mechanism for mobile edge caching. In: Proceedings - International Conference on Distributed Computing Systems 2018-July, pp 388\u2013399 (2018). https:\/\/doi.org\/10.1109\/ICDCS.2018.00046","DOI":"10.1109\/ICDCS.2018.00046"},{"key":"9563_CR8","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jpdc.2019.01.003","volume":"127","author":"A Alelaiwi","year":"2019","unstructured":"Alelaiwi, A.: An efficient method of computation offloading in an edge cloud platform. J. Parallel. Distrib. Comput. 127, 58\u201364 (2019)","journal-title":"J. Parallel. Distrib. Comput."},{"key":"9563_CR9","unstructured":"Alibaba Cloud: [Online]. Available: https:\/\/tianchi.aliyun.com\/ (2019)"},{"issue":"2","key":"9563_CR10","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1109\/TPDS.2014.2308224","volume":"26","author":"M Nejad","year":"2014","unstructured":"Nejad, M., Mashayekhy, L., Grosu, D.: Truthful greedy mechanisms for dynamic virtual machine provisioning and allocation in clouds. IEEE Trans Parallel Distrib. Syst. 26(2), 594\u2013603 (2014)","journal-title":"IEEE Trans Parallel Distrib. Syst."},{"key":"9563_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.ins.2015.11.029","volume":"334","author":"Q Wu","year":"2016","unstructured":"Wu, Q., Hao, J.: A clique-based exact method for optimal winner determination in combinatorial auctions. Inform. Sci. 334, 103\u2013121 (2016)","journal-title":"Inform. Sci."},{"issue":"1","key":"9563_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00453-006-1210-5","volume":"47","author":"A Chakrabarti","year":"2007","unstructured":"Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. Algorithmica 47(1), 53\u201378 (2007)","journal-title":"Algorithmica"},{"issue":"3","key":"9563_CR13","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.: Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures. Math. Oper. Res. 41(3), 991\u20131021 (2016)","journal-title":"Math. Oper. Res."},{"issue":"7","key":"9563_CR14","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1109\/TPDS.2017.2785815","volume":"29","author":"X Liu","year":"2018","unstructured":"Liu, X., Li, W., Zhang, X.: Strategy-proof mechanism for provisioning and allocation virtual machines in heterogeneous clouds. IEEE Trans. Parallel Distrib. Syst. 29(7), 1650\u20131663 (2018)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"9","key":"9563_CR15","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2014.2355228","volume":"26","author":"L Mashayekhy","year":"2015","unstructured":"Mashayekhy, L., Nejad, M., Grosu, D.: A PTAS mechanism for provisioning and allocation of heterogeneous cloud resources. IEEE Trans. Parallel Distrib. Syst. 26(9), 2386\u20132399 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"9563_CR16","first-page":"71","volume":"42","author":"W Shi","year":"2014","unstructured":"Shi, W., Zhang, L., Wu, C., Li, Z., Francis, L.: An online auction framework for dynamic resource provisioning in cloud computing. IEEE\/ACM Trans. Netw. 42(1), 71\u201383 (2014)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9563_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10723-017-9419-x","volume":"16","author":"C Guerrero","year":"2018","unstructured":"Guerrero, C., Lera, I., Juiz, C.: Genetic algorithm for multi-objective optimization of container allocation in cloud architecture. J. Grid Comput. 16, 113\u2013135 (2018)","journal-title":"J. Grid Comput."},{"key":"9563_CR18","doi-asserted-by":"publisher","first-page":"113306","DOI":"10.1016\/j.eswa.2020.113306","volume":"150","author":"AS Abohamama","year":"2020","unstructured":"Abohamama, A.S., Hamouda, E.: A hybrid energy? Aware virtual machine placement algorithm for cloud environments. Expert Syst. Appl. 150, 113306 (2020)","journal-title":"Expert Syst. Appl."},{"key":"9563_CR19","doi-asserted-by":"crossref","unstructured":"Tang, X., Li, Y., Ren, R., Cai, W.: On first fit bin packing for online cloud server allocation. In: IEEE International Parallel and Distributed Processing Symposium, pp 323\u2013332 (2016)","DOI":"10.1109\/IPDPS.2016.42"},{"issue":"29","key":"9563_CR20","doi-asserted-by":"publisher","first-page":"3650","DOI":"10.1016\/j.tcs.2011.03.025","volume":"412","author":"E Angelelli","year":"2011","unstructured":"Angelelli, E., Filippi, C.: On the complexity of interval scheduling with a resource constraint. Theor. Comput. Sci. 412(29), 3650\u20133657 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.03.025","journal-title":"Theor. Comput. Sci."},{"key":"9563_CR21","doi-asserted-by":"publisher","unstructured":"Angelelli, E., Bianchessi, N., Filippi, C.: Optimal interval scheduling with a resource constraint. Comput. Oper. Res. https:\/\/doi.org\/10.1016\/j.cor.2014.06.002 (2014)","DOI":"10.1016\/j.cor.2014.06.002"},{"key":"9563_CR22","doi-asserted-by":"publisher","unstructured":"Zhou, H.: Optimal interval scheduling with nonidentical given machines. Clust. Comput., 0123456789. https:\/\/doi.org\/10.1007\/s10586-018-02892-z (2019)","DOI":"10.1007\/s10586-018-02892-z"},{"key":"9563_CR23","doi-asserted-by":"publisher","unstructured":"Zhang, P.Y., Zhou, M.C.: Dynamic cloud task scheduling based on a two-stage strategy. IEEE Trans. Autom. Sci. Eng. https:\/\/doi.org\/10.1109\/TASE.2017.2693688 (2018)","DOI":"10.1109\/TASE.2017.2693688"},{"key":"9563_CR24","doi-asserted-by":"publisher","unstructured":"Jain, N., Menache, I., Naor, J.S., Yaniv, J.: Near-optimal scheduling mechanisms for deadline-sensitive jobs in large computing clusters. ACM Trans. Parallel Comput. https:\/\/doi.org\/10.1145\/2742343 (2015)","DOI":"10.1145\/2742343"},{"key":"9563_CR25","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/j.future.2019.05.037","volume":"100","author":"IA Elgendy","year":"2019","unstructured":"Elgendy, I.A., Zhang, W., Tian, Y.-C., Li, K.: Resource allocation and computation offloading with data security for mobile edge computing. Futur. Gener. Comput. Syst. 100, 531\u2013541 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"9563_CR26","doi-asserted-by":"crossref","unstructured":"Li, C., Tang, J., Luo, Y.: Hybrid cloud adaptive scheduling strategy for heterogeneous workloads. J. Grid Comput. :419\u2013446 (2019)","DOI":"10.1007\/s10723-019-09481-3"},{"key":"9563_CR27","doi-asserted-by":"publisher","unstructured":"Van Stee, R., La Poutr\u00e9, H.: Minimizing the total completion time on-line on a single machine, using restarts. J. Algorithms. https:\/\/doi.org\/10.1016\/j.jalgor.2004.10.001 (2005)","DOI":"10.1016\/j.jalgor.2004.10.001"},{"key":"9563_CR28","unstructured":"Huang, Z.: Online Makespan Minimization : The Power of Restart. arXiv:1806.02207 (2018)"},{"issue":"4","key":"9563_CR29","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1109\/TPDS.2015.2432799","volume":"27","author":"R Zhang","year":"2016","unstructured":"Zhang, R., Wu, K., Li, M., Wang, J.: Online resource scheduling under concave pricing for cloud computing. IEEE Trans. Parallel Distrib. Syst. 27(4), 1131\u20131145 (2016)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9563_CR30","doi-asserted-by":"crossref","unstructured":"Zheng, Z., Ness, S.B.: Online multi-resource allocation for deadline sensitive jobs with partial values in the cloud. In: IEEE Infocom -the IEEE International Conference on Computer Communications, pp 1\u20139 (2016)","DOI":"10.1109\/INFOCOM.2016.7524430"},{"key":"9563_CR31","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.future.2020.04.029","volume":"111","author":"J Zhang","year":"2020","unstructured":"Zhang, J., Yang, X., Xie, N., Zhang, X., Vasilakos, A.V., Li, W.: An online auction mechanism for time-varying multidimensional resource allocation in clouds. Futur. Gener. Comput. Syst. 111, 27\u201338 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"9563_CR32","doi-asserted-by":"publisher","unstructured":"Mashayekhy, L., Fisher, N., Grosu, D.: Truthful mechanisms for competitive reward-based scheduling. IEEE Trans. Comput. https:\/\/doi.org\/10.1109\/TC.2015.2479598 (2016)","DOI":"10.1109\/TC.2015.2479598"},{"issue":"3","key":"9563_CR33","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1109\/TC.2015.2435784","volume":"65","author":"H Zhang","year":"2016","unstructured":"Zhang, H., Li, B., Jiang, H., Liu, F., Vasilakos, A., Liu, J.: A framework for truthful online auctions in cloud computing with heterogeneous user demands. IEEE Trans. Comput. 65(3), 805\u2013818 (2016)","journal-title":"IEEE Trans. Comput."},{"key":"9563_CR34","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.future.2018.06.034","volume":"89","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Xie, N., Zhang, X., Li, W.: An online auction mechanism for cloud computing resource allocation and pricing based on user evaluation and cost. Futur. Gener. Comput. Syst. 89, 286\u2013299 (2018)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"4","key":"9563_CR35","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.1109\/TC.2015.2444843","volume":"65","author":"L Mashayekhy","year":"2016","unstructured":"Mashayekhy, L., Nejad, M., Grosu, D., Vasilakos, A.: An online mechanism for resource allocation and pricing in clouds. IEEE Trans. Comput. 65(4), 1172\u20131184 (2016)","journal-title":"IEEE Trans. Comput."},{"key":"9563_CR36","doi-asserted-by":"crossref","unstructured":"Zhang, X., Huang, Z., Wu, C., Li, Z., Francis, C.: Online auctions in IaaS clouds: welfare and profit maximization with server costs. In: IEEE\/ACM Transactions on Networking, pp 1034\u20131047 (2015)","DOI":"10.1109\/TNET.2016.2619743"}],"container-title":["Journal of Grid Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-021-09563-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10723-021-09563-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10723-021-09563-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T03:37:57Z","timestamp":1634096277000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10723-021-09563-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["9563"],"URL":"https:\/\/doi.org\/10.1007\/s10723-021-09563-1","relation":{},"ISSN":["1570-7873","1572-9184"],"issn-type":[{"value":"1570-7873","type":"print"},{"value":"1572-9184","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,29]]},"assertion":[{"value":"19 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"25"}}