A variable neighbourhood search algorithm for the constrained task allocation problem
A Variable Neighborhood 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 th...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2008 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/6085 |
| Acceso en línea: | https://hdl.handle.net/2117/6085 |
| Access Level: | acceso abierto |
| Palabra clave: | Task analysis Task allocation problem Variable neighbourhood search Local search Heuristics Heurística Assignació de tasques Cerca en entorns variables Búsqueda en entornos variables Búsqueda local Cerca local Jornada anualizada Jornada anualitzada Asignación de tareas Organització del treball Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions::Anàlisi de processos de negoci i de fabricació |
| Sumario: | A Variable Neighborhood 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. |
|---|