A variable neighborhood search algorithm for the constrained task allocation problem
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/312
Tipus de documentReport de recerca
Data publicació2006-01
Condicions d'accésAccés obert
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 2.5 Espanya
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
Forma partIOC-DT-P; 2006-5
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
Amaia - Potts.pdf | 169,1Kb | Visualitza/Obre |