1 problem

Matching

Taillard's asymptotic tightness conjecture for permutation flowshop lower bounds
About 1 year old
Taillard's conjecture. For a fixed number of machines $M$ ,
openasymptotic-probability combinatorial-optimization flowshop-scheduling
06