{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T18:28:46Z","timestamp":1779128926111,"version":"3.51.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T00:00:00Z","timestamp":1683331200000},"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":["Wireless Pers Commun"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s11277-023-10454-9","type":"journal-article","created":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T13:01:43Z","timestamp":1683378103000},"page":"773-804","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Pair-Task Heuristic for Scheduling Tasks in Heterogeneous Multi-cloud Environment"],"prefix":"10.1007","volume":"131","author":[{"given":"Kamalam Gobichettipalayam","family":"Krishnasamy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suresh","family":"Periasamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keerthika","family":"Periasamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Prasanna Moorthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunasekaran","family":"Thangavel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravita","family":"Lamba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9156-2054","authenticated-orcid":false,"given":"Suresh","family":"Muthusamy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,6]]},"reference":[{"key":"10454_CR1","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/1934784","author":"AM Manasrah","year":"2018","unstructured":"Manasrah, A. M., & Ali, H. B. (2018). Workflow scheduling using Hybrid GA-PSO algorithm in cloud computing. Wireless Communications and Mobile Computing. https:\/\/doi.org\/10.1155\/2018\/1934784","journal-title":"Wireless Communications and Mobile Computing."},{"issue":"10","key":"10454_CR2","first-page":"1417","volume":"5","author":"L Singh","year":"2014","unstructured":"Singh, L., & Singh, S. (2014). Deadline and cost based ant colony optimization algorithm for scheduling workflow applications in hybrid cloud. Journal of Scientific & Engineering Research, 5(10), 1417\u20131420.","journal-title":"Journal of Scientific & Engineering Research"},{"issue":"5","key":"10454_CR3","first-page":"1530","volume":"25","author":"SGR Vasanthi","year":"2021","unstructured":"Vasanthi, S. G. R., Madhu Bharathi, M., Sentamilselvan, K., Priyadharshini, P., Subiramoniyan, S., & Jenopaul, P. (2021). LBMM in cloud computing. Annals of the Romanian Society for Cell Biology., 25(5), 1530\u20131536.","journal-title":"Annals of the Romanian Society for Cell Biology."},{"issue":"4","key":"10454_CR4","doi-asserted-by":"publisher","first-page":"10457","DOI":"10.35940\/ijrte.d9228.118419","volume":"8","author":"GK Kamalam","year":"2019","unstructured":"Kamalam, G. K., & Sentamilselvan, K. (2019). Limit value task scheduling (LVTS): An efficient task scheduling algorithm for distributed computing environment. International Journal Recent Technology and Engineering, 8(4), 10457\u201310462. https:\/\/doi.org\/10.35940\/ijrte.d9228.118419","journal-title":"International Journal Recent Technology and Engineering"},{"issue":"4","key":"10454_CR5","doi-asserted-by":"publisher","first-page":"10580","DOI":"10.35940\/ijrte.d8449.118419","volume":"8","author":"K Sentamilselvan","year":"2019","unstructured":"Sentamilselvan, K., & Kamalam, G. K. (2019). Potential finish time and min-mean algorithm for allocating meta-tasks on distributed computational grid. International Journal Recent Technology and Engineering, 8(4), 10580\u201310586. https:\/\/doi.org\/10.35940\/ijrte.d8449.118419","journal-title":"International Journal Recent Technology and Engineering"},{"key":"10454_CR6","doi-asserted-by":"crossref","unstructured":"Kamalam, G.K., Sentamilselvan, K., (2020) SLA-Based Group Tasks Max-Min (GTMax-Min) Algorithm for Task Scheduling in Multi-Cloud Environments, in EAI\/Springer Innovations in Communication and Computing, Springer, Cham, pp. 105\u2013127","DOI":"10.1007\/978-3-030-74402-1_6"},{"key":"10454_CR7","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1016\/j.procs.2015.09.064","volume":"65","author":"AI Awad","year":"2015","unstructured":"Awad, A. I., El-Hefnawy, N. A., & Abdel-Kader, H. M. (2015). Enhanced particle swarm optimization for task scheduling in cloud computing environments. Procedia Computer Science, 65, 920\u2013929. https:\/\/doi.org\/10.1016\/j.procs.2015.09.064","journal-title":"Procedia Computer Science"},{"issue":"1","key":"10454_CR8","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.eij.2017.07.001","volume":"19","author":"S Elsherbiny","year":"2018","unstructured":"Elsherbiny, S., Eldaydamony, E., Alrahmawy, M., & Reyad, A. E. (2018). An extended Intelligent Water Drops algorithm for workflow scheduling in cloud computing environment. Egypt. Informatics J., 19(1), 33\u201355. https:\/\/doi.org\/10.1016\/j.eij.2017.07.001","journal-title":"Egypt. Informatics J."},{"issue":"2","key":"10454_CR9","doi-asserted-by":"publisher","first-page":"498","DOI":"10.2307\/2273574","volume":"48","author":"HR Lewis","year":"1983","unstructured":"Lewis, H. R. (1983). Review of \u2018computers and intractability. A guide to the theory of NP-completeness.\u2019 Journal of Symbolic Logic, 48(2), 498\u2013500.","journal-title":"Journal of Symbolic Logic"},{"issue":"6","key":"10454_CR10","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1016\/j.jksuci.2017.10.009","volume":"32","author":"RA Haidri","year":"2020","unstructured":"Haidri, R. A., Katti, C. P., & Saxena, P. C. (2020). Cost effective deadline aware scheduling strategy for workflow applications on virtual machines in cloud computing. Journal of King Saud University-Computer and Information Sciences, 32(6), 666\u2013683. https:\/\/doi.org\/10.1016\/j.jksuci.2017.10.009","journal-title":"Journal of King Saud University-Computer and Information Sciences"},{"issue":"3","key":"10454_CR11","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. Egyptian Informatics Journal., 16(3), 275\u2013295. https:\/\/doi.org\/10.1016\/j.eij.2015.07.001","journal-title":"Egyptian Informatics Journal."},{"key":"10454_CR12","doi-asserted-by":"publisher","first-page":"146379","DOI":"10.1109\/ACCESS.2019.2946216","volume":"7","author":"S Pang","year":"2019","unstructured":"Pang, S., Li, W., He, H., Shan, Z., & Wang, X. (2019). An EDA-GA Hybrid Algorithm for Multi-Objective Task Scheduling in Cloud Computing. IEEE Access, 7, 146379\u2013146389. https:\/\/doi.org\/10.1109\/ACCESS.2019.2946216","journal-title":"IEEE Access"},{"key":"10454_CR13","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.jocs.2016.09.008","volume":"26","author":"S Yu","year":"2018","unstructured":"Yu, S., Li, K., & Xu, Y. (2018). A DAG task scheduling scheme on heterogeneous cluster systems using discrete IWO algorithm. Journal of Computer Science, 26, 307\u2013317. https:\/\/doi.org\/10.1016\/j.jocs.2016.09.008","journal-title":"Journal of Computer Science"},{"issue":"12","key":"10454_CR14","doi-asserted-by":"publisher","first-page":"1957","DOI":"10.3923\/ajit.2016.1957.1963","volume":"15","author":"GK Kamalam","year":"2016","unstructured":"Kamalam, G. K. (2016). Sort completion time mean tasks scheduling algorithm in decentralized grid environment. Asian J. Inf. Technol., 15(12), 1957\u20131963. https:\/\/doi.org\/10.3923\/ajit.2016.1957.1963","journal-title":"Asian J. Inf. Technol."},{"issue":"4","key":"10454_CR15","first-page":"85","volume":"8","author":"GK Kamalam","year":"2010","unstructured":"Kamalam, G. K., & Bhaskaran, V. M. (2010). An improved minmean heuristic scheduling algorithm for mapping independent tasks on heterogenous computing environment. Journal of Computational cognition., 8(4), 85\u201391.","journal-title":"Journal of Computational cognition."},{"issue":"18","key":"10454_CR16","first-page":"128","volume":"8","author":"GK Kamalam","year":"2014","unstructured":"Kamalam, G. K. (2014). Resource fitness task scheduling algorithm for scheduling tasks on heterogeneous grid environment. Australian Journal of Basic and Applied Sciences, 8(18), 128\u2013135.","journal-title":"Australian Journal of Basic and Applied Sciences"},{"issue":"10","key":"10454_CR17","doi-asserted-by":"publisher","first-page":"1369","DOI":"10.1142\/S0218194018500390","volume":"28","author":"H Gao","year":"2018","unstructured":"Gao, H., Miao, H., Liu, L., Kai, J., & Zhao, K. (2018). Automated quantitative verification for service-based system design: A visualization transform tool perspective. International Journal of Software Engineering and Knowledge Engineering, 28(10), 1369\u20131397. https:\/\/doi.org\/10.1142\/S0218194018500390","journal-title":"International Journal of Software Engineering and Knowledge Engineering"},{"issue":"2","key":"10454_CR18","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11036-019-01241-7","volume":"25","author":"Y Yin","year":"2020","unstructured":"Yin, Y., Chen, L., Xu, Y., Wan, J., Zhang, H., & Mai, Z. (2020). QoS prediction for service recommendation with deep feature learning in edge computing environment. Mobile Networks and Applications, 25(2), 391\u2013401. https:\/\/doi.org\/10.1007\/s11036-019-01241-7","journal-title":"Mobile Networks and Applications"},{"key":"10454_CR19","doi-asserted-by":"publisher","first-page":"2687","DOI":"10.1109\/ACCESS.2015.2508940","volume":"3","author":"L Zuo","year":"2015","unstructured":"Zuo, L., Shu, L., Dong, S., Zhu, C., & Hara, T. (2015). A multi-objective optimization scheduling method based on the ant colony algorithm in cloud computing. IEEE Access, 3, 2687\u20132699. https:\/\/doi.org\/10.1109\/ACCESS.2015.2508940","journal-title":"IEEE Access"},{"key":"10454_CR20","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.future.2018.04.064","volume":"87","author":"H Gao","year":"2018","unstructured":"Gao, H., Huang, W., Yang, X., Duan, Y., & Yin, Y. (2018). Toward service selection for workflow reconfiguration: An interface-based computing solution. Future Generation Computer Systems, 87, 298\u2013311. https:\/\/doi.org\/10.1016\/j.future.2018.04.064","journal-title":"Future Generation Computer Systems"},{"issue":"7","key":"10454_CR21","doi-asserted-by":"publisher","first-page":"358","DOI":"10.3390\/e19070358","volume":"19","author":"Y Yin","year":"2017","unstructured":"Yin, Y., Xu, Y., Xu, W., Gao, M., Yu, L., & Pei, Y. (2017). Collaborative service selection via ensemble learning in mixed mobile network environments. Entropy, 19(7), 358. https:\/\/doi.org\/10.3390\/e19070358","journal-title":"Entropy"},{"issue":"1","key":"10454_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13677-020-00219-1","volume":"10","author":"JK Konjaang","year":"2021","unstructured":"Konjaang, J. K., & Xu, L. (2021). Multi-objective workflow optimization strategy (MOWOS) for cloud computing. J. Cloud Comput., 10(1), 1\u201319. https:\/\/doi.org\/10.1186\/s13677-020-00219-1","journal-title":"J. Cloud Comput."},{"key":"10454_CR23","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/978-981-15-5258-8_74","volume":"53","author":"G Kiruthiga","year":"2021","unstructured":"Kiruthiga, G., & Mary Vennila, S. (2021). Multi-objective task scheduling using chaotic quantum-behaved chicken swarm optimization (cqcso) in cloud computing environment. Lecture Notes on Data Engineering and Communications Technologies, 53, 803\u2013814.","journal-title":"Lecture Notes on Data Engineering and Communications Technologies"},{"issue":"AISC","key":"10454_CR24","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-33030-8_8","volume":"191","author":"G Liu","year":"2013","unstructured":"Liu, G., Li, J., & Xu, J. (2013). An improved min-min algorithm in cloud computing. Advances in Intelligent Systems and Computing, 191(AISC), 47\u201352. https:\/\/doi.org\/10.1007\/978-3-642-33030-8_8","journal-title":"Advances in Intelligent Systems and Computing"},{"issue":"4","key":"10454_CR25","first-page":"1163","volume":"7","author":"NB Kamolov","year":"2015","unstructured":"Kamolov, N. B., & Choe, T. Y. (2015). Dynamic task scheduling algorithm based on ant colony scheme. Int. J. Eng. Technol., 7(4), 1163\u20131172.","journal-title":"Int. J. Eng. Technol."},{"key":"10454_CR26","doi-asserted-by":"publisher","unstructured":"Chaudhary, N., Kalra, M., Scholar, P.G., (2017) An improved Harmony Search algorithm with group technology model for scheduling workflows in cloud environment. in 2017 4th IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics, UPCON 2017, 2018-Janua, pp. 73\u201377, doi: https:\/\/doi.org\/10.1109\/UPCON.2017.8251025.","DOI":"10.1109\/UPCON.2017.8251025"},{"issue":"1","key":"10454_CR27","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1109\/TPDS.2016.2556668","volume":"28","author":"BP Rimal","year":"2017","unstructured":"Rimal, B. P., & Maier, M. (2017). Workflow scheduling in multi-tenant cloud computing environments. IEEE Transactions on Parallel and Distributed Systems, 28(1), 290\u2013304. https:\/\/doi.org\/10.1109\/TPDS.2016.2556668","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10454_CR28","doi-asserted-by":"publisher","unstructured":"Li, Y., Zhu, Z., Wang, Y., (2018) MIN-Max-Min: A heuristic scheduling algorithm for jobs across geo-distributed datacenters. in Proceedings\u2013International Conference on Distributed Computing Systems, 2018-July, pp. 1573\u20131574, doi: https:\/\/doi.org\/10.1109\/ICDCS.2018.00173.","DOI":"10.1109\/ICDCS.2018.00173"},{"key":"10454_CR29","doi-asserted-by":"publisher","unstructured":"Ghumman, N. S., Kaur, R., (2016) Dynamic combination of improved max-min and ant colony algorithm for load balancing in cloud system. in 2015 6th International Conference on Computing, Communication and Networking Technologies (ICCCNT), pp. 1\u20135 doi: https:\/\/doi.org\/10.1109\/ICCCNT.2015.7395172.","DOI":"10.1109\/ICCCNT.2015.7395172"},{"issue":"5","key":"10454_CR30","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1109\/TPDS.2013.107","volume":"25","author":"EK Tabak","year":"2014","unstructured":"Tabak, E. K., Cambazoglu, B. B., & Aykanat, C. (2014). Improving the performance of independenttask assignment heuristics minmin, maxmin and sufferage. IEEE Transactions on Parallel and Distributed Systems, 25(5), 1244\u20131256. https:\/\/doi.org\/10.1109\/TPDS.2013.107","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"10454_CR31","doi-asserted-by":"publisher","unstructured":"Etminani, K., Naghibzadeh, M., (2007) A min-min max-min selective algorihtm for grid task scheduling. in 2007 3rd IEEE\/IFIP International Conference in Central Asia on Internet (pp. 1\u20137). IEEE 2007, doi: https:\/\/doi.org\/10.1109\/canet.2007.4401694","DOI":"10.1109\/canet.2007.4401694"},{"key":"10454_CR32","doi-asserted-by":"publisher","unstructured":"Devipriya, S., Ramesh, C., (2013) Improved max-min heuristic model for task scheduling in cloud, in Proceedings of the 2013 International Conference on Green Computing, Communication and Conservation of Energy, ICGCE 2013, 2013, pp 883\u2013888, doi: https:\/\/doi.org\/10.1109\/ICGCE.2013.6823559.","DOI":"10.1109\/ICGCE.2013.6823559"},{"issue":"C","key":"10454_CR33","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.procs.2015.04.158","volume":"48","author":"AV Lakra","year":"2015","unstructured":"Lakra, A. V., & Kumar Yadav, D. (2015). Multi-objective tasks scheduling algorithm for cloud computing throughput optimization. Procedia Computer Science, 48(C), 107\u2013113. https:\/\/doi.org\/10.1016\/j.procs.2015.04.158","journal-title":"Procedia Computer Science"},{"key":"10454_CR34","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/j.procs.2015.07.419","volume":"57","author":"RK Jena","year":"2015","unstructured":"Jena, R. K. (2015). Multi objective task scheduling in cloud environment using nested PSO framework. Procedia Computer Science, 57, 1219\u20131227. https:\/\/doi.org\/10.1016\/j.procs.2015.07.419","journal-title":"Procedia Computer Science"},{"issue":"6","key":"10454_CR35","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","volume":"61","author":"TD Braun","year":"2001","unstructured":"Braun, T. D., et al. (2001). A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, 61(6), 810\u2013837. https:\/\/doi.org\/10.1006\/jpdc.2000.1714","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10454_CR36","doi-asserted-by":"publisher","DOI":"10.1109\/reldis.1998.740518","author":"TD Braun","year":"1998","unstructured":"Braun, T. D., et al. (1998). Taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing systems. Proceedings of the IEEE Symposium on Reliable Distributed Systems. https:\/\/doi.org\/10.1109\/reldis.1998.740518","journal-title":"Proceedings of the IEEE Symposium on Reliable Distributed Systems"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-023-10454-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-023-10454-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-023-10454-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T06:11:17Z","timestamp":1688623877000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-023-10454-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,6]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["10454"],"URL":"https:\/\/doi.org\/10.1007\/s11277-023-10454-9","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-1903846\/v1","asserted-by":"object"}]},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,6]]},"assertion":[{"value":"7 April 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no potential conflicts of interest with respect to the research, authorship, and\/or publication of this article. To the best of my knowledge and belief any actual, perceived or potential conflicts between my duties as an employee and my private and\/or business interests have been fully disclosed in this form in accordance with the requirements of the journal.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This material is the authors' own original work, which has not been previously published elsewhere. The paper is not currently being considered for publication elsewhere. The paper reflects the authors' own research and analysis in a truthful and complete manner.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"I have been informed of the risks and benefits involved, and all my questions have been answered to my satisfaction. Furthermore, I have been assured that any future questions I may have will also be answered by a member of the research team. I voluntarily agree to take part in this study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Individuals may consent to participate in a study, but object to having their data published in a journal article.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Publish"}}]}}