{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T02:42:49Z","timestamp":1774492969586,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T00:00:00Z","timestamp":1673913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T00:00:00Z","timestamp":1673913600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Efficient utilization of available computing resources in Cloud computing is one of the most challenging problems for cloud providers. This requires the design of an efficient and optimal task-scheduling strategy that can play a vital role in the functioning and overall performance of the cloud computing system. Optimal Schedules are specifically needed for scheduling virtual machines in fluctuating &amp; unpredictable dynamic cloud scenario. Although there exist numerous approaches for enhancing task scheduling in the cloud environment, it is still an open issue. The paper focuses on an improved &amp; enhanced ordinal optimization technique to reduce the large search space for optimal scheduling in the minimum time to achieve the goal of minimum makespan. To meet the current requirement of optimal schedule for minimum makespan, ordinal optimization that uses horse race conditions for selection rules is applied in an enhanced reiterative manner to achieve low overhead by smartly allocating the load to the most promising schedule. This proposed ordinal optimization technique and linear regression generate optimal schedules that help achieve minimum makespan. Furthermore, the proposed mathematical equation, derived using linear regression, predicts any future dynamic workload for a minimum makespan period target.<\/jats:p>","DOI":"10.1186\/s13677-023-00392-z","type":"journal-article","created":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T03:03:07Z","timestamp":1673924587000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["An enhanced ordinal optimization with lower scheduling overhead based novel approach for task scheduling in cloud computing environment"],"prefix":"10.1186","volume":"12","author":[{"given":"Monika","family":"Yadav","sequence":"first","affiliation":[]},{"given":"Atul","family":"Mishra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,17]]},"reference":[{"issue":"3","key":"392_CR1","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1109\/TKDE.2010.113","volume":"23","author":"P Delias","year":"2011","unstructured":"Delias P, Doulamis AD, Doulamis ND, Matsatsinis N (2011) Optimizing resource conflicts in workflow management systems. IEEE Trans Knowl Data Eng 23(3):417\u2013432. https:\/\/doi.org\/10.1109\/TKDE.2010.113","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"11","key":"392_CR2","doi-asserted-by":"publisher","first-page":"4796","DOI":"10.1007\/s11227-017-2050-6","volume":"73","author":"A Hanani","year":"2017","unstructured":"Hanani A, Rahmani AM, Sahafi A (2017) A multi-parameter scheduling method of dynamic workloads for big data calculation in cloud computing. J Supercomput 73(11):4796\u20134822. https:\/\/doi.org\/10.1007\/s11227-017-2050-6","journal-title":"J Supercomput"},{"key":"392_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1109\/ICPP.2013.54","volume-title":"Proceedings of the international conference on parallel processing","author":"N Tziritas","year":"2013","unstructured":"Tziritas N, Xu CZ, Loukopoulos T, Khan SU, Yu Z (2013) Application-aware workload consolidation to minimize both energy consumption and network load in cloud environments. In: Proceedings of the international conference on parallel processing, pp 449\u2013457. https:\/\/doi.org\/10.1109\/ICPP.2013.54"},{"key":"392_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1515\/9783110628517-005","volume-title":"Internet of things","author":"M Yadav","year":"2020","unstructured":"Yadav M, Poongodi T (2020) 5. Federated cloud service management and IoT. In: Internet of things, 1st edn. De Gruyter, p 101. https:\/\/doi.org\/10.1515\/9783110628517-005","edition":"1"},{"key":"392_CR5","doi-asserted-by":"publisher","unstructured":"Sandhu AK (2022) Big data with cloud computing: discussions and challenges. Big Data Min Anal 5(1). https:\/\/doi.org\/10.26599\/BDMA.2021.9020016","DOI":"10.26599\/BDMA.2021.9020016"},{"key":"392_CR6","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2008.5217932","volume-title":"2008 SC - international conference for high performance computing, networking, storage and analysis, SC 2008","author":"E Deelman","year":"2008","unstructured":"Deelman E, Singh G, Livny M, Berriman B, Good J (2008) The cost of doing science on the cloud: the montage example. In: 2008 SC - international conference for high performance computing, networking, storage and analysis, SC 2008. https:\/\/doi.org\/10.1109\/SC.2008.5217932"},{"key":"392_CR7","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1109\/eScience.2008.167","volume-title":"Proceedings - 4th IEEE international conference on eScience, eScience 2008","author":"C Hoffa","year":"2008","unstructured":"Hoffa C et al (2008) On the use of cloud computing for scientific workflows. In: Proceedings - 4th IEEE international conference on eScience, eScience 2008, pp 640\u2013645. https:\/\/doi.org\/10.1109\/eScience.2008.167"},{"key":"392_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-981-33-4087-9","volume-title":"Proceedings of international conference on machine intelligence and data science applications: MIDAS 2020","author":"M Yadav","year":"2021","unstructured":"Yadav M, Breja M (2021) Genre-based recommendation on community cloud using Apriori algorithm. In: Prateek M, Singh TP, Choudhury T, Pandey HM, Gia Nhu N (eds) Proceedings of international conference on machine intelligence and data science applications: MIDAS 2020. Springer Singapore, Singapore, pp 139\u2013151. https:\/\/doi.org\/10.1007\/978-981-33-4087-9"},{"issue":"1","key":"392_CR9","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1109\/TCC.2013.3","volume":"1","author":"SUR Malik","year":"2013","unstructured":"Malik SUR, Khan SU, Srinivasan SK (2013) Modeling and analysis of state-of-the-art VM-based cloud management platforms. IEEE Trans Cloud Comput 1(1):50\u201363. https:\/\/doi.org\/10.1109\/TCC.2013.3","journal-title":"IEEE Trans Cloud Comput"},{"key":"392_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.future.2013.12.024","volume":"34","author":"TS Somasundaram","year":"2014","unstructured":"Somasundaram TS, Govindarajan K (2014) CLOUDRB: a framework for scheduling and managing High-Performance Computing (HPC) applications in science cloud. Futur Gener Comput Syst 34:47\u201365. https:\/\/doi.org\/10.1016\/j.future.2013.12.024","journal-title":"Futur Gener Comput Syst"},{"issue":"2019","key":"392_CR11","doi-asserted-by":"publisher","first-page":"2590","DOI":"10.1016\/j.procs.2020.03.317","volume":"167","author":"M Yadav","year":"2020","unstructured":"Yadav M, Breja M (2020) Secure DNA and Morse code based profile access control models for cloud computing environment. Procedia Comput Sci 167(2019):2590\u20132598. https:\/\/doi.org\/10.1016\/j.procs.2020.03.317","journal-title":"Procedia Comput Sci"},{"issue":"1","key":"392_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.26599\/TST.2019.9010025","volume":"25","author":"D Kim","year":"2020","unstructured":"Kim D, Son J, Seo D, Kim Y, Kim H, Seo JT (2020) A novel transparent and auditable fog-assisted cloud storage with compensation mechanism. Tsinghua Sci Technol 25(1):28\u201343. https:\/\/doi.org\/10.26599\/TST.2019.9010025","journal-title":"Tsinghua Sci Technol"},{"issue":"3","key":"392_CR13","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1093\/comjnl\/bxh086","volume":"48","author":"A Do\u01e7an","year":"2005","unstructured":"Do\u01e7an A, \u00d6zg\u00fcner F (2005) Biobjective scheduling algorithms for execution time-reliability trade-off in heterogeneous computing systems. Comput J 48(3):300\u2013314. https:\/\/doi.org\/10.1093\/comjnl\/bxh086","journal-title":"Comput J"},{"key":"392_CR14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2008.4536431","volume-title":"IPDPS Miami 2008 - proceedings of the 22nd IEEE international parallel and distributed processing symposium, program and CD-ROM","author":"J Smith","year":"2008","unstructured":"Smith J, Siegel HJ, Maciejewski AA (2008) A stochastic model for robust resource allocation in heterogeneous parallel and distributed computing systems. In: IPDPS Miami 2008 - proceedings of the 22nd IEEE international parallel and distributed processing symposium, program and CD-ROM. https:\/\/doi.org\/10.1109\/IPDPS.2008.4536431"},{"issue":"2","key":"392_CR15","doi-asserted-by":"publisher","first-page":"181","DOI":"10.23919\/icn.2020.0014","volume":"1","author":"S Nath","year":"2020","unstructured":"Nath S, Wu J (2020) Deep reinforcement learning for dynamic computation offloading and resource allocation in cache-assisted mobile edge computing systems. Intell Converged Netw 1(2):181\u2013198. https:\/\/doi.org\/10.23919\/icn.2020.0014","journal-title":"Intell Converged Netw"},{"key":"392_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/WORKS.2006.5282330","volume-title":"2006 workshop on workflows in support of large-scale science, WORKS\u201906","author":"J Yu","year":"2006","unstructured":"Yu J, Buyya R (2006) A budget constrained scheduling of workflow applications on utility grids using genetic algorithms. In: 2006 workshop on workflows in support of large-scale science, WORKS\u201906, vol 14, pp 217\u2013230. https:\/\/doi.org\/10.1109\/WORKS.2006.5282330"},{"issue":"1","key":"392_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.26599\/TST.2019.9010044","volume":"26","author":"W Zhang","year":"2021","unstructured":"Zhang W, Chen X, Jiang J (2021) A multi-objective optimization method of initial virtual machine fault-tolerant placement for star topological data centers of cloud systems. Tsinghua Sci Technol 26(1):95\u2013111. https:\/\/doi.org\/10.26599\/TST.2019.9010044","journal-title":"Tsinghua Sci Technol"},{"key":"392_CR18","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/IPDPS.2009.5160912","volume-title":"IPDPS 2009 - proceedings of the 2009 IEEE international parallel and distributed processing symposium","author":"A Benoit","year":"2009","unstructured":"Benoit A, Marchal L, Pineau JF, Robert Y, Vivien F (2009) Resource-aware allocation strategies for divisible loads on large-scale systems. In: IPDPS 2009 - proceedings of the 2009 IEEE international parallel and distributed processing symposium, pp 2\u20135. https:\/\/doi.org\/10.1109\/IPDPS.2009.5160912"},{"issue":"4","key":"392_CR19","doi-asserted-by":"publisher","first-page":"210","DOI":"10.12720\/jait.8.4.210-218","volume":"8","author":"MB Gawali","year":"2017","unstructured":"Gawali MB, Shinde SK (2017) Standard deviation based modified cuckoo optimization algorithm for task scheduling to efficient resource allocation in cloud computing. J Adv Inf Technol 8(4):210\u2013218. https:\/\/doi.org\/10.12720\/jait.8.4.210-218","journal-title":"J Adv Inf Technol"},{"key":"392_CR20","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-13119-6_2","volume-title":"Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics)","author":"R Buyya","year":"2010","unstructured":"Buyya R, Ranjan R, Calheiros RN (2010) InterCloud: utility-oriented federation of cloud computing environments for scaling of application services. In: Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics), vol 6081 LNCS, no. PART 1, pp 13\u201331. https:\/\/doi.org\/10.1007\/978-3-642-13119-6_2"},{"key":"392_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/ISPDC.2007.4","volume-title":"Sixth international symposium on parallel and distributed computing, ISPDC 2007","author":"K Lu","year":"2007","unstructured":"Lu K, Zomaya AY (2007) A hybrid policy for job scheduling and load balancing in heterogeneous computational grids. In: Sixth international symposium on parallel and distributed computing, ISPDC 2007. https:\/\/doi.org\/10.1109\/ISPDC.2007.4"},{"key":"392_CR22","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1109\/CLOUD.2010.58","volume-title":"Proceedings - 2010 IEEE 3rd international conference on cloud computing, CLOUD 2010","author":"R Van Den Bossche","year":"2010","unstructured":"Van Den Bossche R, Vanmechelen K, Broeckhove J (2010) Cost-optimal scheduling in hybrid IaaS clouds for deadline constrained workloads. In: Proceedings - 2010 IEEE 3rd international conference on cloud computing, CLOUD 2010, pp 228\u2013235. https:\/\/doi.org\/10.1109\/CLOUD.2010.58"},{"key":"392_CR23","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1109\/CCGRID.2018.00064","volume-title":"Proceedings - 18th IEEE\/ACM international symposium on cluster, cloud and grid computing, CCGRID 2018","author":"L Bertot","year":"2018","unstructured":"Bertot L, Genaud S, Gossa J (2018) An overview of cloud simulation enhancement using the Monte-Carlo method. In: Proceedings - 18th IEEE\/ACM international symposium on cluster, cloud and grid computing, CCGRID 2018, pp 386\u2013387. https:\/\/doi.org\/10.1109\/CCGRID.2018.00064"},{"issue":"2","key":"392_CR24","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/TCC.2014.2350490","volume":"3","author":"F Zhang","year":"2015","unstructured":"Zhang F, Cao J, Hwang K, Li K, Khan SU (2015) Adaptive workflow scheduling on cloud computing platforms with iterativeordinal optimization. IEEE Trans Cloud Comput 3(2):156\u2013168. https:\/\/doi.org\/10.1109\/TCC.2014.2350490","journal-title":"IEEE Trans Cloud Comput"},{"issue":"3","key":"392_CR25","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1109\/TETC.2014.2348196","volume":"2","author":"F Zhang","year":"2014","unstructured":"Zhang F, Cao J, Tan W, Khan SU, Li K, Zomaya AY (2014) Evolutionary scheduling of dynamic multitasking workloads for big-data analytics in elastic cloud. IEEE Trans Emerg Top Comput 2(3):338\u2013351. https:\/\/doi.org\/10.1109\/TETC.2014.2348196","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"392_CR26","doi-asserted-by":"publisher","unstructured":"Gawali MB, Shinde SK (2018) Task scheduling and resource allocation in cloud computing using a heuristic approach. J Cloud Comput 7(1). https:\/\/doi.org\/10.1186\/s13677-018-0105-8","DOI":"10.1186\/s13677-018-0105-8"},{"issue":"1","key":"392_CR27","doi-asserted-by":"publisher","first-page":"42","DOI":"10.4304\/jcp.7.1.42-52","volume":"7","author":"J Gu","year":"2012","unstructured":"Gu J, Hu J, Zhao T, Sun G (2012) A new resource scheduling strategy based on genetic algorithm in cloud computing environment. J Comput 7(1):42\u201352. https:\/\/doi.org\/10.4304\/jcp.7.1.42-52","journal-title":"J Comput"},{"issue":"3","key":"392_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 MY (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260\u2013274. https:\/\/doi.org\/10.1109\/71.993206","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"5","key":"392_CR29","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1109\/TPDS.2015.2446459","volume":"27","author":"Z Zhu","year":"2016","unstructured":"Zhu Z, Zhang G, Li M, Liu X (2016) Evolutionary multi-objective workflow scheduling in cloud. IEEE Trans Parallel Distrib Syst 27(5):1344\u20131357. https:\/\/doi.org\/10.1109\/TPDS.2015.2446459","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3\u20134","key":"392_CR30","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0020-0255(98)10056-7","volume":"113","author":"YC Ho","year":"1999","unstructured":"Ho YC (1999) An explanation of ordinal optimization: soft computing for hard problems. Inf Sci 113(3\u20134):169\u2013192. https:\/\/doi.org\/10.1016\/S0020-0255(98)10056-7","journal-title":"Inf Sci"},{"key":"392_CR31","doi-asserted-by":"publisher","unstructured":"Malawski M, Figiela K, Bubak M, Deelman E, Nabrzyski J (2015) Scheduling multilevel deadline-constrained scientific workflows on clouds based on cost optimization. Sci Program 2015. https:\/\/doi.org\/10.1155\/2015\/680271","DOI":"10.1155\/2015\/680271"},{"issue":"3","key":"392_CR32","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1023\/a:1022614327007","volume":"93","author":"TW Edward Lau","year":"1997","unstructured":"Edward Lau TW, Ho YC (1997) Universal alignment probabilities and subset selection for ordinal optimization. J Optim Theory Appl 93(3):455\u2013489. https:\/\/doi.org\/10.1023\/a:1022614327007","journal-title":"J Optim Theory Appl"},{"key":"392_CR33","doi-asserted-by":"publisher","first-page":"3566","DOI":"10.1016\/j.proeng.2012.06.412","volume":"38","author":"T Goyal","year":"2012","unstructured":"Goyal T, Singh A, Agrawa A (2012) Cloudsim: simulator for cloud computing infrastructure and modeling. Procedia Eng 38:3566\u20133572. https:\/\/doi.org\/10.1016\/j.proeng.2012.06.412","journal-title":"Procedia Eng"},{"issue":"1\u20132","key":"392_CR34","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1504\/IJIMS.2020.105027","volume":"7","author":"M Yadav","year":"2020","unstructured":"Yadav M, Mishra A, Balusamy B (2020) Design of candidate schedules for applying iterative ordinal optimisation for scheduling technique on cloud computing platform. Int J Internet Manuf Serv 7(1\u20132):5\u201319. https:\/\/doi.org\/10.1504\/IJIMS.2020.105027","journal-title":"Int J Internet Manuf Serv"},{"issue":"1\u20134","key":"392_CR35","doi-asserted-by":"publisher","first-page":"107268","DOI":"10.1016\/j.ress.2020.107268","volume":"206","author":"Y Hu","year":"2000","unstructured":"Hu Y et al (2000) Screening of optimal structure among large-scale multi-state weighted k-out-of-n systems considering reliability evaluation. Ann Oper Res 206(1\u20134):107268. https:\/\/doi.org\/10.1016\/j.ress.2020.107268","journal-title":"Ann Oper Res"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00392-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-023-00392-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00392-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T03:05:09Z","timestamp":1673924709000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-023-00392-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,17]]},"references-count":35,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["392"],"URL":"https:\/\/doi.org\/10.1186\/s13677-023-00392-z","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,17]]},"assertion":[{"value":"19 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The work is a novel work and has not been published elsewhere nor is it currently under review for publication elsewhere.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"8"}}