A Constraint Satisfaction Problem (CSP) Approach for the Nurse Scheduling Problem.
Aymen Ben SaidMalek MouhoubPublished in: SSCI (2022)
Keyphrases
- constraint satisfaction problems
- scheduling problem
- np hard
- constraint satisfaction
- np complete
- constraint programming
- flowshop
- constraint propagation
- search space
- combinatorial problems
- tabu search
- arc consistency
- soft constraints
- constraint networks
- optimal solution
- non binary
- solving constraint satisfaction problems
- forward checking
- lower bound
- sat problem
- tree decompositions
- constraint solving
- hard constraints
- special case
- tractable subclasses
- product configuration
- constraint problems
- constraint solver
- finite domain
- random instances
- constraint graph
- backtracking algorithm
- disjunctive temporal