Patent ID: 8458004

Claim:
A computer implemented method comprising: utilizing a processor to execute computer code configured to perform the steps of: receiving input for a task comprising two or more atomic tasks; assimilating an atomic task for execution; inputting constraints on performing the task; wherein the input constraints comprise an initial time-based estimate for completion of the task; wherein the initial time-based estimate for completion of the task relates to hypothetical execution of the task by a single resource; assessing available capacities among a pool of resources; assimilating historical information on execution of atomic tasks; determining an adjustment factor based on the assimilated historical information; wherein said determining of an adjustment factor comprises determining a multiplier; wherein said determining of a multiplier comprises determining a multiplier as a function of a prospective resource to be assigned to each atomic task for two non-contiguous time periods; and generating a plan for the assimilated atomic task, said generating comprising: assimilating the input constraints, the assessed available capacities of the pool of resources and the adjustment factor; assigning the task to two or more resources; determining an aggregated time-based target for completion of the task, the aggregated time-based target comprising individual time-based targets for completion for each of the two or more resources; wherein said determining of an aggregated time-based target comprises modifying the initial time-based estimate for completion of the task with the multiplier; and outputting the plan.