The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem.
Lídia Lampreia LourençoMargarida Vaz PatoPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- precedence constraints
- branch and bound algorithm
- lower bound
- upper bound
- branch and bound
- series parallel
- scheduling problem
- precedence relations
- np hard
- approximation algorithms
- release dates
- single machine scheduling problem
- vertex cover
- optimal solution
- sequence dependent setup times
- parallel processors
- objective function
- integer programming formulations
- parallel machines
- lagrangian relaxation
- maximum lateness
- global constraints
- combinatorial optimization
- partially ordered
- worst case
- setup times
- unit length
- lower and upper bounds
- partial order
- np complete
- particle swarm optimization
- partially ordered sets