Personnel Task Scheduling Problem (PTSP) dataset
File: ptask.zip
This download contains the PTSP data set for Personnel Task Scheduling Problem (also referred to known as a fixed interval scheduling or fixed task scheduling with time windows). The data has been used in the following papers:
- Krishnamoorthy, M., Ernst, A. T., & Baatar, D. (2012). Algorithms for large scale shift minimisation personnel task scheduling problems. European Journal of Operational Research, 219(1), 34-48.
- Baatar, D., Krishnamoorthy, M., & Ernst, A. T. (2015). A triplet-based exact method for the shift minimisation personnel task scheduling problem. In Algorithms-ESA 2015 (pp. 59-70). Springer, Berlin, Heidelberg.
- Ramesh, D. N., Krishnamoorthy, M., & Ernst, A. T. (2018). Efficient models, formulations and algorithms for some variants of fixed interval scheduling problems. In Data and Decision Sciences in Action (pp. 43-69). Springer, Cham.
The format of all of these data files is:
- multi–skilling level
- type =1 (minimizing the number of shifts/workers)
- number of jobs/tasks
- job start and end times
- number of shifts(qualifications)
- number of qualified jobs for each shift and the qualified job indices
The name of the data file presents:
- the file number
- number of workers
- number of jobs
- the multi–skilling level
For example, Data_10_51_111_66.dat is the 10th data file which presents a problem instance with 51 workers, 111 jobs and with a multi–skilling level of 66%.
There are 137 data files in the data set ptask.zip.