Page 227 - DCAP304_DCAP515_SOFTWARE_PROJECT_MANAGEMENT
P. 227

Unit 11: Resource Allocation




          Time-Constrained Network - Example (Gray and Larson, 2003)                            Notes

          This next example has several parts. We will discuss each of them in some detail.

                              Figure  11.6:  Time-Constrained Network  Example




















          First, compute the early, late, and slack times for the activities in the network in Figure 11.7,
          assuming a time-constrained network. Which activities are critical? What is the time constrained
          project duration?
               Figure 11.7:  Time-Constrained Network  Example Showing  Early,  Late,  and Slack  Times





















          Now, assume you are a computer using a software that schedules projects by the parallel method
          and the following heuristics. Schedule only one period at a time!

              Minimum slack
              Smallest duration
              Lowest activity identification number

               !

             Caution  Remember to maintain the technical dependencies of the network.










                                           LOVELY PROFESSIONAL UNIVERSITY                                   221
   222   223   224   225   226   227   228   229   230   231   232