This page provides upper and lower bounds for Demirkol’s instances
GTA paper was uploaded to arXiv:1808.10813 [cs.AI].
Ebru Demirkol, Sanjay Mehta, Reha Uzsoy "Benchmarks for shop scheduling problems", European Journal of Operational Research, 109(1), 1998, pp. 137-141.
To submit a new upper bound, click here
Download Demirkol’s benchmark problems
The ith row of each solution file represents the processing order of jobs on the ith machine
(indexing of jobs starts from zero)
Last update:
March 15, 2024
|