A new formulation for scheduling unrelated processor under precedence constraints.
Nelson MaculanStella C. S. PortoCelso C. RibeiroCid Carvalho de SouzaPublished in: RAIRO Oper. Res. (1999)
Keyphrases
- precedence constraints
- parallel processors
- scheduling problem
- branch and bound algorithm
- precedence relations
- parallel machines
- release dates
- vertex cover
- sequence dependent setup times
- maximum lateness
- approximation algorithms
- partially ordered
- single machine scheduling problem
- setup times
- partial order
- global constraints
- unit length
- single machine
- np hard
- total tardiness
- series parallel
- tabu search
- partially ordered sets
- computational complexity
- linear programming
- lower bound