Solve Exercise 7.14 (integer programming) using the simulated annealing procedure. Use \(T=60, k=0.8\) and stop when the order does not change in three iterations.

Exercise 7.14

Develop an integer programming model for the resource allocation problem in Figure 7.47, assuming that daily resource availability is 5 units. Use LINDO or any other integer programming software to determine an optimal solution to your model. Discuss the results. Draw the project schedule chart (Gantt chart).

Figure 7.47

Transcribed Image Text:

(5-3) (2-2) (4-2) 2 (duration-daily resource requirement) 3 (2-4) (1-2) 5