Due to the advances in human civilization, problems in science and engineering are becoming more complicated than ever before. To solve these complicated problems, grid computing becomes a popular tool. a grid environment collects, integrates, and uses heterogeneous or homogeneous resources scattered around the globe by a high-speed network. Scheduling problems are at the heart of any Grid- like computational system. a good scheduling algorithm can assign jobs to resources efficiently and can balance the system load. in this paper we survey three algorithms for grid scheduling and compare benefit and disadvantages of their based on makespan.