An analysis of parallel heuristics for task allocation in multicomputers

DOI10.1007/BF02684444zbMath0894.90124OpenAlexW2063026744MaRDI QIDQ1377284

I. De Falco, E. Tarantino, R. Del Balio

Publication date: 4 February 1998

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02684444

zbMATH Keywords

simulated annealinggenetic algorithmsheuristic

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (3)

Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Communication contention in APN list scheduling algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A parallel simulated annealing algorithm
• An improved annealing scheme for the QAP
• The parallel genetic algorithm as function optimizer
• Tabu Search—Part I
• Tabu Search—Part II

This page was built for publication: An analysis of parallel heuristics for task allocation in multicomputers