Simulation and Computational Results for Batch Scheduling on Unrelated Parallel Machines: Comparison of Proposed, Enumeration, and Branch-and-Bound Algorithms Dataset

The complete simulation data supporting this study, including all test cases and computational results for the three comparative experiments—(1) the Proposed Algorithm (PA) versus Enumeration Algorithm (EA), (2) the Proposed Algorithm (PA) versus Branch and Bound (BnB), and (3) the BnB versus EA—have been deposited in the Zenodo open-access repository. The dataset contains the input parameters, machine configurations, scheduling windows, algorithm outputs (total actual flow time and CPU time), and efficiency metrics used to generate Tables 9, 12, and 13 of this paper. Each dataset is provided in structured format (CSV and JSON) to facilitate reproducibility and secondary analysis. The data are freely available under the Creative Commons Attribution 4.0 International (CC BY 4.0) license and can be accessed through the following. This open repository ensures transparency and reproducibility of the presented results while enabling further exploration of the proposed scheduling model and its algorithmic behavior across different experimental conditions. Researchers and practitioners may reuse, adapt, or extend the datasets for benchmarking, comparative studies, or model validation in related manufacturing scheduling research.