The longest path through a network diagram, considering both task dependencies and resource dependencies.

Match each of the key terms with the definition that best fits it.

A. Activity resource requirements B. Alternatives analysis C. Analogous estimating D. Bottom-up estimating E. Capital resources F. Control Schedule G. Crashing H. Critical activity I. Critical chain J. Critical chain method K. Develop Schedule L. Duration M. Effort N. Estimate Activity Durations O. Expert judgment P. Fast tracking Q. Free float R. Human resources S. Imposed dates T. Opportunity cost U. Parametric estimating V. PERT W. Published estimating data X. Reserve analysis Y. Resource Z. Resource breakdown structure AA. Resource calendar BB. Resource leveling CC. Resource leveling heuristics DD. Schedule baseline EE. Schedule compression techniques FF. Schedule model GG. Schedule network analysis HH. Simulation II. Three-point estimates JJ. Total float KK. What-if analyses