A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS

DOI10.1142/S0217595905000492zbMath1078.90042MaRDI QIDQ5315983

A. J. Higgings

Publication date: 12 September 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Heuristicsgeneralized assignmentrandomized search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Optimization by Simulated Annealing
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• A survey of algorithms for the generalized assignment problem
• A robust heuristic for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• Optimizing cane supply decisions within a sugar mill region
• Solving real-life vehicle routing problems efficiently using tabu search
• A branch and bound algorithm for the generalized assignment problem
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• A dynamic tabu search for large-scale generalized assignment problems

This page was built for publication: A PERCENTILE SEARCH HEURISTIC FOR GENERALIZED ASSIGNMENT PROBLEMS WITH A VERY LARGE NUMBER OF JOBS