6 8 4 7 11 8 12 1 0 – 7 9 5 10 15 10 15 0 0 – 8 9 3 11 14 12 15 1 1 – 9 10 4 15 19 15 19 0 0 – Finish Activity Duration Earliest (i (Dij) EarliestEi LatestLi LatestLj Total Free j) – Ej (8) (5) (7) = Ej – Ei (6)= (4) (1) (2) (3) = (3) + = (4) of (4) + (2) (2) (3) successive – activity 1 2 2 0 4 2 6 4 0 – 1 3 2 0 0 2 2 0 0 – 1 4 2 0 4 2 6 4 0 – 2 5 4 2 6 6 10 4 0 – 3 6 5 2 3 7 8 1 0 – 3 7 8 2 2 10 10 0 0 – 4 7 4 2 6 6 10 4 4 – 5 8 2 6 10 8 12 4 3 – 6 8 4 7 8 11 12 1 0 – 7 9 5 10 10 15 15 0 0 – 8 9 3 11 12 14 15 1 1 – 9 10 4 15 15 19 19 0 0 – The method discussed earlier is easily adoptable on computers. In the case of small networks, we can perform most of the calculations right on the diagram. In an event that a person would like to use tableau format to find floats, etc, such methods are also available. Table above summarizes float times and other information. 2. JOB SEQUENCING Definition of Job Sequencing Suppose are jobs (1, 2, . . ., n), each of which has to be processed one at a time at each of m machines A, B, C , . . . The order of processing each job through machines is given. The time that each job must require on each machine is known. The problem
6 – 8 7 – 9 8 – 9 9 – 10 4 5 3 4 7 10 11 15 11 15 14 19 8 10 12 15 12 15 15 19 1 0 1 0 0 0 1 0 Activity (i – j) Duration (Dij) Finish EarliestEi LatestLi Earliest Ej LatestLj Total Free (1) (2) (3) (4) (5) = (3) + (2) (6)= (4) + (2) (7) = (4) – (3) (8) = Ej – Ei of successive activity 1 – 2 1 – 3 1 – 4 2 – 5 3 – 6 3 – 7 4 – 7 5 – 8 6 – 8 7 – 9 8 – 9 9 – 10 2 2 2 4 5 8 4 2 4 5 3 4 0 0 0 2 2 2 2 6 7 10 11 15 4 0 4 6 3 2 6 10 8 10 12 15 2 2 2 6 7 10 6 8 11 15 14 19 6 2 6 10 8 10 10 12 12 15 15 19 4 0 4 4 1 0 4 4 1 0 1 0 0 0 0 0 0 0 4 3 0 0 1 0 The method discussed earlier is easily adoptable on computers. In the case of small networks, we can perform most of the calculations right on the diagram. In an event that a person would like to use tableau format to find floats, etc, such methods are also available. Table above summarizes float times and other information. 2. JOB SEQUENCING Definition of Job Sequencing Suppose are jobs (1, 2, . . ., n), each of which has to be processed one at a time at each of m machines A, B, C , . . . The order of processing each job through machines is given. The time that each job must require on each machine is known. The problem
OR%20Unit-4%202015-2016.docx