1 citations · 1 across the 1 of their papers we have counts for
1 paper · 1 filter
Jan Gmys
Makespan minimization in permutation flow-shop scheduling is a well-known hard combinatorial optimization problem. Among the 120 standard benchmark instances proposed by E. Taillar…