Determining k-possible critical paths using Tawanda's non-iterative optimal tree algorithm for shortest route problems

Autor:	Trust Tawanda
Rok vydání:	2018
Předmět:	Project network Graph expansion Least slack time scheduling Computer science Management Science and Operations Research Project networks Critical path method Algorithm Dijkstra's algorithm Scheduling (computing)
Zdroj:	International Journal of Operational Research. 32:313
ISSN:	1745-7653 1745-7645
Popis:	The critical path method (CPM) is a project modelling algorithm developed in the 1950s for scheduling project activities, it is used to determine the critical path through the calculation of three parameters thus, slack, earliest event, latest event times for each activity. In this paper, we demonstrate how to use Tawanda's non-iterative optimal tree algorithm for shortest route problems (TA) to determine the critical path(s). We have also compared TA with the original critical path method (CPM) and the modified Dijksra's algorithm for critical path method in a project network (MDA). However, the study revealed that TA can compute the critical path more effectively since it is also effective in project networks with k-possible critical paths, moreover, it does not make use of the slack, earliest, and latest time parameters, since these calculations consume more time.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0adba19c2d3d66e6646d9ab88518b8ed https://doi.org/10.1504/ijor.2018.092737 Zobrazit plný text záznamu