Ap. Punnen et Yp. Aneja, A TABU SEARCH ALGORITHM FOR THE RESOURCE-CONSTRAINED ASSIGNMENT PROBLEM, The Journal of the Operational Research Society, 46(2), 1995, pp. 214-220
Citations number
18
Categorie Soggetti
Management,"Operatione Research & Management Science","Operatione Research & Management Science
Efficient algorithms are available to solve the unconstrained assignme
nt problem. However, when resource or budgetary restrictions are impos
ed, the problem becomes difficult to solve. We consider such a resourc
e-constrained assignment problem and present a tabu search heuristic t
o solve it. Extensive computational results are presented which establ
ish the superiority of the proposed algorithm over the existing algori
thms. Our adaptation of tabu search uses strategic oscillation, random
ized short-term memory and multiple start as a means of search diversi
fication.