System and method for generating a schedule based on resource assignments

A computer system for creating an assignment-oriented schedule, comprising:

• a processing unit;
• a memory storage device;
• an input device coupled to said processing unit for receiving information;
• a pixel-based display device coupled to said processing unit for displaying data;
• and
• a program module, stored in the memory storage device, for providing instructions to the processing unit,
• the processing unit, responsive to the instructions of the program module, operative for:
• a. receiving, from the input device, input information comprising:
• a resource calendar which identifies resources available for scheduling, available time-slots for each of the resources, and an earliest start date for each of the resources, and
• a task list which identifies tasks to be performed, each of the tasks having task constraints, a priority-order which is a function of the task constraints, and a predecessor count, the task constraints comprising a list of assigned resources for each of the tasks, a work-amount for each of the assigned resources, and at least one scheduling constraint;
• b. generating assignments for each of the tasks, each of the assignments identifying a specific assigned resource, a specific work-amount, and a parent task;
• c. scheduling each of the assignments that have a parent task with a start-on scheduling constraint into a time-slot of the resource calendar for its specific assigned resource, the time-slot corresponding with the start-on scheduling constraint;
• d. scheduling each of the assignments not previously scheduled by:
• 1. selecting a first resource from the resources as a current resource,
• 2. if at least one unscheduled assignment exists which identifies the current resource as the specific assigned resource, has a parent task with a predecessor count equal to zero, and has a priority-order greater than all other unscheduled assignments which identify the current resource as the specific assigned resource and have a parent task with a predecessor count greater than zero:
• selecting a current assignment from the unscheduled assignments which identifies a parent task having a predecessor count equal to zero and a highest priority-order,
• calculating a current end date based on all of the assignments that have been scheduled and the current assignment,
• scheduling each of the assignments not previously scheduled, which identify the current resource as the specific assigned resource, identify a parent task having a must-finish-by scheduling constraint that is earlier than the current end date, and identify a parent task with a predecessor count equal to zero, in the first available time-slot for the current resource,
• scheduling the current assignment in the first available time-slot for the current resource, and
• if all of the assignments identifying a common parent task have been scheduled, decrementing the predecessor counts for each of the plurality of tasks which have a dependency constraint identifying the common parent task as a predecessor task, and repeating step d2, and
• 3. if any of the assignments have not been scheduled, selecting a next resource from the plurality of resources as the current resource and repeating steps d2 and d3.

A computer-readable medium having computer-executable instructions for performing a method for generating a schedule for a plurality of unscheduled assignments, each of the unscheduled assignments identifying at least one of a plurality of resources, a work-amount, a priority-order, one of a plurality of parent tasks, and a predecessor count indicating a number of predecessor tasks upon which the assignment depends, each of the resources having a resource calendar identifying available time-slots for the resource and each of the plurality of parent tasks having at least one scheduling constraint, the method comprising the steps of:

• a. selecting a current resource from the plurality of resources;
• b. selecting a current assignment from the plurality of unscheduled assignments, the current assignment identifying the current resource, identifying a parent task having a start-on scheduling constraint, and having a highest priority-order;
• c. scheduling the current assignment in the first available time-slot of the resource calendar for the current resource;
• d. identifying the current assignment as scheduled and repeating steps b-d if additional unscheduled assignments identifying the current resource are remaining;
• e. if additional unscheduled assignments which identify a parent task having a start-on scheduling constraint exist, selecting a next current resource and repeating steps a-e with the next current resource;
• and
• f. scheduling each of the remaining unscheduled assignments by:
• 1. selecting a next resource from the plurality of resources as the current resource,
• 2. if at least one qualifying unscheduled assignment exists, the qualifying unscheduled assignments identifying the current resource, having a predecessor count equal to zero, and having a priority-order greater than any other unscheduled assignments which identify the current resource and have a predecessor count greater than zero:
• selecting a qualifying unscheduled assignment with a greatest priority-order as the current assignment,
• calculating a current end date based on all of the assignments that have been scheduled and the current assignment,
• if any unscheduled assignments exist which identify the current resource and identify a parent task having a must-finish-by scheduling constraint that is earlier than the current end date, scheduling each such assignment into the first available time-slot for the current resource, otherwise, scheduling the current assignment in the first available time-slot for the current resource,
• if all of the assignments identifying a common parent task have been scheduled, decrementing the predecessor counts for each of the plurality of assignments which have a dependency scheduling constraint identifying the common parent task as a predecessor task, and repeating step f2, and
• 3. if additional unscheduled assignments exists, selecting a next resource from the plurality of resources as the current resource and repeating steps f2 and f3.