Benchmarks for the ordered flow shop scheduling problem

Data includes three sets of benchmark instances for the Ordered Flow Shop Scheduling problem. The benchmarks are entitled as T, S and L, including 120, 240 and 240 instances. Each instance file (in .txt format) contains the processing times of jobs (n) on machines (m) as an (m * n) matrix. The data is related to the manuscript sent for publication in the Computers & Operations Research with the title: Makespan minimization for the m-machine ordered flow shop scheduling problem Mostafa Khatami, Amir Salehipour, F.J. Hwang本数据集包含针对有序流水车间调度（Ordered Flow Shop Scheduling）问题的三组基准测试实例。该基准集分为T、S、L三组，分别包含120、240和240个测试实例。每个实例文件格式为.txt，以(m×n)矩阵的形式存储n个工件在m台机器上的加工时间。本数据集关联一篇已投稿至《计算机与运筹学》（Computers & Operations Research）的手稿，该手稿标题为《多机有序流水车间调度问题的完工时间最小化》，作者为Mostafa Khatami、Amir Salehipour与F.J. Hwang。