XESTT is an XML data format for defining instances and solutions of employee scheduling problems. It is an extension of XHSTT, the standard format for expressing instances and solutions of high school timetabling problems. Although the `ES' in XESTT stands for `employee scheduling', at present the XESTT project is limited to nurse rostering.
An XESTT archive is an XML file containing any number of instances of the nurse rostering problem, together with any number of sets of solutions to those instances, all expressed in the XESTT format. The following archives, created by the NRConv program, are available here:
COI.xml (10M). Contains XESTT versions of 27 of the 28 `original' instances and 65 of the 66 solutions to those instances posted by Tim Curtois on his nurse rostering site. The omitted instance is HED01b, omitted because it is almost the same as HED01, and because Curtois omitted it in a recent paper about these instances. The omitted solution is a solution to HED01b.
INRC1-Long-and-Medium.xml (7M) and INRC1-Sprint.xml (4M). Two archives containing XESTT versions of the 15 long, 15 medium, and 30 sprint instances of the First International Nurse Rostering Competition, and 60 solutions (one for each instance) posted by the GOAL group here.
There are no archives posted here containing instances and solutions to the Second International Nurse Rostering Competition, because of the mix-and-match nature of the instances, and because users will want to include heuristic constraints, for which there is no fixed rule, to guide weekly solutions towards satisfying global constraints. However, NRConv does include a converter for the full INRC2 format, including scenario, history, and weekly instance files.
You can download this whole site (the 26 August 2018 version) as a gzipped tar file (7M). It unpacks to directory xestt, containing the XESTT archives, and the source instances and solutions that the archives convert. File xestt/README explains what is where.
The HSEval High School Timetable Evaluator, a web service that evaluates solutions to XHSTT and XESTT instances. It also has pages that give detailed technical specifications of the XHSTT and XESTT formats.
KHE, a software platform on which efficient solvers for XHSTT and XESTT instances can be built. It includes the NRConv program that converts instances and solutions in other formats to XESTT. You only need NRConv if you plan to do your own conversions.
A Unified Nurse Rostering Model Based on XHSTT (PDF), a paper giving an overview of the XESTT format and project. Co-authored with Gerhard Post and Greet Vanden Berghe. To appear in PATAT 2018.
Modelling History in Nurse Rostering (PDF), a paper which analyses the problem of history in nurse rostering and describes XESTT's approach in detail. To appear in PATAT 2018.
I've tried my hand at solving the COI, INRC1, and CQ14 XESTT instances with my KHE18 solver. The results, obtained with Version 2.2 of KHE on 22 May 2018, can be downloaded here in archive files KHE18-2018-05-22-COI.xml, KHE18-2018-05-22-INRC1-Long-And-Medium.xml, KHE18-2018-05-22-INRC1-Sprint.xml, and KHE18-2018-05-22-CQ14.xml. I've written a paper about this, KHE18: A Solver for Nurse Rostering, to appear in PATAT 2018.
Since 22 May 2018 I have continued work on this problem, and produced new results and a new version of the paper. The results, obtained with Version 2.3 of KHE on 26 August 2018, can be downloaded here in archive files KHE18-2018-08-26-COI.xml, KHE18-2018-08-26-INRC1-Long-And-Medium.xml, KHE18-2018-08-26-INRC1-Sprint.xml, and KHE18-2018-08-26-CQ14.xml. The 26 August 2018 version of the paper is here. I expect to be submitting it, or a further revision of it, to the PATAT 2018 post-conference selected papers volume.