A variable neighbourhood search algorithm for the constrained task allocation problem
From MaRDI portal
Recommendations
- Solving the task assignment problem with a variable neighborhood search
- A variable depth search algorithm with branching search for the generalized assignment problem
- scientific article; zbMATH DE number 2047436
- VNS for scheduling independent tasks to identical processors
- A Tabu Search Algorithm for the Resource-Constrained Assignment Problem
Cited in
(14)- Variable neighbourhood search: Methods and applications
- A new variable neighborhood search approach for solving dynamic memory allocation problem
- Variable neighbourhood search: methods and applications
- An adaptive variable neighborhood search for solving the multi-objective node placement problem
- Variable neighbourhood structures for cycle location problems
- Variable neighborhood search for the workload balancing problem in service enterprises
- Data-mining-driven neighborhood search
- A black-box scatter search for optimization problems with integer variables
- A variable neighborhood search algorithm for human resource selection and optimization problem in the home appliance manufacturing industry
- scientific article; zbMATH DE number 2047436 (Why is no real title available?)
- A hybrid heuristic to solve a task allocation problem
- Solving the task assignment problem with a variable neighborhood search
- Task scheduling using two-phase variable neighborhood search algorithm on heterogeneous computing and grid environments
- A variable neighborhood MOEA/D for multiobjective test task scheduling problem
This page was built for publication: A variable neighbourhood search algorithm for the constrained task allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387420)
