Computational Experiment Results for the Job Shop Scheduling Problem with Time Lags (JSPTL)

This dataset contains the results of computational experiments conducted on benchmark instances of the Job Shop Scheduling Problem with Time Lags (JSPTL). The table compares the performance of different algorithms, including:
- MA: Memetic Algorithm (Caumond et al., 2008)
- SSPR: Shifting Bottleneck Procedure with Simulated Annealing (Gonzalez et al., 2015)
- This paper: Proposed approach from the current study.
Metrics include:
- GAP (%): Gap between the solution and the optimal/known best lower bound.
- t (s): Computational time in seconds.
The dataset is divided into two parts:
- Instances with small to medium complexity (la01 to la05), with averages provided.
- Instances with higher complexity (la06 to la08), with corresponding averages.
This data supports the analysis of the efficiency and competitiveness of the proposed method in comparison to state-of-the-art algorithms.