Solving the task assignment problem with a variable neighborhood search

zbMATH Open1229.65099MaRDI QIDQ3172378FDOQ3172378

Authors: Jozef Kratica, Aleksandar Savić, V. Filipovic, Marija Milanović 

Publication date: 5 October 2011

Full work available at URL: https://eudml.org/doc/11398

Recommendations

• A variable neighbourhood search algorithm for the constrained task allocation problem
• Variable Neighborhood Search
• VNS for scheduling independent tasks to identical processors
• Very large-scale variable neighborhood search for the generalized assignment problem
• Variable neighborhood search for solving the balanced location problem

zbMATH Keywords

combinatorial optimizationnumerical examplesassignment problemvariable neighborhood searchtask assignmentmultiprocessor systems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27)

Cited In (5)

• VNS for scheduling independent tasks to identical processors
• Variable neighborhood search for the workload balancing problem in service enterprises
• A variable neighbourhood search algorithm for the constrained task allocation problem
• A parallel variable neighborhood search for solving covering salesman problem
• A variable neighborhood MOEA/D for multiobjective test task scheduling problem

Uses Software

• CPLEX

This page was built for publication: Solving the task assignment problem with a variable neighborhood search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172378)