On the equivalence of the max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
New observations are made about two lower bound schemes for single-machine min-sum scheduling problems. We find that the strongest bound of those provided by transportation problem relaxations can be computed by solving a linear program. We show the equivalence of this strongest bound and the bound provided by the LP relaxation of the time-indexed integer … Read more