Please use this identifier to cite or link to this item:

TitleConcurrency detection on finish-to-start activity precedence networks
Author(s)Moutinho, Rui
Tereso, Anabela Pereira
KeywordsProject Scheduling
Finish-to-Start Precedence Relations
Maximal Clique
Issue date2015
PublisherSpringer Verlag
JournalAdvances in Intelligent Systems and Computing
CitationMoutinho, R., & Tereso, A. (2015). Concurrency Detection on Finish-to-Start Activity Precedence Networks. In New Contributions in Information Systems and Technologies (pp. 23-31). Springer International Publishing.
Abstract(s)We explore the finish-to-start precedence relations of project activities used in scheduling problems. From these relations, we devise a method to identify groups of activities that could execute concurrently, i.e. activities in the same group can all execute in parallel. The method derives a new set of relations to describe the concurrency. Then, it is represented by an undirected graph and the maximal cliques problem identifies the groups. We provide a running example with a project from our previous studies in resource constrained project cost minimization together with an example application on the concurrency detection method: the evaluation of the resource stress.
TypeConference paper
Publisher version
AccessOpen access
Appears in Collections:CAlg - Livros e capítulos de livros/Books and book chapters
CGIT - Livros e capítulos de livros / Books and book chapters

Files in This Item:
File Description SizeFormat 
WorldCIST'15.pdf282,44 kBAdobe PDFView/Open

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID