Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bron, C., Kerbosch, J.: Algorithm 457: Finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973), http://doi.acm.org/10.1145/362342.362367
Cazals, F., Karande, C.: A note on the problem of reporting maximal cliques. Theoretical Computer Science 407(1-3), 564–568 (2008), http://www.sciencedirect.com/science/article/pii/S0304397508003903
Chang, L., Yu, J., Qin, L.: Fast maximal cliques enumeration in sparse graphs. Algorithmica 66(1), 173–186 (2013), http://dx.doi.org/10.1007/s00453-012-9632-8
Demeulemeester, E.L., Herroelen, W.S.: Project Scheduling - A Research Handbook. International Series in Operations Research & Management Science, vol. 49. Kluwer Academic Publishers (2002)
Moutinho, R., Tereso, A.: Scheduling of Multimodal Activities with Multiple Renewable and Availability Constrained Resources under Stochastic Conditions. Procedia Technology 16, 1106–1115 (2014)
Pattabiraman, B., Patwary, M. M.A., Gebremedhin, A.H., Liao, W.-k., Choudhary, A.: Fast algorithms for the maximum clique problem on massive sparse graphs. In: Bonato, A., Mitzenmacher, M., Prałat, P. (eds.) WAW 2013. LNCS, vol. 8305, pp. 156–169. Springer, Heidelberg (2013)
Prosser, P.: Exact algorithms for maximum clique: A computational study. Algorithms 5(4), 545–587 (2012)
Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques (Computing and Combinatorics 10th Annual International Conference on Computing and Combinatorics (COCOON 2004)). In: Chwa, K.-Y., Munro, J.I. (eds.) COCOON 2004. LNCS, vol. 3106, pp. 161–170. Springer, Heidelberg (2004), http://www.sciencedirect.com/science/article/pii/S0304397506003586 , doi:10.1016/j.tcs.2006.06.015
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Moutinho, R., Tereso, A. (2015). Concurrency Detection on Finish-to-Start Activity Precedence Networks. In: Rocha, A., Correia, A., Costanzo, S., Reis, L. (eds) New Contributions in Information Systems and Technologies. Advances in Intelligent Systems and Computing, vol 353. Springer, Cham. https://doi.org/10.1007/978-3-319-16486-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-16486-1_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16485-4
Online ISBN: 978-3-319-16486-1
eBook Packages: Computer ScienceComputer Science (R0)