Abstract: A new algorithm for resource scheduling in grid environment based on multiQoS constraints and greedy method was proposed. It takes a driver function which is determined by parameters“deadline”, “budget”, “time weight” and “cost weight” which the user provided as the greedy criterion. The performance of this new scheduling algorithm, choosing a most economic resource for scheduling each time and achieving the maximum of customer′s satisfaction, is demonstrated by its implementation on Gridsim.

Key words: Greedy algorithm, Gridsim, schedule, computational grid, economic model, Greedy algorithm, Gridsim, schedule, computational grid