Multiprocessor scheduling under precedence constraints: Polyhedral results.
Pablo E. CollCelso C. RibeiroCid C. de SouzaPublished in: Discret. Appl. Math. (2006)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- approximation algorithms
- parallel machines
- precedence relations
- release dates
- vertex cover
- single machine scheduling problem
- parallel processors
- partial order
- convex hull
- global constraints
- setup times
- maximum lateness
- partially ordered
- sequence dependent setup times
- series parallel
- lower bound
- np hard
- special case
- upper bound
- unit length
- partially ordered sets
- flowshop
- message passing
- objective function