New hard benchmark for flowshop scheduling problems minimising makespan
We present a new hard benchmark for flowshop scheduling problems with the objective of makespan minimisation. We show that existing benchmarks have a number of problems most notably the lack of statistical and discriminant power. Through a series of comprehensive computational and statistical experiments we demonstrate that the new benchmark is hard. Six years of CPU time effort were devoted for the benchmark generation and analysis. We also present a website for keeping instances, best upper and lower bounds, full solutions, etc.
benchmark flowshop makespan