PFSP-TC Benchmark Instances
Abstract
This dataset provides benchmark instances for the Permutation Flow Shop Problem with Transportation Constraints (PFSP-TC). It includes processing times, transportation times, and empty moving times. For each instance, time-related data are fixed, while multiple experimental scenarios are created by varying the number of AGVs. The dataset is intended to support reproducible research and comparative evaluation of exact and metaheuristic algorithms for PFSP-TC.
Publication details
- Journal / source
- Harvard Dataverse
- Publication date
- 20 January 2026
- Document type
- Dataset