Using tabu search to schedule activities of stochastic resource-constrained projects |
| |
| Institution: | 1. Department of Mathematics and Computer Science, University of Marburg, 35032 Marburg, Germany;2. Department of Computer Science, Paderborn University, 33098 Paderborn, Germany;3. Department of Business Administration and Economics, University of Gießen, 35394 Gießen, Germany;4. WHU–Otto Beisheim School of Management, 56179 Vallendar, Germany;1. Department of Computing, DECOM, Universidade Federal de Ouro Preto, Brazil;2. Department of Computing and Systems, DECSI, Universidade Federal de Ouro Preto, Brazil;3. Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation, CIRRELT, Canada;4. Computer Science Department, CODeS, KU Leuven, Belgium;5. Department of Computer Science and Operations Research, Université de Montréal, Canada;6. Department of Management and Technology, École des Sciences de la Gestion, Université de Québec à Montréal, Canada |
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
