<?xml version="1.0" encoding="UTF-8"?> <article key="pdf/4378" mdate="2011-07-28 00:00:00"> <author>Z. Pooranian and A. Harounabadi and M. Shojafar and N. Hedayat</author> <title>New Hybrid Algorithm for Task Scheduling in Grid Computing to Decrease missed Task</title> <pages>786 - 790</pages> <year>2011</year> <volume>5</volume> <number>7</number> <journal>International Journal of Computer and Information Engineering</journal> <ee>https://publications.waset.org/pdf/4378</ee> <url>https://publications.waset.org/vol/55</url> <publisher>World Academy of Science, Engineering and Technology</publisher> <abstract>The purpose of Grid computing is to utilize computational power of idle resources which are distributed in different areas. Given the grid dynamism and its decentralize resources, there is a need for an efficient scheduler for scheduling applications. Since task scheduling includes in the NPhard problems various researches have focused on invented algorithms especially the genetic ones. But since genetic is an inherent algorithm which searches the problem space globally and does not have the efficiency required for local searching, therefore, its combination with local searching algorithms can compensate for this shortcomings. The aim of this paper is to combine the genetic algorithm and GELS (GAGELS) as a method to solve scheduling problem by which simultaneously pay attention to two factors of time and number of missed tasks. Results show that the proposed algorithm can decrease makespan while minimizing the number of missed tasks compared with the traditional methods.</abstract> <index>Open Science Index 55, 2011</index> </article>