Instances for the Job Sequencing and Tool Switching Problem with Non-identical Parallel Machines (SSP-NPM)

The data presented here were used in computational experiments to evaluate the different mathematical models proposed for solving the Job Sequencing and Tool Switching Problem with Non-identical Parallel Machines (SSP-NPM), as described in the research article titled "Job sequencing and tool switching problem with non-identical parallel machines: mathematical formulations and modeling improvements" (Hadj Salem et al., 2025).

We considered three sets of instances: Set I, Set II, and Set III.
These comprise a total of 1,020 instances, which are divided into 22 subsets.
Detailed information about the structure of the instances in Set-I and Set-II can be found in references Calmels, D. (2022a) and Calmels, D. (2022b), respectively. However, Set-III consists of newly generated random instances. It contains a total of 720 instances, divided into 18 subsets of 40 instances each, where |M| in {2,3}, |J| in {10,15,20}, and |T| in {10,15,20}.
For each tuple (|M|, |J|, |T|), 4 density levels are generated with 10 instances per level.
The density level varies between {20%,30%,40%,50%} and corresponds to the percentage of 1 in the tool requirement matrix.

- Calmels, D. (2022a). A comparison of different mathematical models for the job sequencing and tool switching problem with non-identical parallel machines. International Journal of Operational Research, 45(4):419–441. (https://doi.org/10.1504/IJOR.2022.128396)
- Calmels, D. (2022b). An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines. European Journal of Operational Research, 297(1):66–85. (https://doi.org/10.1016/j.ejor.2021.05.005)