What people are saying - Write a review
We haven't found any reviews in the usual places.
one Graphs and Sequencing
Strict relation in a connected graph without circuit
Decomposition into levels of a connected graph without circuit
22 other sections not shown
Other editions - View all
accelerate assume central limit theorem column conjunctive paths connected graph construction corresponding critical jobs critical path method curve OA date 63 date limit date of realization date tt dates of events decision event delay disjunctive display process distribution duration of job dynamic programming equation estimate expected value final event floating forebear free margin Fulkerson algorithm function graph of figure graph without circuit job PtJ job Pu Kaufmann matrix mean date mean value minimal moving to phase noncritical jobs operations operations research optimal program optimal solutions paragraph parametric linear program permits PERT method possible terminal events probability of realization problem program graph program linear graph realization date relative entropy representation represented schedule sequence set of activities set of arcs shown subactivities tasks and constraints tion total cost total execution period total margin transitive closure variance