Variable neighborhood search for the workload balancing problem in service enterprises

DOI10.1016/j.cor.2013.07.027zbMath1348.90296OpenAlexW2124469920MaRDI QIDQ337226

Thanh-Ha Nguyen, Mike Wright

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.027

zbMATH Keywords

schedulingvariable neighborhood searchmeta-heuristicquadratic integer programmingcapacity management

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• HAS-QAP

Cites Work

• Unnamed Item
• Unnamed Item
• An improved annealing scheme for the QAP
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
• A genetic approach to the quadratic assignment problem
• Variable neighborhood search
• Solving large quadratic assignment problems on computational grids
• Iterated local search for the quadratic assignment problem
• Ant colonies for the quadratic assignment problem
• Tabu Search Applied to the Quadratic Assignment Problem
• The Reactive Tabu Search
• Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Handbook of metaheuristics

This page was built for publication: Variable neighborhood search for the workload balancing problem in service enterprises