A partition-based branch-and-bound algorithm for the project duration problem with partially renewable resources and general temporal constraints.
Kai WatermeyerJürgen ZimmermannPublished in: OR Spectr. (2022)
Keyphrases
- temporal constraints
- branch and bound algorithm
- resource constraints
- temporal reasoning
- lower bound
- upper bound
- branch and bound
- simple temporal
- special case
- np hard
- temporal information
- precedence constraints
- randomly generated problems
- single machine scheduling problem
- optimal solution
- lower bounding
- workflow systems
- upper bounding
- combinatorial optimization
- max sat
- constraint propagation
- spatial information
- search algorithm
- image sequences
- neural network