Solve the critical path problem by the shortest path method

Shu Xing · Journal of Guangxi University · 2002

The critical path problem is transformed to the shortest path problem according to the time limit for a project being the summation of the critical path.And the critical path problem is solved successfully by the shortest path procedure in software of SAS/OR/netflow.

Read the paper · More papers on PaperTik