FLOYD-warshall in Scheduling Open Networks. (2016)

• Record Type: Journal Article
• Authors: Vattai, Zoltán A.
• Is Part Of: Procedia engineering. Volume 164(2016)
• Page Start: 106
• Page End: 114
• Publication Date: 2016
• Subjects: Construction Management -- Network Techniques -- Open Networks -- Floyd-Warshall -- Scheduling.; Engineering -- Congresses; Engineering -- Periodicals; Engineering; Conference proceedings; Periodicals; 620.005
• DOI: 10.1016/j.proeng.2016.11.598
• Languages: English
• ISSNs: 1877-7058

Abstract

Abstract: 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.