Graph decomposition heuristic for machine scheduling problems.
Eui-Seok ByeonPublished in: AI&M (2002)
Keyphrases
- scheduling problem
- flowshop
- sequencing problems
- strongly np hard
- parallel machine scheduling problem
- graph search
- unrelated parallel machines
- list scheduling
- tabu search
- parallel machines
- single machine
- job shop scheduling problem
- setup times
- quay crane
- processing times
- sequence dependent setup times
- tree decomposition
- graph model
- job shop
- scheduling decisions
- job shop scheduling
- depth first search
- minimizing makespan
- search algorithm
- np hard
- bicriteria
- graph theory
- optimal solution
- random walk
- structural learning
- maximum lateness
- graph structure
- graph databases
- precedence constraints
- minimum spanning tree
- tree search
- dynamic programming
- decomposition method
- solution quality
- graph partitioning
- breadth first search
- feasible solution
- structured data
- graph mining
- directed acyclic graph
- weighted graph
- greedy heuristics
- special case
- computational complexity
- completion times