کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5029461 1470662 2016 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
FLOYD-warshall in Scheduling Open Networks
موضوعات مرتبط
مهندسی و علوم پایه سایر رشته های مهندسی مهندسی (عمومی)
پیش نمایش صفحه اول مقاله
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(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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Procedia Engineering - Volume 164, 2016, Pages 106-114
نویسندگان
,