Transcription of Example Problems - websites.umich.edu
{{id}} {{{paragraph}}}
Example: dental hygienist
Example Problems - websites.umich.edu
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.
ZERO FREE FLOAT If there is only one link goes into a node, its FF = 0”. FF of activity C = 0 If there are many links go into the same node, at least one of them must have FF = 0. FF of activity X = 0 MS2. SAME INTERFERE FLOAT All the links that go into the same node have the same INTF. According to MS1, FF of X = 0. Thus, INTF of X = 5.
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: