Solving the Multi-activity Shift Scheduling Problem using Variable Neighbourhood Search

This paper presents a set of benchmarks instances for the multi-activity shift scheduling problem and the results produced using a variable neighbourhood search method. The data set is intended as a resource to generate and verify novel research on an important and practical but challenging problem. The variable neighbourhood search uses four different neighbourhood operators and can produce feasible solutions within short computation times.