Grid Scheduling Heuristic Methods: State of the Art

Abstract

Efficient management of the Grid resources require fair resource allocation and scheduling. The mapping of jobs to the resources in the Grid is a NP complete problem. NPcomplete problems are often solved using heuristic techniques. Over the time, heuristics and meta-heuristics have proved to provide an optimum solution for the combinatorial optimization problems. In this paper, a survey of scheduling algorithms and heuristic approaches is done. The motivation of this survey is to encourage the amateur research of heuristics based scheduling in Grid computing, so that the researchers can understand the concept of heuristic approaches for resource scheduling in the Grid computing. The comparison of the heuristic has been shown and experimental result shows that the hyper-heuristics can be of significance importance in Grid scheduling.