Project Management Using Topological Sorting
Keywords:
Project management, Directed Acyclic Graph (DAG), topological sortingAbstract
Project management is a complex process involving planning, coordinating, and managing resources to accomplish certain goals within specified time frames. Topological sorting is a method used in graph theory to arrange nodes in a Directed Acyclic Graph (DAG) in order of their dependencies. This method can be used to determine the order in which tasks must be accomplished in order to successfully complete the project. Topological sorting helps identify the critical path of a project, prioritize tasks, manage resources, and optimize project schedules. This study provides a literature review on project management using topological sorting, highlighting the key insights and scope of this technique across various industries and project types. The findings show that topological sorting is a powerful tool that can be applied to project management for engineering, software development, manufacturing, marketing, and event management projects. Overall, this study highlights the importance of topological sorting in project management and provides insight into practical applications in various industries.
References
Lager B. Dependency Mapping Software for Jira, Project Management Tool. 2020.
Hwang SO, Lee GM. Effect of Akt overexpression on programmed cell death in antibody-producing Chinese hamster ovary cells. J Biotechnol. 2009 Jan 1; 139(1): 89–94.
Kalyanaraman N, Thayumanavan L, Jayalakshmi M. KIR: HLA association with clinical manifestations of HBV infection in Madurai, south India. J Genet. 2016 Mar; 95(1): 13–19.
Marcel N, Perovich D, Spreen G, Granskog M, Divine D, Hendricks, Hamilton, et al.. Overview of the MOSAiC expedition: Snow and sea ice. Elementa: Science of the Anthropocene. 2022; 10(1): 000046.
Yuan H, Hong W, Chao J. Research on Topological Sorting Algorithm Suitable for Project Scheduling. International Journal of Simulation: Systems, Science & Technology (IJSSST). 2016 Mar 15; 17(6): 20.1–20.6.
Frei M, Deb C, Stadler R, Nagy Z, Schlueter A. Wireless sensor network for estimating building performance. Autom Constr. 2020 Mar 1; 111: 103043.
Gunawan I, Ahsan K. Project scheduling improvement using design structure matrix. Int J Proj Organ Manag. 2010 Jan 1; 2(4): 311–27.
Melo D. Topological Sorting. 2012; CS560. Available from: http://www.cs.iit.edu/~cs560/fall_2012/Research_Paper_Topological_sorting/De%20Melo%20Bianca%20-%20Topological%20Sorting.pdf
Li T, Li Y. Constructive backtracking heuristic for hybrid flowshop scheduling with limited waiting times. In 2007 IEEE International Conference on Wireless Communications, Networking and Mobile Computing. 2007 Sep 21; 6671–6674.
Pang C, Wang J, Cheng Y, Zhang H, Li T. Topological sorts on DAGs. Inf Process Lett. 2015 Feb 1; 115(2): 298–301.
Tang J, Chang Y, Aggarwal C, Liu H. A survey of signed network mining in social media. ACM Comput Surv (CSUR). 2016 Aug 17; 49(3): 1–37.
Ali SA, Khan N. Evaluation of morphometric parameters: a remote sensing and GIS based approach. Open Journal of Modern Hydrology (OJMH). 2013; 03(01): 20–27.
Jena RK. Energy efficient task scheduling in cloud environment. Energy Procedia. 2017 Dec 1; 141: 222–227.
Wikipedia Contributors. (2023). Topological sorting. [Online]. Wikipedia. Available from: https://en.wikipedia.org/wiki/Topological_sorting
