A Deadline-Constrained Multi-Objective Task Scheduling Algorithm in Mobile Cloud Environments

Abstract

By leveraging the technology of the mobile cloud computing, resource capacity, and computing capability of mobile devices could be extended. However, it is difficult to schedule tasks submitted by mobile users when the number of tasks and service providers increases and to optimize multiple objectives while satisfying users' requirements. the task scheduling is modeled as a multi-objective optimization problem, and we consider both unconstrained and time deadline constrained cases. To address this problem, a heterogeneous earliest finish time (HEFT) using technique for order preference by similarity to an ideal solution method is proposed, which is named as HEFT-T algorithm. For the unconstr..