Procedures for the bin packing problem with precedence constraints.
Jordi PereiraPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- precedence relations
- release dates
- parallel machines
- approximation algorithms
- single machine scheduling problem
- parallel processors
- global constraints
- vertex cover
- maximum lateness
- sequence dependent setup times
- partially ordered sets
- setup times
- partial order
- partially ordered
- series parallel
- lower bound
- single machine
- np hard
- branch and bound
- feasible solution
- combinatorial optimization
- distributed systems
- search algorithm