multi-objective scheduling

Over the recent years, one of the important aspects of cloud computing is the dynamic scheduling of a large number of task requests which are submitted with variable rate by users. Task scheduling plays a key role in cloud computing systems, and this type of scheduling can not be done on a single criterion, but many rules and conditions must be considered as an agreement between users and cloud providers. In fact, this agreement is the quality of the services that users expect from providers. Cloud data centers should not only execute these huge tasks, but also should meet the multiple needs of different users. In this paper, a multi-objective task scheduling strategy is proposed using non-dominated sorting, calculate normal and threshold rates. The aim of the proposed approach is considering some of the most important criteria for quality of service at the time of tasks execution, that means deadline and cost. In addition, the cloud elasticity property is considered. The simulation results show improvement in the conditions of makespan, cost, mean utilization of virtual machines and deadlines violation compared to MultiObjective, FCFS, Min-Min, Priority Schedulig and MOF approaches.