A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. (Q1399573)

In the paper simulated annealing algorithms for the resource-constrained project scheduling problem and its multiple mode version minimizing the makespan are presented. They are based on a list representation of schedules and a serial schedule generation scheme. The neighborhoods are defined by shifts of randomly chosen activities and by additional mode changes in the multi-mode case. Computational results are presented for the PSPLIB benchmark instances of \textit{R. Kolisch, A. Sprecher} and \textit{A. Drexl} [Manage. Sci. 41, 1693--1703 (1995; Zbl 0870.90070)] showing the effectiveness of the proposed procedures.