Resource-constrained project scheduling by simulated annealing |
| |
Authors: | F F BOCTOR |
| |
Affiliation: | Centre de Service, d'Orientation et de Recherche sur la Compétitivité Internationale et I'Ingénierie de I'Entreprise-Réseau , Université Laval , Québec , CIK 7P4 , Canada |
| |
Abstract: | This paper presents a new adaptation of the simulated annealing algorithm for solving non-preemptive resource-constrained project scheduling problems in which resources are limited but renewable from period to period. This algorithm is able to handle single-mode and multi-mode problems and to optimize different objective functions. Statistical experiments show the efficiency of the proposed algorithm even in comparison to some Tabu search heuristics. |
| |
Keywords: | |
|
|