The Critical Path Method (sometimes referred as CPM, confusing in many domains) is a methodology for scheduling project activities. It identifies the longest stretch of dependent tasks (the ‘critical path’) and measures the time required to complete them from start to finish. Any delay in a task on the critical path directly impacts the project’s completion date -targeted parameter here is date, not cost, nor quality, nor resources, although none of these are independent-. It helps consequently in resource allocation and schedule optimization. Like the applications of travelling salesman problem in delivery planning, critical path scheduling is about finding the best order of tasks. Traveling salesman problem applications and critical path planning both look for the best sequence. Critical path planning belongs to operations research, the field in which George Dantzig developed the simplex method.

















