A tabu search algorithm for the resource-constrained assignment problem

Efficient algorithms are available to solve the unconstrained assignment problem. However, when resource or budgetary restrictions are imposed, the problem becomes difficult to solve. The authors consider such a resource-constrained assignment problem and present a tabu search heuristic to solve it. Extensive computational results are presented which establish the superiority of the proposed algorithm over the existing algorithms. The present adaptation of tabu search uses strategic oscillation, randomized short-term memory and multiple start as a means of search diversification.