1 / 12

Scheduling Computations for Precedence Networks

Scheduling Computations for Precedence Networks. Tabular Format (Precedence Diagram). Can be carried out on the tabular form without reference to the diagram. Advantage: the time required to construct the diagram is eliminated. Link Lag.

marlo
Download Presentation

Scheduling Computations for Precedence Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Scheduling ComputationsforPrecedence Networks

  2. Tabular Format (Precedence Diagram) • Can be carried out on the tabular form without reference to the diagram. • Advantage: the time required to construct the diagram is eliminated. DR. Nabil Dmaidi

  3. Link Lag A link lag is the difference between the early start date of an activity and the early finish date of the preceding activity LAGij = ESDj - EFDi DR. Nabil Dmaidi

  4. Determining log Examples: LAG 5-10 = ESD 10 - EFD 5 = 4 - 4 = 0 LAG 15-25 = ESD 25 - EFD 15 = 12 - 7 = 5 LAG 20-25 = ESD 25 - EFD 20 = 12 - 6 = 6 DR. Nabil Dmaidi

  5. Determining the Free-Float • Free Float is the minimum of the log of the link that follows an activity. • Look at the “Pre. column” to find the same number value of EF for terminal activity “not following act.” FFi = Minj- LAG ij FF 35 = LFD 35 - EFD 35 = 20 - 20 = 0 DR. Nabil Dmaidi

  6. Determining the Total Float “Backward” TF i = Min (log ij + TF j ) • Take TF of the terminal activity = 0 or TF 35 = LFD 35 - EFD 35 = 20 - 20 = 0 DR. Nabil Dmaidi

  7. Determining the Total Float “Backward” (cont.) TF 30 = Min (log 30-35 + TF 35 ) = Min ( 7 + 0 ) = 7 No other link TF 20 = Min LAG20-25 + TF 25 = Min 6+0 = 6 LAG20-30 + TF 30 1+7 { { } } DR. Nabil Dmaidi

  8. INTF Float • INTF = TF - FF DR. Nabil Dmaidi

  9. If the free float is zero - no INDF INDF j = FF j - Max _ I ( TF I - LAGIJ ) INDF 20 = FF 20 - Max ( TF 5 - LAG5-20 ) = 1- (0 -0 )=1 INDF 30 = FF 30 – Max TF 15 - LAG15-30 TF 20 - LAG20-30 = 7 - 5 - 0 = 2 6 - 1 { } { } DR. Nabil Dmaidi

  10. Float Determination -Sample Precedence Network DR. Nabil Dmaidi

  11. Late Date Determination -Sample Precedence Network DR. Nabil Dmaidi

  12. Lag Determination -Sample Precedence Network DR. Nabil Dmaidi

More Related