Scheduling with Precedence Constraints: Mixed Graph Coloring in Series-Parallel Graphs.
Hanna FurmanczykAdrian KosowskiPawel ZylinskiPublished in: PPAM (2007)
Keyphrases
- series parallel
- precedence constraints
- graph coloring
- scheduling problem
- job shop scheduling
- branch and bound algorithm
- combinatorial problems
- parallel machines
- max sat
- np hard
- tabu search
- global constraints
- flowshop
- job shop scheduling problem
- lower bound
- phase transition
- branch and bound
- partially ordered
- constraint programming
- constraint satisfaction problems
- evolutionary algorithm