Date Added: May 2012
Grid computing provides the means of using and sharing heterogeneous resources that are geographically distributed to solve complex scientific or technical problems. Task scheduling is critical to achieving high performance on grid computing environment. The objective of the scheduling process is to map each task with specific requirements to a capable machine in order to minimize the makespan. Task scheduling is shown to be NP-complete problem, which can be solved using heuristic algorithms. Several heuristic algorithms have been proposed in the literature, and they are either not efficient or complex. In this paper, the authors are proposing a Multi Objectives heuristic Algorithm to minimize the makespan and flow time and to maximize the resource utilization with a low computational complexity.