Experimental dataset: Neighbourhood Structures and Ranking Operators for the Interval Job Shop Scheduling Problem

The experimental study compares five neighbourhood variants
($N_1$, $N_2$, $N_3$, $N_{\text{ext}}$, $N_8$) and four interval-ranking operators
(EV, LEX1, LEX2, YX) for the Interval Job Shop Scheduling Problem (IJSP), on 82
benchmark instances ranging from $10\times10$ to $50\times20$ operations. Three
experimental phases are reported:

- **Phase A** — common-hyperparameter hill climbing for the $5 \times 4$ operator
  comparison (Section 8.2 of the paper).
- **Phase B** — per-neighbourhood irace-tuned tabu search for the head-to-head
  neighbourhood comparison (Section 8.3).
- **Phase C** — comparison of the best Phase B configuration against three
  published IJSP solvers (Section 8.4).

Each (instance, configuration) pair is executed for 30 independent runs.