Abstract: A request is received to accomplish a task by using a plurality of resources. Once the task is received, attributes of the resources are retrieved from a memory including constraints associated with those resources. These constraints can include hard constraints and soft constraints. A first schedule is then created using a subset of the plurality of resources that complies with each task and resource hard constraint. A score based on the degree of compliance of each soft constraint is determined for the first schedule score. Thereafter the first schedule is modified to form a second schedule, again complying with each hard constraint. A second schedule score is determined associated with the second schedule. These scores are compared so as to determine and select the more optimal schedule. The process continues iteratively until modifications of the schedule no longer yield an improving schedule.