Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.
Paolo Dell'OlmoMaria Grazia SperanzaZsolt TuzaPublished in: Discret. Appl. Math. (1997)
Keyphrases
- scheduling problem
- single machine
- graph structure
- processing times
- distributed sensor networks
- graph representation
- random walk
- graph theory
- graph partitioning
- graph model
- flowshop
- setup times
- directed graph
- graph construction
- np hard
- distributed memory
- graph theoretic
- job shop scheduling problem
- graph based algorithm
- weighted graph
- spanning tree
- directed acyclic graph
- neural network
- bipartite graph
- structured data
- special case
- pairwise
- clustering algorithm