Hybrid algorithms for hardware/software partitioning and scheduling on reconfigurable devices

DOI10.1016/j.mcm.2012.11.001zbMath1297.90185OpenAlexW2027465088MaRDI QIDQ462781

J. Herrera, D. Rodríguez-Gómez

Publication date: 21 October 2014

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2012.11.001

zbMATH Keywords

schedulingsimulated annealingtabu searchhybrid algorithmhardware/software partitioning

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Improving simulated annealing with variable neighborhood search to solve the resource-constrained scheduling problem
• Solving the truck and trailer routing problem based on a simulated annealing heuristic
• An experimental evaluation of local search heuristics for graph partitioning
• Comparing three heuristic search methods for functional partitioning in hardware--software codesign
• Application of agent-based simulated annealing and tabu search procedures to solving the data reduction problem
• Tabu Search—Part I
• Tabu Search—Part II
• Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach
• Capacitated clustering problems by hybrid simulated annealing and tabu search