Solving the RWSP with Constraint programming
This was a project in constraint programming that aimed to solve the “Rotating Workforce Scheduling Problem”, as defined in Exact Methods for Extended Rotating Workforce Scheduling Problems. The overall modelling strategy for the model consisted of a viewpoint of assigning an integer shift type to an employee at some day. This can be represented as a 2D array with different employees being indexed through the first dimension and the weekdays being indexed in the second dimension....
