A minimum witness for the 3/2 configuration-linear-program gap in two-weight graph balancing, unique at its size
In restricted assignment - makespan minimization where each job has one size and a set of allowed machines - the configuration LP is the tightest studied relaxation, and its integrality gap is open in general. On two-weight graph balancing - each job allowed on at most two machines, sizes from two values - the value is...