Article ID: | iaor19992288 |
Country: | Netherlands |
Volume: | 107 |
Issue: | 2 |
Start Page Number: | 315 |
End Page Number: | 324 |
Publication Date: | Jun 1998 |
Journal: | European Journal of Operational Research |
Authors: | Jaszkiewicz Andrzej, Hapke Maciej, Slowiski Roman |
Keywords: | allocation: resources, optimization: simulated annealing, programming: multiple criteria |
The paper considers an interactive search over a non-dominated solution space of a multiple-criteria project scheduling problem. The approach described handles quite a general class of non-preemptive project scheduling problems with renewable, non-renewable and doubly constrained resources, multiple performing modes of activities, precedence constraints in the form of an activity network and multiple project performance criteria of time and cost type. The approach consists of two stages. In the first stage, a large representative sample of approximately non-dominated schedules is generated by the Pareto Simulated Annealing metaheuristic method. Then, in the second stage, an interative search over the sample is organized by the ‘Light Beam Search’ procedure in its discrete version.