A graph-based formulation for the shift rostering problem

•Novel graph-based formulation for the Shift Rostering Problem.•Newly-proposed prohibited meta-sequences to model work rules.•Novel path extension operator to construct graph of feasible shift patterns.•Extensive computational testing on different benchmarks.•New optimal solutions and significant speedups in average computation time achieved.