About this Presentation
(Hyde Park) Feeding buffers have been a standard and little-questioned part of the critical chain (CC) approach since the beginning. However, their application in practice can be difficult and confusing. Feeding buffers can create holes in the critical chain; their sizing and analysis is often problematic; and the target for feeding buffer protection – the critical chain – can change in time and makeup, rendering the original feeding buffers irrelevant. Some CC implementers have come up with complicated ways of getting around these problems, adding to the difficulty of the CC approach; others remove feeding buffers entirely, thus removing needed protection. The author argues that by estimating merge bias and determining task gating without using explicit feeding buffers, the buffers themselves can then be eliminated. The resulting schedules are more intuitive, more robust, and easier to analyze than traditional CC schedules.
What Will You Learn
To help you get the most value from this session, we’ve highlighted a few key points. These takeaways capture the main ideas and practical insights from the presentation, making it easier for you to review, reflect, and apply what you’ve learned.
Instructor(s)
