Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity

DOI10.1080/0305215x.2021.1940991zbMath1523.90251OpenAlexW3178772541MaRDI QIDQ6048199

No author found.

Publication date: 10 October 2023

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2021.1940991

zbMATH Keywords

generalized assignment problemreal-time decision-makingiterative local searchidentical resource capacityresource-independent task profits

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• A survey on optimization metaheuristics
• An exact method with variable fixing for solving the generalized assignment problem
• A computational study of exact knapsack separation for the generalized assignment problem
• A new Lagrangian relaxation approach to the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• A property of assignment type mixed integer linear programming problems
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A path relinking approach with ejection chains for the generalized assignment problem
• An Ejection Chain Approach for the Generalized Assignment Problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A hybrid algorithm for the generalized assignment problem
• A branch and bound algorithm for the generalized assignment problem
• Principles and Practice of Constraint Programming – CP 2004
• A dynamic tabu search for large-scale generalized assignment problems

This page was built for publication: Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity