Enhancing Evolutionary Solver Efficiency for NP Hard Single Machine Scheduling Problems.
Mohammed AlromemaMohammed A. MakaremPublished in: CoRR (2024)
Keyphrases
- np hard
- single machine scheduling problem
- branch and bound algorithm
- computational complexity
- optimal solution
- scheduling problem
- integer programming
- approximation algorithms
- worst case
- precedence constraints
- branch and bound
- np complete
- special case
- lower bound
- constraint satisfaction problems
- database systems
- objective function