The minimum dummy task problem
Jeremy Spinrad · Networks · 1986
Abstract The minimum dummy task problem for PERT networks is NP‐complete on arbitrary graphs. This paper presents a very simple heuristic algorithm for the minimum dummy task problem and proves that this algorithm finds an optimal PERT network for various classes of graphs, including interval orders, two‐dimensional partial orders, and seriesparallel partial orders.