Article ID: | iaor2000784 |
Country: | Netherlands |
Volume: | 111 |
Issue: | 1 |
Start Page Number: | 129 |
End Page Number: | 141 |
Publication Date: | Nov 1998 |
Journal: | European Journal of Operational Research |
Authors: | Gemmill Douglas D., Tsai Ying-Wei |
Keywords: | scheduling |
In this paper, a higher level heuristic procedure ‘tabu search’ is proposed to provide good solutions to resource-constrained, randomized activity duration project scheduling problems. Our adaptation of tabu search uses multiple tabu lists, randomized short-term memory, and multiple starting schedules as a means of search diversification. The proposed method proves to be an efficient way to find good solutions to both deterministic and stochastic problems. For the deterministic problems, most of the optimal schedules of the test projects investigated are found. Computational results are presented which establish the superiority of tabu search over the existing heuristic algorithms.