1. Vanhoucke, M. (2012). Project Management with Dynamic Scheduling: Baseline Scheduling, Risk Analysis and Project Control. Springer Science & Business Media. In Chapter 2, "The Critical Path Method," it is stated: "The critical path is the longest path from the unique start node to the unique end node of the network and its length is equal to the minimal project duration." (p. 19).
2. Liberatore, M. J., & Pollack-Johnson, B. (2013). "Improving project management decision making by modeling quality." IEEE Transactions on Engineering Management, 60(3), 547-557. The paper defines the critical path as "the longest duration path of activities through the project network, which determines the minimum project completion time." (Section II.A, para. 1). DOI: https://doi.org/10.1109/TEM.2012.2221993
3. Eppinger, S. D., & Browning, T. R. (2012). Design Structure Matrix Methods and Applications. MIT Press. In the context of project scheduling, the text explains: "The longest path of dependent tasks through the network is called the critical path because it determines the total time required to complete the project." (Chapter 7, p. 158).
4. MIT OpenCourseWare. (2005). 1.040 Project Management, Lecture 6: Project Scheduling: PERT/CPM. Massachusetts Institute of Technology. The lecture notes state: "The critical path is the longest path through the network. The length of the critical path is the project duration." (Section: The Critical Path Method (CPM), Slide 11).