{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:55:29Z","timestamp":1780638929438,"version":"3.54.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T00:00:00Z","timestamp":1659571200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T00:00:00Z","timestamp":1659571200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11227-022-04729-4","type":"journal-article","created":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T18:02:37Z","timestamp":1659636157000},"page":"1956-1979","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["A novel technique to optimize quality of service for directed acyclic graph (DAG) scheduling in cloud computing environment using heuristic approach"],"prefix":"10.1007","volume":"79","author":[{"given":"Ranjit","family":"Rajak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shrawan","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shiv","family":"Prakash","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nidhi","family":"Rajak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pratibha","family":"Dixit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,4]]},"reference":[{"key":"4729_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.future.2018.07.049","volume":"90","author":"AA Mutlag","year":"2019","unstructured":"Mutlag AA, Abd Ghani MK, Arunkumar N et al (2019) Enabling technologies for fog computing in healthcare IoT systems. Futur Gener Comput Syst 90:62\u201378. https:\/\/doi.org\/10.1016\/j.future.2018.07.049","journal-title":"Futur Gener Comput Syst"},{"key":"4729_CR2","doi-asserted-by":"publisher","first-page":"2009","DOI":"10.1109\/COMST.2020.2989392","volume":"22","author":"K Gai","year":"2020","unstructured":"Gai K, Guo J, Zhu L, Yu S (2020) Blockchain Meets Cloud Computing: A Survey. IEEE Commun Surv Tutorials 22:2009\u20132030. https:\/\/doi.org\/10.1109\/COMST.2020.2989392","journal-title":"IEEE Commun Surv Tutorials"},{"key":"4729_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/itl2.137","volume":"3","author":"S Malla","year":"2020","unstructured":"Malla S, Christensen K (2020) HPC in the cloud: Performance comparison of function as a service (FaaS) vs infrastructure as a service (IaaS). Internet Technol Lett 3:e137. https:\/\/doi.org\/10.1002\/itl2.137","journal-title":"Internet Technol Lett"},{"key":"4729_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2020.110708","volume":"170","author":"J Scheuner","year":"2020","unstructured":"Scheuner J, Leitner P (2020) Function-as-a-Service performance evaluation: A multivocal literature review. J Syst Softw 170:110708. https:\/\/doi.org\/10.1016\/j.jss.2020.110708","journal-title":"J Syst Softw"},{"key":"4729_CR5","doi-asserted-by":"crossref","unstructured":"Sharma S,\u00a0Sajid M (2021) Integrated fog and cloud computing: issues and challenges. Int J Cloud Appl Comput (IGI) 11(4), Article 10","DOI":"10.4018\/IJCAC.2021100110"},{"key":"4729_CR6","doi-asserted-by":"crossref","unstructured":"Buyya R, Pandey S, Vecchiola C (2009) Cloudbus toolkit for market-oriented cloud computing. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). pp 24\u201344","DOI":"10.1007\/978-3-642-10665-1_4"},{"key":"4729_CR7","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/B978-0-12-809633-8.20374-9","volume":"1\u20133","author":"F Marozzo","year":"2018","unstructured":"Marozzo F (2018) Infrastructures for high-performance computing: Cloud infrastructures. Encycl Bioinforma Comput Biol ABC Bioinforma 1\u20133:240\u2013246. https:\/\/doi.org\/10.1016\/B978-0-12-809633-8.20374-9","journal-title":"Encycl Bioinforma Comput Biol ABC Bioinforma"},{"key":"4729_CR8","doi-asserted-by":"publisher","unstructured":"Hammed SS, Arunkumar B (2020) A cost effective\u2010 secure algorithm for work\u2010flow scheduling in cloud computing. Internet Technol Lett e233. Doi: https:\/\/doi.org\/10.1002\/itl2.233","DOI":"10.1002\/itl2.233"},{"key":"4729_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2019.08.004","volume":"100","author":"J Zhou","year":"2019","unstructured":"Zhou J, Wang T, Cong P et al (2019) Cost and makespan-aware workflow scheduling in hybrid clouds. J Syst Archit 100:101631. https:\/\/doi.org\/10.1016\/j.sysarc.2019.08.004","journal-title":"J Syst Archit"},{"key":"4729_CR10","doi-asserted-by":"crossref","unstructured":"Sahitya A (2021) Importance of Fog Computing in. Integr Cloud Comput with Internet Things Found Anal Appl, p 211","DOI":"10.1002\/9781119769323.ch13"},{"key":"4729_CR11","unstructured":"Song A, Chen W-N, Luo X-N, et al (2020) Scheduling Workflows with Composite Tasks: A Nested Particle Swarm Optimization Approach. IEEE Trans Serv Comput"},{"key":"4729_CR12","doi-asserted-by":"crossref","unstructured":"Jain R, Sharma N (2021) A QoS Aware Binary Salp Swarm Algorithm for Effective Task Scheduling in Cloud Computing. In: Progress in Advanced Computing and Intelligent Engineering. Springer, pp 462\u2013473","DOI":"10.1007\/978-981-15-6353-9_43"},{"key":"4729_CR13","doi-asserted-by":"publisher","first-page":"551","DOI":"10.3390\/sym12040551","volume":"12","author":"M Farid","year":"2020","unstructured":"Farid M, Latip R, Hussin M, Abdul Hamid NAW (2020) A survey on QoS requirements based on particle swarm optimization scheduling techniques for workflow scheduling in cloud computing. Symmetry (Basel) 12:551","journal-title":"Symmetry (Basel)"},{"key":"4729_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.3390\/computation8020026","volume":"8","author":"EC da Silva","year":"2020","unstructured":"da Silva EC, Gabriel PHR (2020) A Comprehensive Review of Evolutionary Algorithms for Multiprocessor DAG Scheduling. Computation 8:26","journal-title":"Computation"},{"key":"4729_CR15","doi-asserted-by":"crossref","unstructured":"Hosseinzadeh M, Ghafour MY, Hama HK, et al (2020) Multi-objective task and workflow scheduling approaches in cloud computing: a comprehensive review. J Grid Comput, pp 1\u201330","DOI":"10.1007\/s10723-020-09533-z"},{"key":"4729_CR16","doi-asserted-by":"crossref","unstructured":".Li J, Zhang X, Han L et al. (2021) OKCM: improving parallel task scheduling in high-performance computing systems using online learning.\u00a0J Supercomput 77:5960\u20135983","DOI":"10.1007\/s11227-020-03506-5"},{"key":"4729_CR17","doi-asserted-by":"crossref","unstructured":"Woeginger GJ (2003) Exact algorithms for NP-hard problems: A survey. In: Combinatorial optimization\u2014eureka, you shrink! Springer, pp 185\u2013207","DOI":"10.1007\/3-540-36478-1_17"},{"key":"4729_CR18","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0377-2217(94)90332-8","volume":"72","author":"C Hanen","year":"1994","unstructured":"Hanen C (1994) Study of a NP-hard cyclic scheduling problem: The recurrent job-shop. Eur J Oper Res 72:82\u2013101","journal-title":"Eur J Oper Res"},{"key":"4729_CR19","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1016\/j.ins.2019.10.035","volume":"512","author":"Z Tong","year":"2020","unstructured":"Tong Z, Chen H, Deng X et al (2020) A scheduling scheme in the cloud computing environment using deep Q-learning. Inf Sci (Ny) 512:1170\u20131191","journal-title":"Inf Sci (Ny)"},{"key":"4729_CR20","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J Du","year":"1989","unstructured":"Du J, Leung JY-T (1989) Complexity of scheduling parallel task systems. SIAM J Discret Math 2:473\u2013487","journal-title":"SIAM J Discret Math"},{"key":"4729_CR21","doi-asserted-by":"crossref","unstructured":"Pop F, Dobre C, Cristea V (2008) Performance analysis of grid DAG scheduling algorithms using MONARC simulation tool. In: 2008 International Symposium on Parallel and Distributed Computing, pp 131\u2013138","DOI":"10.1109\/ISPDC.2008.15"},{"key":"4729_CR22","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1109\/TPDS.2008.260","volume":"20","author":"D Bozdag","year":"2008","unstructured":"Bozdag D, Ozguner F, Catalyurek UV (2008) Compaction of schedules and a two-stage approach for duplication-based DAG scheduling. IEEE Trans Parallel Distrib Syst 20:857\u2013871","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"4729_CR23","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.4171\/owr\/2004\/28","volume":"1","author":"R Kannan","year":"2005","unstructured":"Kannan R, Karpinski M (2005) Approximation algorithms for NP-hard problems. Oberwolfach Reports 1:1461\u20131540","journal-title":"Oberwolfach Reports"},{"key":"4729_CR24","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/261342.571216","volume":"28","author":"DS Hochba","year":"1997","unstructured":"Hochba DS (1997) Approximation algorithms for NP-hard problems. ACM SIGACT News 28:40\u201352","journal-title":"ACM SIGACT News"},{"key":"4729_CR25","doi-asserted-by":"crossref","unstructured":"Demirci G, Marincic I, Hoffmann H (2018) A divide and conquer algorithm for dag scheduling under power constraints. In: SC18: International Conference for High Performance Computing, Networking, Storage and Analysis, pp 466\u2013477","DOI":"10.1109\/SC.2018.00039"},{"key":"4729_CR26","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.jcss.2005.08.002","volume":"72","author":"L Epstein","year":"2006","unstructured":"Epstein L, Tassa T (2006) Optimal preemptive scheduling for general target functions. J Comput Syst Sci 72:132\u2013162","journal-title":"J Comput Syst Sci"},{"key":"4729_CR27","doi-asserted-by":"publisher","first-page":"10252","DOI":"10.1007\/s11227-021-03685-9","volume":"77","author":"M Sulaiman","year":"2021","unstructured":"Sulaiman M, Halim Z, Waqas M et al (2021) A hybrid list-based task scheduling scheme for heterogeneous computing. J Supercomput 77:10252\u201310288","journal-title":"J Supercomput"},{"key":"4729_CR28","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu H, Hariri S, Wu M-Y (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans parallel Distrib Syst 13:260\u2013274","journal-title":"IEEE Trans parallel Distrib Syst"},{"key":"4729_CR29","doi-asserted-by":"publisher","first-page":"5960","DOI":"10.1007\/s11227-020-03506-5","volume":"77","author":"J Li","year":"2021","unstructured":"Li J, Zhang X, Han L et al (2021) OKCM: improving parallel task scheduling in high-performance computing systems using online learning. J Supercomput 77:5960\u20135983","journal-title":"J Supercomput"},{"key":"4729_CR30","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s11227-020-03281-3","volume":"77","author":"R Ramezani","year":"2021","unstructured":"Ramezani R (2021) Dynamic scheduling of task graphs in multi-FPGA systems using the critical path. J Supercomput 77:597\u2013618","journal-title":"J Supercomput"},{"key":"4729_CR31","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s11277-021-08634-6","volume":"121","author":"SK Chowdhary","year":"2021","unstructured":"Chowdhary SK, Rao ALN (2021) QoS Enhancement in Cloud-IoT Framework for Educational Institution with Task Allocation and Scheduling with Task-VM Matching Approach. Wireless PersCommun 121:267\u2013286","journal-title":"Wireless PersCommun"},{"key":"4729_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-022-09621-1","author":"R Medara","year":"2022","unstructured":"Medara R, Singh RS (2022) A Review on Energy-Aware Scheduling Techniques for Workflows in IaaS Clouds. Wireless PersCommun. https:\/\/doi.org\/10.1007\/s11277-022-09621-1","journal-title":"Wireless PersCommun"},{"key":"4729_CR33","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.ins.2014.02.122","volume":"270","author":"Y Xu","year":"2014","unstructured":"Xu Y, Li K, Hu J, Li K (2014) A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues. Inf Sci (Ny) 270:255\u2013287","journal-title":"Inf Sci (Ny)"},{"key":"4729_CR34","doi-asserted-by":"crossref","unstructured":"Xu X-J, Xiao C-B, Tian G-Z, Sun T (2016) Hybrid scheduling deadline-constrained multi-DAGs based on reverse HEFT. In: 2016 International Conference on Information System and Artificial Intelligence (ISAI), pp 196\u2013202","DOI":"10.1109\/ISAI.2016.0050"},{"key":"4729_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.ins.2014.02.008","volume":"357","author":"P Samimi","year":"2016","unstructured":"Samimi P, Teimouri Y, Mukhtar M (2016) A combinatorial double auction resource allocation model in cloud computing. Inf Sci (Ny) 357:201\u2013216","journal-title":"Inf Sci (Ny)"},{"key":"4729_CR36","doi-asserted-by":"crossref","unstructured":"Rajak R, Shukla D, Alim A (2018) Modified critical path and top-level attributes (MCPTL)-based task scheduling algorithm in parallel computing. In: Soft Computing: Theories and Applications. Springer, pp 1\u201313","DOI":"10.1007\/978-981-10-5687-1_1"},{"key":"4729_CR37","doi-asserted-by":"crossref","unstructured":"Rajak R (2018) Deterministic task scheduling method in multiprocessor environment. In: International Conference on Advances in Computing and Data Sciences, pp 331\u2013341","DOI":"10.1007\/978-981-13-1810-8_33"},{"key":"4729_CR38","unstructured":"Rajak N, Shukla D, (2019) Performance analysis of workflow scheduling algorithm in cloud computing environment using priority attribute. Int J Adv Sci Technol Australia 28(16):1810 \u2013 1831"},{"key":"4729_CR39","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","volume":"61","author":"TD Braun","year":"2001","unstructured":"Braun TD, Siegel HJ, Beck N et al (2001) A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J Parallel Distrib Comput 61:810\u2013837","journal-title":"J Parallel Distrib Comput"},{"key":"4729_CR40","doi-asserted-by":"crossref","unstructured":"Pop F, Dobre C, Cristea V (2009) Genetic algorithm for DAG scheduling in grid environments. In: 2009 IEEE 5th International Conference on Intelligent Computer Communication and Processing, pp 299\u2013305","DOI":"10.1109\/ICCP.2009.5284747"},{"key":"4729_CR41","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/TPDS.2009.84","volume":"21","author":"L-C Canon","year":"2009","unstructured":"Canon L-C, Jeannot E (2009) Evaluation and optimization of the robustness of dag schedules in heterogeneous environments. IEEE Trans Parallel Distrib Syst 21:532\u2013546","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"6","key":"4729_CR42","first-page":"666","volume":"32","author":"Raza Abbas Haidri","year":"2020","unstructured":"Raza Abbas Haidri (2020) ChittaranjanPadmanabhKatti, Prem Chandra Saxena, Cost effective deadline aware scheduling strategy for workflow applications on virtual machines in cloud computing. J King Saud Univ Comput Inf Sci 32(6):666\u2013683","journal-title":"J King Saud Univ Comput Inf Sci"},{"key":"4729_CR43","doi-asserted-by":"crossref","unstructured":"Darbha S, Aggarwal DP (1994) SDBS: A task duplication based optimal scheduling algorithm. In Proceedings of IEEE scalable high performance computing conference, Knoxville, TN, pp 756_61.","DOI":"10.1109\/SHPCC.1994.296717"},{"key":"4729_CR44","doi-asserted-by":"crossref","unstructured":"Sinnen O Task scheduling for parallel systems. Wiley-Interscience Publication (2007)","DOI":"10.1002\/0470121173"},{"key":"4729_CR45","doi-asserted-by":"crossref","unstructured":"Kumar MS, Gupta I (2017) Jana PK Delay-based workflow scheduling for cost optimization in heterogeneous cloud system. In: 2017 Tenth International Conference on Contemporary Computing (IC3), Noida, pp. 1\u20136","DOI":"10.1109\/IC3.2017.8284323"},{"issue":"12","key":"4729_CR46","doi-asserted-by":"publisher","first-page":"7945","DOI":"10.1007\/s13369-018-3261-8","volume":"43","author":"I Gupta","year":"2018","unstructured":"Gupta I, Kumar MS, Jana PK (2018) Efficient workflow scheduling algorithm for cloud computing system: a dynamic priority-based approach. Arab J Sci Eng 43(12):7945\u20137960","journal-title":"Arab J Sci Eng"},{"key":"4729_CR47","unstructured":"Hwang K (2005) Advanced computer architecture: parallelism,scalability, programmability, 5th reprint. New Delhi:TMH Publishing Company, pp 51_104"},{"key":"4729_CR48","doi-asserted-by":"crossref","unstructured":"Akbar MF, Munir EU, Rafique M M, Malik, Khan SU, Yang LT (2016)zs List-Based Task Scheduling for Cloud Computing. In: IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical And Social Computing (CPSCom) and IEEE Smart Data (SmartData), Chengdu, pp 652\u2013659","DOI":"10.1109\/iThings-GreenCom-CPSCom-SmartData.2016.143"},{"key":"4729_CR49","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.eij.2015.07.001","volume":"16","author":"M Kalra","year":"2015","unstructured":"Kalra M, Singh S (2015) A review of metaheuristic scheduling techniques in cloud computing. Egypt informatics J 16:275\u2013295","journal-title":"Egypt informatics J"},{"key":"4729_CR50","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. MIT press"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04729-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-022-04729-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-022-04729-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T19:23:17Z","timestamp":1727724197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-022-04729-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,4]]},"references-count":50,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["4729"],"URL":"https:\/\/doi.org\/10.1007\/s11227-022-04729-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,4]]},"assertion":[{"value":"16 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Authors declares that they have mo conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}