Computational grids have become an appealing research area as they solve compute-intensive problems within the scienti?c community and in industry. A grid computational power is aggregated from a huge set of distributed heterogeneous workers; hence, it is becoming a mainstream technology for large-scale distributed resource sharing and system integration. Unfortunately, current grid schedulers suffer from the haste problem, which is the schedule inability to successfully allocate all input tasks. Accordingly, some tasks fail to complete execution as they are allocated to unsuitable workers. Others may not start execution as suitable workers are previously allocated to other peers. This paper presents an imperialist competition algorithm (ICA) method to solve the grid scheduling problems. The objective is to minimize the makespan and energy of the grid. Simulation results show that the grid scheduling problem can be solved efficiently by the proposed method.