Resource Constraint Scheduling

Research 2 - Resource Constraint Scheduling

Given a set of tasks, a set of resources, a set of constraints and a set of performance metrics, the best way to assign resources to tasks, with the constraint being satisfied, so that the measured performance metric values show the highest possible values.

Scheduling problems are dynamic, the information regarding these are varying from time to time. Objectives are also dynamic in nature. So even for domain specific scheduling problem, there is a need to have a method of scheduling which can adapt to this dynamic nature. Every scheduling problem consists of a set of constraints. Temporal constraints, precedence constraints, availability constraints and combinations of above three types of constraints can be considered as main types of constraints. Although there are many methods for resource scheduling, they fail to find a solution when the objectives and constraints are changing.

Feasibility of a schedule is determined by how that schedule satisfies the set of constraints. Optimality of a schedule is determined by the values of objective measures corresponding to a particular schedule. Generally, resource constraint scheduling problems are considered as NP-Hard problems. There are no algorithms capable of finding an optimal solution to these problems in polynomial time.