![]() |
|
||||||
Q: Resource Assignment Algorithm
Can you please explain the resource assignment algorithm used in the planning phase to automatically create the planning of an iteration?
Answer:
It is a very basic balancing of resource load. It is not optimal by any means.
The planner goes through the list of planned tasks and assigns a resource with minimum 'current time pointer' but enough
available time, given the deadline, time sharing parameters, and time-off/vacation settings.
Current time pointer is a counter tracked for each resource during project time computation.
There is a Work Hour Pointer (whp) and Calendar Hour Pointer (chp). WHs are pure/ideal work hours
0..N that each resource has between today and project deadline (time-off, weekends exluded, 8hr work day assumed).
And CHs are actual calendar hours corresponding to each ideal WH.
So this algorithm picks a resource with minimum CHP and enough number of WHs to cover the estimate.
Hope this helps.
To see all user comments and participate in the disscussion log into >>Yoxel Support Portal / Knowledge Base<<
For anonymous login click this link