An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-Dimensional Reconfigurable Architectures.
Francesco RedaelliMarco D. SantambrogioSeda Ogrenci MemikPublished in: Int. J. Reconfigurable Comput. (2009)
Keyphrases
- scheduling problem
- inductive logic programming
- multi dimensional
- np hard
- single machine
- tabu search
- graph theory
- graph representation
- processing times
- graph matching
- heterogeneous computing
- setup times
- random walk
- flowshop
- reconfigurable architecture
- minimizing makespan
- permutation flowshop
- interconnection networks
- graph model
- relational learning
- low cost
- business intelligence
- graph partitioning
- weighted graph
- graph structure
- background knowledge
- precedence constraints
- graph embedding
- metaheuristic
- functional units
- bipartite graph