J
JJ
Has anyone heard of Concurrency Warnings or Concurrency Failures?
My understanding of them is the following:
* CONCURRENCY WARNINGS are when the lead between is predecessor and
successor is more than 50% of the duration of the predecessor.
EXAMPLE: Task A has a duration of 20d. Task B has a duration of 10d.
Task A is the predecessor to Task B. Task B is linked to Task A with a
FS-15d. Since the 50% of Task A's duration (10d) is less than the lead
time (15d), this would be considered a concurrency warning.
* CONCURRENCY FAILURES are when the lead between a predecessor and
successor is greater than the duration of the predecessor. This would
cause the successor to start before the predecessor.
EXAMPLE: Task A has a duration of 10d. Task B has a duration of 10d.
Task A is the predecessor to Task B. Task B is linked to Task A with a
FS-15d. Since Task A's duration (10d) is less than the lead time
(15d), this would be considered a concurrency failure.
My questions are:
1) Are these correct definitions?
2) Does anyone have a macro to find these problems?
My understanding of them is the following:
* CONCURRENCY WARNINGS are when the lead between is predecessor and
successor is more than 50% of the duration of the predecessor.
EXAMPLE: Task A has a duration of 20d. Task B has a duration of 10d.
Task A is the predecessor to Task B. Task B is linked to Task A with a
FS-15d. Since the 50% of Task A's duration (10d) is less than the lead
time (15d), this would be considered a concurrency warning.
* CONCURRENCY FAILURES are when the lead between a predecessor and
successor is greater than the duration of the predecessor. This would
cause the successor to start before the predecessor.
EXAMPLE: Task A has a duration of 10d. Task B has a duration of 10d.
Task A is the predecessor to Task B. Task B is linked to Task A with a
FS-15d. Since Task A's duration (10d) is less than the lead time
(15d), this would be considered a concurrency failure.
My questions are:
1) Are these correct definitions?
2) Does anyone have a macro to find these problems?