What people are saying - Write a review
We haven't found any reviews in the usual places.
Modifications and Extensions
Planning and Scheduling Networks
Finding the Critical Path
9 other sections not shown
Other editions - View all
Activity duration algorithm alternative Analysis AON diagram arrow diagram assumption beta distribution budget Chapter constraints cost of crashing Cost-Time Curve CPM and PERT crew critical jobs Critical Path Analysis Critical Path Method delay developed distribution due date dummy jobs early and late early finish early start schedule engineering event event-oriented example expected length free slack heuristic identified immediate predecessor initial node integer Integer Programming JNODE job's late start schedules limited resource linear programming minimum network calculations Network Flow normal normal distribution occur Opns overrun packages PERT and CPM PERT/Cost Planning and Scheduling possible precedence network precedence relationships predecessor relationships probability problem procedure Project Cost project duration project length Project Management project network project scheduling reduced redundant represents result schedule graph shortened slack variable solution standard deviation standard normal table successors techniques tion topological order total slack variables variance