Minimizing the complexity of an activity network

Autor:	David J. Michael, Jerzy Kamburowski, Matthias F. Stallmann
Rok vydání:	2000
Předmět:	Project network Class (computer programming) Theoretical computer science Computer Networks and Communications business.industry Complexity index Hardware and Architecture Artificial intelligence Project management business Time complexity Software Information Systems Mathematics
Zdroj:	Networks. 36:47-52
ISSN:	1097-0037 0028-3045
DOI:	10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co;2-q
Popis:	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 Cl rather than the number of dummy arcs. We also present a polynomial time algorithm for constructing an AoA network with the minimum Cl in the class of all AoA networks having the minimum number of nodes.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::6efa816b13b9019a7b6dc404d832c09f https://doi.org/10.1002/1097-0037(200008)36:1<47::aid-net5>3.0.co Zobrazit plný text záznamu Plný text