Published November 22, 2019
| Version 1.0
Dataset
Open
Improved upper bounds for permutation flowshop scheduling benchmarks (Taillard and VRF)
Authors/Creators
- 1. University of Mons
- 2. Inria Lille-Nord Europe, CNRS/CRIStAL, University of Lille
Description
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.
Files
Files
(53.0 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:e9d56ec1f1d7a21f2119b8c85e7c1363
|
53.0 kB | Download |
Additional details
References
- E. Taillard, Flow shop sequencing: Summary of best known lower and upper bounds of Taillard's instances, http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/flowshop.dir/best_lb_up.txt
- E. Vallada, R. Ruiz and J.M. Framinan, New hard benchmark for flowshop scheduling problems minimising makespan, EJOR 2015, https://doi.org/10.1016/j.ejor.2014.07.033