Characterizations of solutions for games with precedence constraints.
Michel GrabischPeter SudhölterPublished in: Int. J. Game Theory (2016)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- vertex cover
- optimal solution
- approximation algorithms
- unit length
- maximum lateness
- single machine scheduling problem
- release dates
- sequence dependent setup times
- np hard
- global constraints
- partially ordered
- partial order
- computing systems
- processing times
- computer games
- heuristic search
- genetic algorithm