Much like any other problem in optimization, the shift minimization task scheduling problem has also greatly benefited from the presence of a benchmark instance set. This paper studies the properties of this benchmark dataset and identifies the factors that most influence the hardness of these instances based on the performance of the state of
the art solution techniques available for the problem.