A decomposition-based heuristic procedure for the Medical Student Scheduling problem

Published: 17-05-2020| Version 2 | DOI: 10.17632/7tngjsdc79.2
Contributor:
Babak Akbarzadeh

Description

“This dataset is generated for the paper titled "A decomposition-based heuristic procedure for the Medical Student Scheduling problem", published in the European Journal of Operation Research (DOI:10.17632/7tngjsdc79.1). The dataset is organized per experiment performed in the paper. The instances are generated according to the instructions described in the paper and grouped per visited setting. E.g. In Section 5.2.1, 3x3 groups are visited, leading to 9 different groups of instances. For each setting, there is a folder that includes the instances and two solutions per instance, i.e. a solution coming from the heuristic (e.g. BucketListImproved0OptSol.txt) and a solution coming from the MIP solver (e.g. MIP0OptSol.txt). The format of an instance file is discussed in readme_instance.txt. The format of a solution file is discussed in readme_solution.txt. For a summary of the results, we refer to the corresponding tables in the manuscript."

Files