Solving the task assignment problem with a variable neighborhood search

MaRDI QIDQ3172378zbMATH OpenFDO

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

Publication date 5 October 2011

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

zbMATH Keywords

assignment problemcombinatorial optimizationmultiprocessor systemsnumerical examplestask assignmentvariable neighborhood search

Mathematics Subject Classification ID

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

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

Cited in

(5)

• A variable neighborhood MOEA/D for multiobjective test task scheduling problem
• A parallel variable neighborhood search for solving covering salesman problem
• 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

Describes a project that uses

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)