Transcription of Example Problems
{{id}} {{{paragraph}}}
Example: barber
Example Problems
CEE 536 CRITICAL PATH METHODS Example Problems Photios G. Ioannou, PhD, PE Professor of Civil and Environmental Engineering Chachrist Srisuwanrat, Former Graduate Student Instructor University of Michigan Ann Arbor, Michigan 48109-2125 TABLE OF CONTENTS 1. NETWORK CONSTRUCTION---------------------------- ---------------------------------------- 3 ACTIVITY ON ACTIVITY ON 2. ACTIVITY-ON-ARROW SCHEDULING------------------------------ -------------------------13 EVENT MISSING FLOATS ..13 3. ACTIVITY-ON-NODE SCHEDULING------------------------------ ----------------------------32 4. SCHEDULING USING A LINK MATRIX---------------------------------- ---------------------46 5.
CEE536—Example Problems 28 P.G. Ioannou & C. Srisuwanrat 2. 2.1) MS1 (one link goes into one node, FF of the link = 0) FF of A, B, C, and E= 0. So, INTF of A and E = 0 and 4 respectively. MS1 ( many links going to the same node, one of them must have zero FF ) FF of P = 0. Thus, INTF of P = 0. And also FF of R. 0 5 15 10 20 25 30 A B D P U FF ...
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: