Benchmarks for the ordered flow shop scheduling problem
收藏NIAID Data Ecosystem2026-03-11 收录
下载链接：
https://data.mendeley.com/datasets/cd2rv7hyyj
下载链接
链接失效反馈官方服务：
资源简介：
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
创建时间：
2019-03-08
