An ILP Formulation for the Task Graph Scheduling Problem Tailored to Bi-dimensional Reconfigurable Architectures.
Francesco RedaelliMarco D. SantambrogioSeda Ogrenci MemikPublished in: ReConFig (2008)
Keyphrases
- scheduling problem
- np hard
- inductive logic programming
- single machine
- graph structure
- low cost
- graph representation
- random walk
- business intelligence
- processing times
- weighted graph
- reconfigurable architecture
- graph model
- graph theory
- background knowledge
- multi dimensional
- flowshop
- heterogeneous computing
- directed graph
- tabu search
- setup times
- precedence constraints
- parallel machines
- minimizing makespan
- permutation flowshop
- interconnection networks
- graph embedding
- structured data
- special case
- relational learning
- lagrangian relaxation
- logic programming
- spanning tree
- graph mining
- directed acyclic graph
- hardware implementation
- integer programming