A comparison of two metaheuristic algorithms for scheduling problem on a heterogeneous CPU/FPGA architecture with communication delays.
Fadel AbdallahCamel TanougastImed KacemCamille DiouDaniel SingerPublished in: CoDIT (2017)
Keyphrases
- scheduling problem
- communication delays
- np hard
- precedence relations
- processing times
- precedence constraints
- single machine
- control theory
- metaheuristic algorithms
- tabu search
- flowshop
- setup times
- execution times
- linear programming
- multithreading
- release dates
- parallel machines
- minimum cost
- approximation algorithms
- parallel computing
- multiprocessor systems
- ant colony optimization
- simulated annealing
- computational complexity