Lusa, A.; Potts, C. N. A variable neighbourhood search algorithm for the constrained task allocation problem. (English) Zbl 1153.90448 J. Oper. Res. Soc. 59, No. 6, 812-822 (2008). Summary: A variable neighbourhood search algorithm that employs new neighbourhoods is proposed for solving a task allocation problem whose main characteristics are: (i) each task requires a certain amount of resources and each processor has a capacity constraint which limits the total resource of the tasks that are assigned to it; (ii) the cost of solution includes fixed costs when using processors, task assignment costs, and communication costs between tasks assigned to different processors. A computational study shows that the algorithm performs well in terms of time and solution quality relative to other local search procedures that have been proposed. Cited in 6 Documents MSC: 90B40 Search theory Keywords:task allocation problem; variable neighbourhood search; local search PDFBibTeX XMLCite \textit{A. Lusa} and \textit{C. N. Potts}, J. Oper. Res. Soc. 59, No. 6, 812--822 (2008; Zbl 1153.90448) Full Text: DOI Link