The bounded core for games with precedence constraints.
Michel GrabischPeter SudhölterPublished in: Ann. Oper. Res. (2012)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- coalitional games
- precedence relations
- vertex cover
- release dates
- sequence dependent setup times
- approximation algorithms
- single machine scheduling problem
- parallel machines
- parallel processors
- partial order
- setup times
- cooperative game
- global constraints
- partially ordered
- maximum lateness
- unit length
- game theory
- lower bound
- single machine
- flowshop
- nash equilibrium
- series parallel
- asymptotically optimal
- branch and bound
- constraint satisfaction
- constraint satisfaction problems
- cost function
- search space
- search algorithm