Add more JSSP Instances

[iamaya2]

Include traditional datasets into the framework, so that more robust testing can be carried out:

• [x] Lawrence (la): 40 JSSP instances [72];
• [ ] Adams/Balas/Zawack (abz): 9 instances from 100 to 500 operations [19];
• [x] Applegate and Cook (orb): 5 instances (orb1-orb5) from a challenge. Each instance has a duplicate with different processing times; total: 10 instances [28];
• [x] Storer et al. (swv): 20 instances from 200 to 500 operations [73];
• [x] Yamada/Nakano (yn): 4 20x20 instances; processing times from uniform distribution in [10,50] [74];
• [ ] Taillard (ta): 260 instances, where 80 are JSSPs [27];
• [ ] Demirkol et al. (dm): 600 scheduling instances (40 JSSPs) with both completion time and lateness optimization criteria [75].

Also, include the instances from the following site: https://arxiv.org/src/2102.08778v2/anc, which contain large instances and instances with known optima.

References (info taken from a manuscript tha was reviewed for a journal):

[19] J. Adams, E. Balas, D. Zawack, The shifting bottleneck procedure for job shop scheduling, Management Science 34 (3) (1988) 391–401. [27] E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research 64 (2) (1993) 278 – 285. doi:http://dx.doi.org/10.1016/0377-2217(93)90182-M. [28] D. Applegate, W. Cook, A computational study of the job-shop scheduling problem, ORSA Journal on Computing 3 (2) (1991) 149–156. doi:10.1287/ijoc.3.2.149. [72] S. Lawrence, Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement), Graduate School of Industrial Administration, Carnegie-Mellon University, 1984. [73] R. H. Storer, S. D. Wu, R. Vaccari, New search spaces for sequencing problems with application to job shop scheduling, Management science 38 (10) (1992) 1495–1509. [74] T. Yamada, R. Nakano, A genetic algorithm applicable to large-scale job-shop problems., in: PPSN, 1992, pp. 283–292. [75] E. Demirkol, S. Mehta, R. Uzsoy, Benchmarks for shop scheduling problems, European Journal of Operational Research 109 (1) (1998) 137 – 141. doi:http://dx.doi.org/10.1016/S0377-2217(97)00019-2.

[iamaya2]

Added the LargeTA and KnownOptima benchmarks as .mat files

[iamaya2]

Added the Taillard and OR-Library datasets (into the baseInstances repo)