{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T11:10:11Z","timestamp":1783336211629,"version":"3.54.6"},"reference-count":27,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T00:00:00Z","timestamp":1526515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004733","name":"Universidade de Macau","doi-asserted-by":"publisher","award":["MYRG2016-00069-FST"],"award-info":[{"award-number":["MYRG2016-00069-FST"]}],"id":[{"id":"10.13039\/501100004733","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004733","name":"Universidade de Macau","doi-asserted-by":"publisher","award":["MYRG2016-00217-FST"],"award-info":[{"award-number":["MYRG2016-00217-FST"]}],"id":[{"id":"10.13039\/501100004733","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006469","name":"Fundo para o Desenvolvimento das Ci\u00eancias e da Tecnologia","doi-asserted-by":"publisher","award":["FDCT\/126\/2014\/A3"],"award-info":[{"award-number":["FDCT\/126\/2014\/A3"]}],"id":[{"id":"10.13039\/501100006469","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Cloud computing is a new commercial model that enables customers to acquire large amounts of virtual resources on demand. Resources including hardware and software can be delivered as services and measured by specific usage of storage, processing, bandwidth, etc. In Cloud computing, task scheduling is a process of mapping cloud tasks to Virtual Machines (VMs). When binding the tasks to VMs, the scheduling strategy has an important influence on the efficiency of datacenter and related energy consumption. Although many traditional scheduling algorithms have been applied in various platforms, they may not work efficiently due to the large number of user requests, the variety of computation resources and complexity of Cloud environment. In this paper, we tackle the task scheduling problem which aims to minimize makespan by Genetic Algorithm (GA). We propose an incremental GA which has adaptive probabilities of crossover and mutation. The mutation and crossover rates change according to generations and also vary between individuals. Large numbers of tasks are randomly generated to simulate various scales of task scheduling problem in Cloud environment. Based on the instance types of Amazon EC2, we implemented virtual machines with different computing capacity on CloudSim. We compared the performance of the adaptive incremental GA with that of Standard GA, Min-Min, Max-Min , Simulated Annealing and Artificial Bee Colony Algorithm in finding the optimal scheme. Experimental results show that the proposed algorithm can achieve feasible solutions which have acceptable makespan with less computation time.<\/jats:p>","DOI":"10.3390\/sym10050168","type":"journal-article","created":{"date-parts":[[2018,5,17]],"date-time":"2018-05-17T11:47:45Z","timestamp":1526557665000},"page":"168","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Adaptive Incremental Genetic Algorithm for Task Scheduling in Cloud Environments"],"prefix":"10.3390","volume":"10","author":[{"given":"Kairong","family":"Duan","sequence":"first","affiliation":[{"name":"Department of Computer and Information Science, University of Macau, Taipa 999078, Macau"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon","family":"Fong","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, University of Macau, Taipa 999078, Macau"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3695-7758","authenticated-orcid":false,"given":"Shirley W. I.","family":"Siu","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Science, University of Macau, Taipa 999078, Macau"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5909-9661","authenticated-orcid":false,"given":"Wei","family":"Song","sequence":"additional","affiliation":[{"name":"School of Computer Science, North China University of Technology, Beijing 100144, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3968-9752","authenticated-orcid":false,"given":"Steven Sheng-Uei","family":"Guan","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Software Engineering, Xi\u2019an Jiaotong-Liverpool University, Suzhou 215123, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2018,5,17]]},"reference":[{"key":"ref_1","unstructured":"Mell, P., and Grance, T. (2018, March 15). The NIST Definition of Cloud Computing, Available online: http:\/\/nvlpubs.nist.gov\/nistpubs\/Legacy\/SP\/nistspecialpublication800-145.pdf."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Radu, L.D. (2017). Green Cloud Computing: A Literature Survey. Symmetry, 9.","DOI":"10.3390\/sym9120295"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Encalada, W.L., and Sequera, J.L.C. (2017). Model to Implement Virtual Computing Labs via Cloud Computing Services. Symmetry, 9.","DOI":"10.3390\/sym9070117"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Gao, J., and Yi, R. (2017). Cloud generalized power ordered weighted average operator and its application to linguistic group decision-making. Symmetry, 9.","DOI":"10.3390\/sym9080156"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Chu, P.M., Cho, S., Fong, S., Park, Y.W., and Cho, K. (2017). 3D Reconstruction Framework for Multiple Remote Robots on Cloud System. Symmetry, 9.","DOI":"10.3390\/sym9040055"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Aarts, E., Korst, J., and Michiels, W. (2005). Simulated annealing. Search Methodologies, Springer.","DOI":"10.1007\/0-387-33416-5_2"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/BF02948918","article-title":"QoS guided min-min heuristic for grid task scheduling","volume":"18","author":"He","year":"2003","journal-title":"J. Comput. Sci. Tech."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Mao, Y., Chen, X., and Li, X. (2014, January 22\u201324). Max-min task scheduling algorithm for load balance in cloud computing. Proceedings of the International Conference on Computer Science and Information Technology, Barcelona, Spain.","DOI":"10.1007\/978-81-322-1759-6_53"},{"key":"ref_9","first-page":"3821","article-title":"Improved PSO-based task scheduling algorithm in cloud computing","volume":"9","author":"Zhan","year":"2012","journal-title":"J. Inf. Comput. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/TASE.2013.2272758","article-title":"Self-adaptive learning PSO-based deadline constrained task scheduling for hybrid IaaS cloud","volume":"11","author":"Zuo","year":"2014","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"3873","DOI":"10.1016\/j.eswa.2010.09.048","article-title":"Parallelized genetic ant colony systems for solving the traveling salesman problem","volume":"38","author":"Chen","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"ref_12","unstructured":"Tsai, P.W., Pan, J.S., Chen, S.M., Liao, B.Y., and Hao, S.P. (2008, January 12\u201315). Parallel cat swarm optimization. Proceedings of the Seventh International Conference on Machine Learning and Cybernetics, Kunming, China."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"6309","DOI":"10.1016\/j.eswa.2011.11.117","article-title":"Enhanced parallel cat swarm optimization based on the Taguchi method","volume":"39","author":"Tsai","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"204","DOI":"10.4028\/www.scientific.net\/AMM.596.204","article-title":"Performance Comparison of Energy-aware task scheduling with GA and CRO algorithms in Cloud Environment","volume":"596","author":"Wu","year":"2014","journal-title":"Appl. Mech. Mater."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Mahmood, A., and Khan, S.A. (2017). Hard Real-Time Task Scheduling in Cloud Computing Using an Adaptive Genetic Algorithm. Computers, 6.","DOI":"10.3390\/computers6020015"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","article-title":"A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm","volume":"39","author":"Karaboga","year":"2007","journal-title":"J. Glob. Optim."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Babu, K.R., and Samuel, P. (2016). Enhanced bee colony algorithm for efficient load balancing and scheduling in cloud. Innovations in Bio-Inspired Computing and Applications, Springer.","DOI":"10.1007\/978-3-319-28031-8_6"},{"key":"ref_18","unstructured":"Navimipour, N.J. (2015, January 3\u20134). Task scheduling in the cloud environments based on an artificial bee colony algorithm. Proceedings of the 2015 International Conference on Image Processing, Production and Computer Science, Istanbul, Turkey."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Fidanova, S. (2006, January 3\u20136). Simulated annealing for grid scheduling problem. Proceedings of the IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing, Sofia, Bulgaria.","DOI":"10.1109\/JVA.2006.44"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Mandal, T., and Acharyya, S. (2015, January 10\u201312). Optimal task scheduling in cloud computing environment: Meta heuristic approaches. Proceedings of the 2015 2nd International Conference on Electrical Information and Communication Technology (EICT), Khulna, Bangladesh.","DOI":"10.1109\/EICT.2015.7391916"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1661","DOI":"10.1109\/TIFS.2016.2549004","article-title":"Attribute-based data sharing scheme revisited in cloud computing","volume":"11","author":"Wang","year":"2016","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/MIC.2014.107","article-title":"Privacy concerns for photo sharing in online social networks","volume":"19","author":"Liang","year":"2015","journal-title":"IEEE Internet Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.future.2014.10.014","article-title":"Secure sharing of personal health records in cloud computing: Ciphertext-policy attribute-based signcryption","volume":"52","author":"Liu","year":"2015","journal-title":"Future Gener. Comput. Syst."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Wen, J., Lu, L., Casale, G., and Smirni, E. (July, January 27). Less can be more: Micro-managing vms in amazon EC2. Proceedings of the 2015 IEEE 8th International Conference on Cloud Computing, New York, NY, USA.","DOI":"10.1109\/CLOUD.2015.50"},{"key":"ref_25","unstructured":"(2018, April 01). Amazon EC2 Pricing. Available online: https:\/\/aws.amazon.com\/ec2\/pricing\/on-demand\/?nc1=h_ls."},{"key":"ref_26","unstructured":"(2018, April 01). Previous Generation Instances. Available online: https:\/\/aws.amazon.com\/ec2\/previous-generation\/?nc1=h_ls."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","article-title":"Adaptive probabilities of crossover and mutation in genetic algorithms","volume":"24","author":"Srinivas","year":"1994","journal-title":"IEEE Trans. Syst. Man Cybern."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/5\/168\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:04:42Z","timestamp":1760195082000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/10\/5\/168"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,17]]},"references-count":27,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,5]]}},"alternative-id":["sym10050168"],"URL":"https:\/\/doi.org\/10.3390\/sym10050168","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,17]]}}}