Given a finite partially ordered set (poset), the elements of which are called tasks, it is a hard problem to construct its optimal PERT network, the one with the smallest number of dummy tasks. In this paper it is presented a method for constructing the optimal arrow diagram for a type of posets which are W free or M free with height 2. It is also shown that: if a poset P is W free and M free, then the optimal arrow diagram of P is unique, which can be constructed in a polynomial time.
Zhen Wei WEN. , {{custom_author.name_en}}.
The Judgement and Uniqueness of Optimal Arrow Diagram. Systems Engineering - Theory & Practice, 1999, 19(3): 1-12 https://doi.org/10.12011/1000-6788(1999)3-1