A note on periodic schedules for linear precedence constraints.
Vladimir KatsEugene LevnerPublished in: Discret. Appl. Math. (2013)
Keyphrases
- precedence constraints
- scheduling problem
- series parallel
- single machine
- precedence relations
- setup times
- branch and bound algorithm
- parallel machines
- vertex cover
- single machine scheduling problem
- release dates
- flowshop
- np hard
- partially ordered
- approximation algorithms
- parallel processors
- unit length
- maximum lateness
- sequence dependent setup times
- partially ordered sets
- global constraints
- partial order
- tabu search
- computer systems
- linear programming
- search algorithm