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