Bi-criteria benchmarks for flow-shop scheduling problems with uncertain processing times

Single-objective benchmarks are available on Éric Taillard's web page.
We extend those problems into bi-objective problems with uncertain processing times .

The processing times of the deterministic benchmarks are generated in the same way than in Taillard's instances. The due dates are obtained using a random value chosen between μ*M and μ*(N+M-1), where N is the number of jobs, M the number of machines and μ the mean of processing times (previously generated for each job on each machine).
Moreover, in addition to Taillard's instances, we propose some instances with intermediate sizes.

Then, several types of probabilistic distributions can be applied to generate uncertainty into those initial instances.