A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints.
Guilherme Henrique Ismael de AzevedoArtur Alves PessoaAnand SubramanianPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- precedence relations
- precedence constraints
- resource constrained project scheduling problem
- scheduling problem
- branch and bound algorithm
- resource constraints
- project scheduling
- approximation algorithms
- partially ordered
- parallel machines
- release dates
- partial order
- global constraints
- sequence dependent setup times
- single machine scheduling problem
- np complete
- computational complexity
- lower bound
- ant colony algorithm
- processing times
- upper bound
- harmony search
- constraint satisfaction