Jump to content

Talk:Critical path method

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Pkurtross (talk | contribs) at 19:28, 14 May 2007 (I disagree). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconBusiness Unassessed
WikiProject iconThis article is within the scope of WikiProject Business, a collaborative effort to improve the coverage of business articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
???This article has not yet received a rating on Wikipedia's content assessment scale.
???This article has not yet received a rating on the project's importance scale.

131.110.83.17 16:42, 4 January 2007 (UTC)The statement critical path has no float is not correct. Critical path is defined as "the longest path through the network with the least amount of float. The critical path can contain float. But, it contains the least amount of float.[reply]

I disagree

A better definition of critical path is: the longest path of interdependent activities in a schedule network, whereby if any activity on the critical path is delayed by a certain duration, the project completion will be delayed by the same duration.

The critical path will be the path with the least amount of float, but many experts believe the critical path of a schedule should have no float. While it is possible for a critical path to have float, such float is most likely the result of a project completion constraint (i.e., a "Must Finish" constraint) in the scheduling software, which will give a project that is ahead of schedule postitive float and a project that is behind schedule negative float.