Scheduling and Planning Benchmark Instances

[ home ] [ nurse ] [ multi-activity ] [ changes ] [ contact ]

Other personnel scheduling problem data sets

Problem	Cyclical scheduling
Reference	Bard, J.F. and H.W. Purnomo. Cyclic Preference Scheduling of Nurses Using A Lagrangian-Based Heuristic. Journal of Scheduling, 2007. 10(1).
Data	BardPurnomoJoS_2007_10.zip

Problem	Rotating Workforce Scheduling
Reference	Musliu, Nysret. Heuristic Methods for Automatic Rotating Workforce Scheduling. International Journal of Computational Intelligence Research, 2006. 2(4): pp. 309-326.
Data	http://www.dbai.tuwien.ac.at/staff/musliu/benchmarks/

Problem	Shift Design Problem
Reference	Nysret Musliu, Andrea Schaerf, and Wolfgang Slany. Local Search for Shift Design. European Journal of Operational Research, 2004. 153(1): pp 51-64.
Data	http://www.dbai.tuwien.ac.at/proj/Rota/benchmarks.html

Problem	Aggregated Instances
Reference	S. van Veldhoven, G. Post, E. van der Veen and T. Curtois. An assessment of a days off decomposition approach to personnel scheduling. Annals of Operations Research, 2016. 239(1): pp 207–223. pdf
Data	AggregatedInstances.zip

Shortest path problem data sets

Problem	Multi-objective Shortest Path Problem (MSPP)
Reference	Yi Qu, Tolga Bektas and Julia Bennell. Multi-objective Routing in Short Computation Times.
Data	http://www.schedulingbenchmarks.org/mspp