{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T21:00:44Z","timestamp":1740171644496,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T00:00:00Z","timestamp":1638835200000},"content-version":"vor","delay-in-days":6,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2019YFB1404602"],"award-info":[{"award-number":["2019YFB1404602"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the credit cloud, credit services are sold to applications for credit computing, credit fusion and credit risk estimates. Plenty of services with different performance for the same task may have different execution time and charged by various ways. The users have specific requirements for the workflow completion time or cost. Hence, to meet the user\u2019s satisfaction is an important challenge. In this paper, we propose heuristic scheduling methods for credit workflow with total cost minimization, and the deadline should be satisfied. The problem can be divided into two sub-problems, task-mode mapping and task tabling on renting service instances. For the task-mode mapping problem, a recursive heuristic method is constructed to select appropriate service for each task of the workflow. Then another heuristic algorithm based is established to get a final schema with deadline constraint. We discussed the service instance rented in shareable manner and compared with un-shareable manner. Three renting strategies are discussed in detail. Experimental results show the effectiveness and efficiency of the proposed algorithm.<\/jats:p>","DOI":"10.1186\/s13634-021-00827-2","type":"journal-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T09:02:52Z","timestamp":1638867772000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-heuristic scheduling methods for workflow in credit cloud"],"prefix":"10.1186","volume":"2021","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8599-6577","authenticated-orcid":false,"given":"Zhang","family":"Xiaodong","sequence":"first","affiliation":[]},{"given":"Yao","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Shen","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,7]]},"reference":[{"issue":"2","key":"827_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/opre.45.2.302","volume":"45","author":"P De","year":"1997","unstructured":"P. De, E. Dunne, J. Ghost et al., Complexity of the discrete time-cost tradeoff problem for project networks. Oper. Res. 45(2), 302\u2013306 (1997)","journal-title":"Oper. Res."},{"issue":"11","key":"827_CR2","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1057\/palgrave.jors.2600634","volume":"49","author":"E Demeulemeester","year":"1998","unstructured":"E. Demeulemeester, B. De Reyck, B. Foubert et al., New computational results on the discrete time\/cost trade-off problem in project networks. J. Oper. Res. Soc. 49(11), 1153\u20131163 (1998)","journal-title":"J. Oper. Res. Soc."},{"issue":"8","key":"827_CR3","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TPDS.2011.303","volume":"23","author":"S Abrishami","year":"2012","unstructured":"S. Abrishami, M. Naghibzadeh, D. Epema, Cost-driven scheduling of grid workflows using partial critical paths. IEEE Trans. Parallel Distrib. Syst. 23(8), 1400\u20131414 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"1","key":"827_CR4","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.future.2012.05.004","volume":"29","author":"S Abrishami","year":"2013","unstructured":"S. Abrishami, M. Naghibzadeh, D.H. Epema, Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds. Future Gener. Comput. Syst. 29(1), 158\u2013169 (2013)","journal-title":"Future Gener. Comput. Syst."},{"doi-asserted-by":"crossref","unstructured":"Z. Cai, X. Li, J. Gupta, Critical path-based iterative heuristic for workflow scheduling in utility and cloud computing, in International Conference on Service-Oriented Computing: Service-Oriented Computing, 2013, pp. 207\u2013221.","key":"827_CR5","DOI":"10.1007\/978-3-642-45005-1_15"},{"key":"827_CR6","doi-asserted-by":"publisher","first-page":"6529","DOI":"10.1007\/s11227-017-2043-5","volume":"74","author":"L Chen","year":"2018","unstructured":"L. Chen, X. Li, Cloud workflow scheduling with hybrid resource provisioning. J. Supercomput. 74, 6529\u20136553 (2018)","journal-title":"J. Supercomput."},{"issue":"15","key":"827_CR7","doi-asserted-by":"publisher","first-page":"2562","DOI":"10.1016\/j.ins.2009.01.035","volume":"179","author":"Y Yuan","year":"2009","unstructured":"Y. Yuan, X. Li, Q. Wang et al., Deadline division-based heuristic for cost optimization in workflow scheduling. Inf. Sci. 179(15), 2562\u20132575 (2009)","journal-title":"Inf. Sci."},{"key":"827_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.future.2019.08.012","volume":"102","author":"G Ismayilov","year":"2020","unstructured":"G. Ismayilov, H.R. Topcuoglu, Neural network based multi-objective evolutionary algorithm for dynamic workflow scheduling in cloud computing. Futur. Gener. Comput. Syst. 102, 307\u2013322 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"827_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106649","author":"S Saeedi","year":"2020","unstructured":"S. Saeedi, R. Khorsand, S. Bidgolt et al., Improved many-objective particle swarm optimization algorithm for scientific workflow scheduling in cloud computing. Comput. Ind. Eng. (2020). https:\/\/doi.org\/10.1016\/j.cie.2020.106649","journal-title":"Comput. Ind. Eng."},{"unstructured":"J. Yu, R. Buyya, C. Tham, Cost-based scheduling of scientific workflow applications on utility grids, in Processing of the 1st International Conference on E-Science Grid Computing, 2005, p. 8.","key":"827_CR10"},{"issue":"2","key":"827_CR11","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/TSC.2014.2361320","volume":"9","author":"Z Cai","year":"2016","unstructured":"Z. Cai, X. Li, J. Gupta, Heuristics for provisioning services to workflows in XaaS clouds. IEEE Trans. Serv. Comput. 9(2), 250\u2013263 (2016)","journal-title":"IEEE Trans. Serv. Comput."},{"doi-asserted-by":"crossref","unstructured":"V. Ruben, K. Vanmechelen, J. Broeckhove, Cost optimal scheduling in hybrid IaaS clouds for deadline co constrained workloads, in Proceedings of IEEE 3rd International Conference on Cloud Computing, 2010, pp 228\u2013235.","key":"827_CR12","DOI":"10.1109\/CLOUD.2010.58"},{"issue":"2","key":"827_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10586-013-0325-0","volume":"17","author":"J Durillo","year":"2014","unstructured":"J. Durillo, R. Prodan, Multi-objective workflow scheduling in amazon EC2. Cluster Comput. 17(2), 169\u2013189 (2014)","journal-title":"Cluster Comput."},{"unstructured":"AmazonEC2 (2016) Amazon elastic compute cloud (Amazon EC2). http:\/\/aws.amazon.com\/ec2\/pricing.","key":"827_CR14"},{"issue":"6","key":"827_CR15","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.jpdc.2011.01.008","volume":"71","author":"EK Byun","year":"2011","unstructured":"E.K. Byun, Y.S. Kee, J.S. Kim et al., BTS: Resource capacity estimate for time-targeted science workflows. J. Parallel Distrib. Comput. 71(6), 848\u2013862 (2011)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"827_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TASE.2017.2668798","volume":"14","author":"X Li","year":"2017","unstructured":"X. Li, Z. Cai, Elastic Resource provisioning for cloud workflow applications. IEEE Trans. Autom. Sci. Eng. 14(2), 1\u201316 (2017)","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"2","key":"827_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10586-013-0325-0","volume":"17","author":"J Durillo","year":"2014","unstructured":"J. Durillo, R. Prodan, Multi-objective workflow scheduling in amazon EC2. Clust. Comput. 17(2), 169\u2013189 (2014)","journal-title":"Clust. Comput."},{"issue":"3","key":"827_CR18","doi-asserted-by":"publisher","first-page":"102328","DOI":"10.1016\/j.simpat.2021.102328","volume":"110","author":"N Rizvi","year":"2021","unstructured":"N. Rizvi, R. Dharavath, D.R. Edla, Cost and makespan aware workflow scheduling in IaaS clouds using hybrid spider monkey optimization. Simul Model Pract Theory 110(3), 102328 (2021)","journal-title":"Simul Model Pract Theory"},{"doi-asserted-by":"crossref","unstructured":"A. Iranmanesh, H. Naji, DCHG-TS: A deadline-constrained and cost-effective hybrid genetic algorithm for scientific workflow scheduling in cloud computing. Cluster Comput. 24(6), (2020)","key":"827_CR19","DOI":"10.1007\/s10586-020-03145-8"},{"issue":"8","key":"827_CR20","doi-asserted-by":"publisher","first-page":"5379","DOI":"10.1109\/TII.2019.2947435","volume":"16","author":"X Liu","year":"2020","unstructured":"X. Liu, X. Zhang, NOMA-based resource allocation for cluster-based cognitive Industrial Internet of Things. IEEE Trans. Ind. Inf. 16(8), 5379\u20135388 (2020)","journal-title":"IEEE Trans. Ind. Inf."},{"issue":"99","key":"827_CR21","first-page":"1","volume":"PP","author":"X Liu","year":"2019","unstructured":"X. Liu, X. Zhai, W. Lu et al., QoS-guarantee resource allocation for multibeam satellite Industrial Internet of Things with NOMA. IEEE Trans. Ind. Inf. PP(99), 1\u20131 (2019)","journal-title":"IEEE Trans. Ind. Info."},{"issue":"99","key":"827_CR22","first-page":"1","volume":"PP","author":"L Xin","year":"2018","unstructured":"L. Xin, X. Zhang, Rate and energy efficiency improvements for 5G-based IoT with simultaneous transfer. IEEE Trans. Ind. Inf. PP(99), 1\u20131 (2018)","journal-title":"IEEE Trans. Ind. Info."},{"key":"827_CR23","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.phycom.2018.03.015","volume":"28","author":"X Liu","year":"2018","unstructured":"X. Liu, X. Zhang, M. Jia et al., 5G-based green broadband communication system design with simultaneous wireless information and power transfer. Phys. Commun. 28, 130\u2013137 (2018)","journal-title":"Phys. Commun."},{"doi-asserted-by":"crossref","unstructured":"W. Yuan, Tengyi, et al., Joint pricing and power allocation for dynamic spectrum access networks with stackelberg game model. IEEE Trans. Wirel. Commun. 10(1) (2011)","key":"827_CR24","DOI":"10.1109\/TWC.2010.120310.091430"},{"issue":"1","key":"827_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1023\/A:1022283403119","volume":"6","author":"E Demelemeester","year":"2003","unstructured":"E. Demelemeester, M. Vanhoucke, W. Herroelen, Rangen: a random network generator for activity-on-the-node networks. J. Sched. 6(1), 17\u201338 (2003)","journal-title":"J. Sched."},{"issue":"2","key":"827_CR26","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.ejor.2004.04.006","volume":"165","author":"C Akkan","year":"2005","unstructured":"C. Akkan, A. Drexl, A. Kimms, Network decomposition based benchmark results for the discrete time-cost tradeoff problem. Eur. J. Oper. Res. 165(2), 339\u2013358 (2005)","journal-title":"Eur. J. Oper. Res."}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-021-00827-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13634-021-00827-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-021-00827-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T22:43:00Z","timestamp":1726267380000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-021-00827-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["827"],"URL":"https:\/\/doi.org\/10.1186\/s13634-021-00827-2","relation":{},"ISSN":["1687-6180"],"issn-type":[{"type":"electronic","value":"1687-6180"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"10 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Ethical approval.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The author declares that this article has no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"119"}}