Data for Metaheuristics for the no-wait flow shop scheduling problem with single server to minimize total tardiness

This data set represents randomly generated instances for the problem for the flow shop scheduling problem with single server to minimize total tardiness. The folder includes two other folders, one for small and the second for large instances respectively.