View article

This report lists results of applying the algorithms presented in [2] to the staff scheduling problem benchmark instances 1.. 24 [3]. The algorithms are an ejection chain metaheuristic and a branch and price method. The branch and price method was shown to be very effective on smaller and medium sized instances, often finding the optimal solution. Its weakness is on the larger instances on which it may run out of memory trying to solve a sub-problem. The metaheuristic is a more robust and practical method. Although it is outperformed on the smaller instances, it will still find good solutions on the larger instances if given sufficient time. For additional comparisons we have also included the results of applying Gurobi 5.6. 3 [1] to an integer programming formulation.