Carregant...
Carregant...

Vés al contingut (premeu Retorn)

A variable neighbourhood search algorithm for the constrained task allocation problem

Autor
Lusa, A.; Potts, C.N.
Tipus d'activitat
Article en revista
Revista
Journal of the Operational Research Society
Data de publicació
2008-06
Volum
59
Número
6
Pàgina inicial
812
Pàgina final
822
DOI
https://doi.org/10.1057/palgrave.jors.2602413 Obrir en finestra nova
URL
https://link.springer.com/article/10.1057/palgrave.jors.2602413 Obrir en finestra nova
Resum
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 computati...
Paraules clau
local search, task allocation problem, variable neighbourhood search
Grup de recerca
SCOM - Supply Chain and Operations Management

Participants