1. Consider the three partial design networks in Figure Al: Product 1 Product 2 Product 3 3 14 12 11 15 17 10 13 2 5 16 Figure Al. Partial design networks for three products The following data is provided: Duration of each activity is the same and equals ti 4.5 hours, i 1, ...,17. The resource requirement of cach activity is the same and cquals rij = 1, i = 1, ..., 17; j-1, ..., 4. Four types of resources are available in the quantity, R= 3, 4, 5, 6] The due dates for each activity equals: current time + activity number [hours), e.g., if the current time is 12 noon, the due date of activity 6 is 6 p.m. The constant K=L=1 The weight wi cqual to the corresponding activity number, c.g., for activity 7, the weight is w7= 7 At 10 am, activities 1, 2, 8, 12 and 13 are about to be completed. (a) List the set of activities eligible for scheduling, () Determine the set of activities to be scheduled, the set of activities to be delayed (if any) by formulating and solving an integer programming model presented in this chapter. c) Determine the set of activities to be scheduled with the scheduling algorithm presented in this chapter. Present all iterations of the algorithm and compare this scheduling result with the result obtained in (b). 1. Consider the three partial design networks in Figure Al: Product 1 Product 2 Product 3 3 14 12 11 15 17 10 13 2 5 16 Figure Al. Partial design networks for three products The following data is provided: Duration of each activity is the same and equals ti 4.5 hours, i 1, ...,17. The resource requirement of cach activity is the same and cquals rij = 1, i = 1, ..., 17; j-1, ..., 4. Four types of resources are available in the quantity, R= 3, 4, 5, 6] The due dates for each activity equals: current time + activity number [hours), e.g., if the current time is 12 noon, the due date of activity 6 is 6 p.m. The constant K=L=1 The weight wi cqual to the corresponding activity number, c.g., for activity 7, the weight is w7= 7 At 10 am, activities 1, 2, 8, 12 and 13 are about to be completed. (a) List the set of activities eligible for scheduling, () Determine the set of activities to be scheduled, the set of activities to be delayed (if any) by formulating and solving an integer programming model presented in this chapter. c) Determine the set of activities to be scheduled with the scheduling algorithm presented in this chapter. Present all iterations of the algorithm and compare this scheduling result with the result obtained in (b)
