If this is my planning tree:
- release 0.1 - [dateStart], [dateEnd], [iterationDays];
- iteration 1 [iterationSequence] (int i; i in {0,1,...n})
- storyA;
- storyB;
- ...;
- iteration 2;
- ...;
- iteration 1 [iterationSequence] (int i; i in {0,1,...n})
- release 0.2;
- ...;
then, this should provide sufficient data for iterations to calculate their own starts and ends:
- iterationStart = release.dateStart + release.iterationDays * iterationSequence; and
- iterationEnd = release.dateStart + release.iterationDays * (iterationSequence + 1).
Correct me if I am wrong, but it does not look like I can do this in Mingle because parent properties are invisible to descendants?
If so, is there any other way with which I may be unfamiliar in which this can be done?
Best regards,
Wil
(P.S. These are the best forum tools I've seen anywhere, btw.)
Comments
0 comments
Please sign in to leave a comment.