Minimizing job completion time in grid scheduling with resource and timing constraints using genetic algorithm

  • Authors:
  • A. C. Adamuthe;R. S. Bichkar

  • Affiliations:
  • College of Engineering Pandharpur, Pandharpur (MS), India;G. H. Raisony College of Engineering and Management, Pune, (MS), India

  • Venue:
  • Proceedings of the International Conference & Workshop on Emerging Trends in Technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Allocation of independent jobs to available resources in a computational grid environment is a combinatorial optimization problem which comes under category of NP hard, NP complete problems. The main objective of this study is to maximize the resource utilization in computational grid environment. The second objective is user satisfaction by minimizing job completion time. This paper presents genetic algorithm with overlapping populations and parallel genetic algorithm to the solution of the problem of job scheduling with resource and timing constraints. The scheduling problem is tackled in preemptive and non-preemptive mode. Two dimensional chromosome representation is proposed for the job assignment problem which reduces the calculation in fitness evaluations. Proposed Genetic algorithms are applied to three problem instances and the results obtained are compared with the results from literature.