FLOYD-warshall in Scheduling Open Networks

After introducing main principles of transitive closure of graphs the paper discusses application of a modified Floyd-Warshall algorithm to calculate network time models of projects with no concern on whether the graph has one or more starting and/or ending node(s), whether it includes logical loop(...

Full description

Saved in:
Bibliographic Details
Published inProcedia engineering Vol. 164; pp. 106 - 114
Main Author Vattai, Zoltán A.
Format Journal Article
LanguageEnglish
Published Elsevier Ltd 2016
Subjects
Construction Management
Floyd-Warshall
Network Techniques
Open Networks
Scheduling
Open Networks
Network Techniques
Scheduling
Construction Management
Floyd-Warshall
Online AccessGet full text
ISSN1877-7058
1877-7058
DOI10.1016/j.proeng.2016.11.598

Cover

More Information
Summary:After introducing main principles of transitive closure of graphs the paper discusses application of a modified Floyd-Warshall algorithm to calculate network time models of projects with no concern on whether the graph has one or more starting and/or ending node(s), whether it includes logical loop(s) or not, whether it is a connected model or not, whether it necessitates positive (lower bound) or negative (upper bound) or multiple restrictions amongst the time data of the project elements or not – that is: to schedule open networks. The method may contribute to generalization of network time models especially when considered in multi-project management context.
ISSN:1877-7058
1877-7058
DOI:10.1016/j.proeng.2016.11.598