Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
Alix Munier KordonPublished in: Oper. Res. Lett. (2004)
Keyphrases
- bipartite graph
- minimizing makespan
- single processor
- parallel machines
- precedence constraints
- scheduling problem
- parallel processors
- flowshop
- maximum matching
- parallel architectures
- link prediction
- massively parallel
- distributed memory
- maximum cardinality
- parallel computing
- shared memory
- partial order
- tabu search
- np hard
- special case
- processing times
- approximation algorithms
- random walk
- general purpose