An Optimal Algorithm for Scheduling Tasks within Deadline and Budget Constraints

In the market-oriented grid environment, clients make use of grid computing resources to execute many independent tasks. According to the urgency of tasks and deficiency of client’ budget, not all the tasks could be completed as demanded. To maximize the number of completed tasks, a linear programming model based scheduling algorithm (LMBS) is proposed in this paper. Comparing with other algorithms, experiment results show that performance of LMBS is much better obviously.