Improved upper bounds for permutation flowshop scheduling benchmarks (Taillard and VRF)

Name: Improved upper bounds for permutation flowshop scheduling benchmarks (Taillard and VRF)
Creator: Inria Lille-Nord Europe, CNRS/CRIStAL, University of Lille; University of Mons
Published: 2019-11-22T00:00:00+08:00

Zenodo2019-11-22 更新2026-04-07 收录

排列流水车间调度

生产调度优化

数据链接：

https://zenodo.org/record/3550553 数据链接链接失效反馈

官方服务：

资源简介：

Optimal makespans and permutation schedules (found and proven optimal by Branch-and-Bound) for Taillard instances Ta112, Ta116 (500 jobs, 20 machines) and 74 instances of the VRF benchmark.

提供机构：

Inria Lille-Nord Europe, CNRS/CRIStAL, University of Lille; University of Mons

创建时间：

2019-11-22