Premium
Minimizing the complexity of an activity network
Author(s) -
Kamburowski Jerzy,
Michael David J.,
Stallmann Matthias F.M.
Publication year - 2000
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co;2-q
Subject(s) - arc (geometry) , computer science , class (philosophy) , computational complexity theory , time complexity , mathematical optimization , mathematics , algorithm , artificial intelligence , geometry
When an activity‐on‐arc (AoA) project network is to be constructed, one typically seeks to minimize the number of dummy arcs. Recent investigations have shown, however, that the computational effort of many network‐oriented project management techniques depends strongly on the so‐called complexity index ( CI ) of a network. We show other justifications for minimizing the CI rather than the number of dummy arcs. We also present a polynomial time algorithm for constructing an AoA network with the minimum CI in the class of all AoA networks having the minimum number of nodes. © 2000 John Wiley & Sons, Inc.