{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T17:10:11Z","timestamp":1769274611983,"version":"3.49.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T00:00:00Z","timestamp":1573171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T00:00:00Z","timestamp":1573171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the CERNET Innovation Project","award":["NGII20170513,NGII20170206"],"award-info":[{"award-number":["NGII20170513,NGII20170206"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61502294"],"award-info":[{"award-number":["No. 61502294"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2019,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n<jats:p>Large-scale applications of Internet of things (IoT), which require considerable computing tasks and storage resources, are increasingly deployed in cloud environments. Compared with the traditional computing model, characteristics of the cloud such as pay-as-you-go, unlimited expansion, and dynamic acquisition represent different conveniences for these applications using the IoT architecture. One of the major challenges is to satisfy the quality of service requirements while assigning resources to tasks. In this paper, we propose a deadline and cost-aware scheduling algorithm that minimizes the execution cost of a workflow under deadline constraints in the infrastructure as a service (IaaS) model. Considering the virtual machine (VM) performance variation and acquisition delay, we first divide tasks into different levels according to the topological structure so that no dependency exists between tasks at the same level. Three strings are used to code the genes in the proposed algorithm to better reflect the heterogeneous and resilient characteristics of cloud environments. Then, HEFT is used to generate individuals with the minimum completion time and cost. Novel schemes are developed for crossover and mutation to increase the diversity of the solutions. Based on this process, a task scheduling method that considers cost and deadlines is proposed. Experiments on workflows that simulate the structured tasks of the IoT demonstrate that our algorithm achieves a high success rate and performs well compared to state-of-the-art algorithms.<\/jats:p>","DOI":"10.1186\/s13638-019-1557-3","type":"journal-article","created":{"date-parts":[[2019,11,8]],"date-time":"2019-11-08T15:29:30Z","timestamp":1573226970000},"update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":118,"title":["An IoT-based task scheduling optimization scheme considering the deadline and cost-aware scientific workflow for cloud computing"],"prefix":"10.1186","volume":"2019","author":[{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0001-5793-4099","authenticated-orcid":false,"given":"Xiaojin","family":"Ma","sequence":"first","affiliation":[]},{"given":"Honghao","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Huahu","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Minjie","family":"Bian","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,8]]},"reference":[{"issue":"17","key":"1557_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1093\/aje\/kwu085","volume":"47","author":"V Mayer-Schonberger","year":"2014","unstructured":"V. Mayer-Schonberger, K. Cukier, Big data: a revolution that will transform how we live, work, and think. Mathematics & Computer Education 47(17), 181\u2013183 (2014). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1093\/aje\/kwu085","journal-title":"Mathematics & Computer Education"},{"issue":"3","key":"1557_CR2","doi-asserted-by":"publisher","first-page":"2011","DOI":"10.1109\/COMST.2018.2803740","volume":"20","author":"T Qiu","year":"2018","unstructured":"T. Qiu, N. Chen, K. Li, et al., How can heterogeneous internet of things build our future: a survey. IEEE Communications Surveys & Tutorials 20(3), 2011\u20132027 (2018). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/COMST.2018.2803740","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"1","key":"1557_CR3","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1109\/JIOT.2017.2767608","volume":"5","author":"J Pan","year":"2018","unstructured":"J. Pan, J. McElhannon, Future edge cloud and edge computing for internet of things applications. IEEE Internet of Things Journal 5(1), 439\u2013449 (2018). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/JIOT.2017.2767608","journal-title":"IEEE Internet of Things Journal"},{"issue":"6","key":"1557_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.6028\/NIST.SP.800-145","volume":"53","author":"P Mell","year":"2011","unstructured":"P. Mell, The NIST definition of cloud computing. Communications of the ACM 53(6), 50 (2011). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.6028\/NIST.SP.800-145","journal-title":"Communications of the ACM"},{"key":"1557_CR5","doi-asserted-by":"publisher","unstructured":"S. Aizad, A. Anjum, R. Sakellariou, \u201cRepresenting variant calling format as directed acyclic graphs to enable the use of cloud computing for efficient and cost effective genome analysis,\u201d 2017 17th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID), pp. 784-787, Madrid, 2017. doi: \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/CCGRID.2017.116","DOI":"10.1109\/CCGRID.2017.116"},{"issue":"5\u20136","key":"1557_CR6","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1016\/j.parco.2003.12.015","volume":"30","author":"T Sousa","year":"2004","unstructured":"T. Sousa, A. Silva, A. Neves, Particle swarm based data mining algorithms for classification tasks. Parallel Comput. 30(5\u20136), 767\u2013783 (2004). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.parco.2003.12.015","journal-title":"Parallel Comput."},{"issue":"9","key":"1557_CR7","doi-asserted-by":"publisher","first-page":"3373","DOI":"10.1007\/s11227-015-1438-4","volume":"71","author":"F Wu","year":"2015","unstructured":"F. Wu, Q. Wu, Y. Tan, Workflow scheduling in cloud: a survey. J. Supercomput. 71(9), 3373\u20133418 (2015). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s11227-015-1438-4","journal-title":"J. Supercomput."},{"issue":"3","key":"1557_CR8","doi-asserted-by":"publisher","first-page":"755","DOI":"10.3966\/160792642019052003009","volume":"20","author":"HH Gao","year":"2019","unstructured":"H.H. Gao, W.Q. Huang, Y.C. Duan, et al., Research on cost-driven services composition in an uncertain environment. Journal of Internet Technology 20(3), 755\u2013769 (2019). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.3966\/160792642019052003009","journal-title":"Journal of Internet Technology"},{"key":"1557_CR9","doi-asserted-by":"publisher","unstructured":"K.R. Jackson, L. Ramakrishnan, K. Muriki, et al., in 2010 IEEE Second International Conference on Cloud Computing Technology & Science. Performance analysis of high performance computing applications on the Amazon Web services cloud (Indianapolis, 2010). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/CloudCom.2010.69","DOI":"10.1109\/CloudCom.2010.69"},{"issue":"1","key":"1557_CR10","doi-asserted-by":"publisher","first-page":"460","DOI":"10.14778\/1920841.1920902","volume":"3","author":"J Schad","year":"2010","unstructured":"J. Schad, J. Dittrich, J.-A. Quian\u00e9-Ruiz, Runtime measurements in the cloud: observing, analyzing, and reducing variance. Proceedings of VLDB Endowment 3(1), 460\u2013471 (2010). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.14778\/1920841.1920902","journal-title":"Proceedings of VLDB Endowment"},{"issue":"2","key":"1557_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"D. Whitley, A genetic algorithm tutorial. Stat. Comput. 4(2), 65\u201385 (1994). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/BF00175354","journal-title":"Stat. Comput."},{"issue":"7","key":"1557_CR12","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1109\/TPDS.2013.238","volume":"25","author":"R Calheiros","year":"2014","unstructured":"R. Calheiros, R. Buyya, Meeting deadlines of scientific workflows in public clouds with tasks replication. IEEE Transactions on Parallel & Distributed Systems 25(7), 1787\u20131796 (2014). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/TPDS.2013.238","journal-title":"IEEE Transactions on Parallel & Distributed Systems"},{"key":"1557_CR13","doi-asserted-by":"publisher","DOI":"10.1109\/eScience.2015.67","volume-title":"IEEE International Conference on E-science","author":"R Chard","year":"2015","unstructured":"R. Chard, K. Chard, K. Bubendorfer, et al., in IEEE International Conference on E-science. Cost-aware cloud provisioning (2015). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/eScience.2015.67"},{"key":"1557_CR14","doi-asserted-by":"publisher","unstructured":"J. Yu, R. Buyya, C.K. Tham, Cost-based scheduling of scientific workflow application on utility grids. Proc.1st Int.Conf. e-Sci.Grid Comput.e-Sci, 140\u2013147 (2005). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/E-SCIENCE.2005.26","DOI":"10.1109\/E-SCIENCE.2005.26"},{"key":"1557_CR15","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/GRID.2007.4354110","volume-title":"Proceedings of the 8th IEEE\/ACM International Conference on Grid Computing, GRID\u201907","author":"J Yu","year":"2007","unstructured":"J. Yu, M. Kirley, R. Buyya, in Proceedings of the 8th IEEE\/ACM International Conference on Grid Computing, GRID\u201907. Multi-objective planning for workflow execution on grids (IEEE Computer Society, Washington, 2007), pp. 10\u201317. \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/GRID.2007.4354110"},{"key":"1557_CR16","doi-asserted-by":"publisher","unstructured":"R. Sakellariou, H. Zhao, E. Tsiakkouri, M. D. Dikaiakos, \u201dScheduling workflows with budget constraints,\u201d Integrated Research in Grid Computing, S. Gorlatch and M. Danelutto, Eds., CoreGrid series. New York, NY, USA: Springer-Verlag, pp. 189-202, 2007. doi: \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/978-0-387-47658-2_14","DOI":"10.1007\/978-0-387-47658-2_14"},{"issue":"1","key":"1557_CR17","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TSMCC.2008.2001722","volume":"39","author":"Wei-Neng Chen","year":"2009","unstructured":"R. Duan, R. Prodan, T. Fahringer, Performance and cost optimization for multiple large-scale grid workflow applications. IEEE Conference on Supercomputing, 112 (2007). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/TSMCC.2008.2001722","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)"},{"issue":"1","key":"1557_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/tsmcc.2008.2001722","volume":"39","author":"WN Chen","year":"2009","unstructured":"W.N. Chen, J. Zhang, An ant colony optimization approach to a grid workflow scheduling problem with various QoS requirements. IEEE Trans. Syst. Man Cybern. Part C Appl. Rev. 39(1), 29\u201343 (2009). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/tsmcc.2008.2001722","journal-title":"IEEE Trans. Syst. Man Cybern. Part C Appl. Rev."},{"key":"1557_CR19","doi-asserted-by":"publisher","unstructured":"C. Hoffa, G. Mehta, T. Freeman, et al., On the use of cloud computing for scientific workflows. Fourth IEEE International Conference on eScience, e-Science, 640\u2013645 (2008). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/eScience.2008.167","DOI":"10.1109\/eScience.2008.167"},{"issue":"8","key":"1557_CR20","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1016\/j.future.2011.05.001","volume":"27","author":"E-K Byun","year":"2011","unstructured":"E.-K. Byun, Y.-S. Kee, J.-S. Kim, et al., Cost optimized provisioning of elastic resources for application workflows. Futur. Gener. Comput. Syst. 27(8), 1011\u20131026 (2011). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2011.05.001","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"6","key":"1557_CR21","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.jpdc.2011.01.008","volume":"71","author":"E-K 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). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.jpdc.2011.01.008","journal-title":"J. Parallel Distrib. Comput."},{"key":"1557_CR22","doi-asserted-by":"publisher","unstructured":"N. Malawski, G. Juve, E. Deelman, et al. \u201cCost- and deadline-constrained provisioning for scientific workflow ensembles in IaaS clouds,\u201d in Proc. Int. Conf. High Perform. Comput. Netw., Storage Anal., Art. no. 22, 2012. doi: \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/SC.2012.38","DOI":"10.1109\/SC.2012.38"},{"issue":"1","key":"1557_CR23","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.J. Epema, Deadline constrained workflow scheduling algorithms for infrastructure as a service clouds. Futur. Gener. Comput. Syst. 29(1), 158\u2013169 (2013). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2012.05.004","journal-title":"Futur. Gener. Comput. Syst."},{"key":"1557_CR24","doi-asserted-by":"publisher","unstructured":"S. Pandey, L. Wu, S.M. Guru, et al., in 2010 24th IEEE International Conference on Advanced Information Networking and Applications. A particle swarm optimization-based heuristic for scheduling workflow applications in cloud computing environments (AINA, 2010), pp. 400\u2013407. \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/AINA.2010.31","DOI":"10.1109\/AINA.2010.31"},{"key":"1557_CR25","doi-asserted-by":"publisher","first-page":"4309","DOI":"10.1007\/s00500-016-2063-8","volume":"21","author":"G Yao","year":"2017","unstructured":"G. Yao, Y.S. Ding, Y.C. Jin, et al., Endocrine-based coevolutionary multi-swarm for multi-objective workflow scheduling in a cloud system. Soft. Comput. 21, 4309\u20134322 (2017). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s00500-016-2063-8","journal-title":"Soft. Comput."},{"issue":"16","key":"1557_CR26","doi-asserted-by":"publisher","first-page":"17163","DOI":"10.1007\/s11042-016-3667-9","volume":"76","author":"Qiong Wu","year":"2016","unstructured":"Q. Wu, G.H. Qin, B.B. Huang, The research of multimedia cloud computing platform data dynamic task scheduling optimization method in multi core environment. Multimed Tools Appl 76, 17163\u201317178, 201. \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s11042-016-3667-9","journal-title":"Multimedia Tools and Applications"},{"issue":"12","key":"1557_CR27","doi-asserted-by":"publisher","first-page":"3401","DOI":"10.1109\/TPDS.2017.2735400","volume":"28","author":"QW Wu","year":"2017","unstructured":"Q.W. Wu, F. Ishikawa, Q.S. Zhu, et al., Deadline-constrained cost optimization approaches for workflow scheduling in clouds. IEEE Transactions on Parallel and Distributed Systems 28(12), 3401\u20133412 (2017). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/TPDS.2017.2735400","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"1557_CR28","doi-asserted-by":"publisher","unstructured":"M. Mao, M. Humphrey, \u201cAuto-scaling to minimize cost and meet application deadlines in cloud workflows,\u201d Conference on High Performance Computing Networking, Storage Anal., Art. no. 49, 2011. doi: \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/2063384.2063449","DOI":"10.1145\/2063384.2063449"},{"issue":"2","key":"1557_CR29","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TCC.2014.2314655","volume":"2","author":"MA Rodriguez","year":"2014","unstructured":"M.A. Rodriguez, R. Buyya, Deadline based resource provisioning and scheduling algorithm for scientific workflows on clouds. IEEE Transactions on Cloud Computing 2(2), 222\u2013235 (2014). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/TCC.2014.2314655","journal-title":"IEEE Transactions on Cloud Computing"},{"key":"1557_CR30","doi-asserted-by":"publisher","unstructured":"D. Poola, S.K. Garg, R. Buyya, et al., in IEEE International Conference on Advanced Information Networking & Applications. Robust scheduling of scientific workflows with deadline and budget constraints in clouds (IEEE, 2014). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/AINA.2014.105","DOI":"10.1109\/AINA.2014.105"},{"issue":"1","key":"1557_CR31","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TCC.2015.2451649","volume":"6","author":"J Sahni","year":"2018","unstructured":"J. Sahni, P. Vidyarthi, A cost-effective deadline-constrained dynamic scheduling algorithm for scientific workflows in a cloud environment. IEEE Transactions on Cloud Computing 6(1), 2\u201318 (2018). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/TCC.2015.2451649","journal-title":"IEEE Transactions on Cloud Computing"},{"issue":"1","key":"1557_CR32","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/TPDS.2018.2849396","volume":"30","author":"V Arabnejad","year":"2019","unstructured":"V. Arabnejad, K. Bubendorfer, B. Ng, Budget and deadline aware e-science workflow scheduling in clouds. IEEE Transactions on Parallel and Distributed Systems 30(1), 29\u201344 (2019). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/TPDS.2018.2849396","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"1557_CR33","doi-asserted-by":"publisher","unstructured":"Z.G. Chen, K.J. Du, Z.H. Zhan, et al., Deadline constrained cloud computing resources scheduling for cost optimization based on dynamic objective genetic algorithm. Proc. IEEE Congr. Evol. Com-put, 708\u2013714 (2015). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/CEC.2015.7256960","DOI":"10.1109\/CEC.2015.7256960"},{"issue":"5","key":"1557_CR34","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1109\/TPDS.2015.2446459","volume":"27","author":"ZM Zhu","year":"2016","unstructured":"Z.M. Zhu, G.X. Zhang, M.Q. Li, et al., Evolutionary multi-objective workflow scheduling in cloud. IEEE Transactions on Parallel & Distributed Systems 27(5), 1344\u20131357 (2016). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/TPDS.2015.2446459","journal-title":"IEEE Transactions on Parallel & Distributed Systems"},{"key":"1557_CR35","doi-asserted-by":"publisher","first-page":"5065","DOI":"10.1109\/ACCESS.2016.2593903","volume":"4","author":"J Meena","year":"2016","unstructured":"J. Meena, M. Kumar, M. Vardham, Cost effective genetic algorithm for workflow scheduling in cloud under deadline constraint. IEEE Access 4, 5065\u20135082 (2016). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/ACCESS.2016.2593903","journal-title":"IEEE Access"},{"key":"1557_CR36","doi-asserted-by":"publisher","first-page":"61488","DOI":"10.1109\/ACCESS.2018.2869827","volume":"6","author":"WL Li","year":"2018","unstructured":"W.L. Li, Y.N. Xia, M.C. Zhou, et al., Fluctuation-aware and predictive workflow scheduling in cost-effective infrastructure-as-a-service clouds. IEEE Access 6, 61488\u201361502 (2018). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/ACCESS.2018.2869827","journal-title":"IEEE Access"},{"key":"1557_CR37","doi-asserted-by":"publisher","unstructured":"L.Y. Qi, Y. Chen, Y. Yuan, et al., A QoS-aware virtual machine scheduling method for energy conservation in cloud-based cyber-physical systems. World Wide Web Journal (2019). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s11280-019-00684-y","DOI":"10.1007\/s11280-019-00684-y"},{"key":"1557_CR38","doi-asserted-by":"publisher","unstructured":"Tarjan, \u201cDepth-first search and linear graph algorithms,\u201d Symposium on Switching & Automata Theory. IEEE, 2008. doi: \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/SWAT.1971.10","DOI":"10.1109\/SWAT.1971.10"},{"issue":"2","key":"1557_CR39","doi-asserted-by":"publisher","first-page":"282","DOI":"10.3321\/j.issn:0254-4164.2008.02.012","volume":"31","author":"YC Yuan","year":"2008","unstructured":"Y.C. Yuan, X.P. LI, Q. Wang, et al., Bottom level based heuristic for workflow scheduling in grids. Chines Journal of Computers 31(2), 282\u2013290 (2008). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.3321\/j.issn:0254-4164.2008.02.012","journal-title":"Chines Journal of Computers"},{"issue":"2","key":"1557_CR40","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"K. Deb, A. Pratap, S. Agarwal, et al., A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1557_CR41","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.future.2018.04.064","volume":"87","author":"HH Gao","year":"2018","unstructured":"H.H. Gao, W.Q. Huang, X.X. Yang, et al., Towards service selection for workflow reconfiguration: an interface-based computing. Future Generation Computer Systems 87, 298\u2013311 (2018). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2018.04.064","journal-title":"Future Generation Computer Systems"},{"issue":"3","key":"1557_CR42","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1016\/j.future.2012.08.015","volume":"29","author":"G Juve","year":"2013","unstructured":"G. Juve, A. Chervenak, E. Deelman, et al., Characterizing and profiling scientific workflows. Futur. Gener. Comput. Syst. 29(3), 682\u2013692 (2013). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.future.2012.08.015","journal-title":"Futur. Gener. Comput. Syst."},{"key":"1557_CR43","doi-asserted-by":"publisher","unstructured":"M. Mao, M. Humphrey, A performance study on the VM startup time in the cloud. IEEE Fifth International Conference on Cloud Computing, 423\u2013430 (2012). \nhttps:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1109\/CLOUD.2012.103","DOI":"10.1109\/CLOUD.2012.103"}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1186\/s13638-019-1557-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/article\/10.1186\/s13638-019-1557-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1186\/s13638-019-1557-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T00:08:36Z","timestamp":1604707716000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-019-1557-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,8]]},"references-count":43,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["1557"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1186\/s13638-019-1557-3","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,8]]},"assertion":[{"value":"3 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"249"}}