A variable neighborhood search algorithm for the constrained task allocation problem

Abstract

A Variable Neighborhood Search algorithm 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 finite capacity to be search between task it is assigned; (ii) the cost of solutions includes fixed cost when using processors, assigning cost and communication cost between task assigned to different processors. A computational experiment shows that the algorithm is satisfactory in terms of time and solution quality