Periodic schedules for linear precedence constraints.
Claire HanenAlix Munier KordonPublished in: Discret. Appl. Math. (2009)
Keyphrases
- precedence constraints
- scheduling problem
- series parallel
- precedence relations
- branch and bound algorithm
- parallel machines
- single machine
- release dates
- sequence dependent setup times
- single machine scheduling problem
- flowshop
- vertex cover
- maximum lateness
- processing times
- partially ordered sets
- parallel processors
- approximation algorithms
- np hard
- setup times
- partially ordered
- partial order
- tabu search
- total tardiness
- bayesian networks