SIMULATED ANNEALING ALGORITHM FOR OPTIMIZING MULTI-PROJECT LINEAR SCHEDULING WITH MULTIPLE RESOURCE CONSTRAINTS

摘要

This paper integrates multi-project scheduling and linear scheduling concepts. Since the problem is combinatorial, a two-stage heuristic solution-finding procedure is used to model the problem with multiple resource constraints. Simulated annealing is utilized as a searching engine in the second stage to find the probable optimized solution. The first stage is slightly different from the other two-stage solution finding procedures which are proposed till now. A numerical example of a multi-project situation is given and solved as well.