Benchmark instances for the single machine scheduling problem with total tardiness, deadlines and rejection cost
This page contains the instances used in our ongoing research on single machine problems with rejection cost.
- Our results are included in the following paper:
- R. Cordone, P. Hosteins and G. Righini ``A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization'', Journal on Computing (2017)
- Our full Dataset can be found: here with instances from 20 to 300 jobs. A README.txt file inside each archive explains the structure of data. The generation of the instances is detailed in the 2017 paper cited above.