A Novel Algorithm for Critical Paths

Author

Li, TianZhi

Author_Institution

Dept. of Comput. Sci. & Technol., Dezhou Univ., Dezhou, China

Volume

1

fYear

2009

fDate

March 31 2009-April 2 2009

Firstpage

226

Lastpage

229

Abstract

The problem of finding all the critical paths is a mathematics based algorithm for scheduling a set of project activities. A new algorithm to find all the critical paths for an AOE network is presented in this paper. With this algorithm, topological inverted sequence scanning is not required again. A predecessors list is designed for each event node to record the earliest starting time and itpsilas predecessors in the longest path. The data structure used in this algorithm is more simple and it can be realized more easily. The running time of this algorithm is O(n+e).

Keywords

computational complexity; critical path analysis; data structures; network theory (graphs); project management; activity on edge network; critical path analysis; data structure; predecessor list; project activity scheduling; project management; Acceleration; Computer science; Data structures; Delay; Mathematics; Network topology; Path planning; Processor scheduling; Scheduling algorithm; Testing; AOE Networks; adjacency list; critical path; predecessors list; topological sort;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Science and Information Engineering, 2009 WRI World Congress on

Conference_Location

Los Angeles, CA

Print_ISBN

978-0-7695-3507-4

Type

conf

DOI

10.1109/CSIE.2009.310

Filename

5171167