Shared resources and precedence constraints with capacity sharing and stealing.
Luís NogueiraLuís Miguel PinhoPublished in: IPDPS (2008)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- sharing information
- sharing knowledge
- precedence relations
- parallel processors
- parallel machines
- multiple users
- vertex cover
- approximation algorithms
- sequence dependent setup times
- partial order
- release dates
- partially ordered
- global constraints
- series parallel
- single machine scheduling problem
- information sharing
- maximum lateness
- unit length
- lower bound
- resource allocation
- single machine
- branch and bound
- constraint satisfaction
- dynamic programming
- pairwise
- optimal solution
- partially ordered sets