The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective
A minmax regret single machine problem is considered. Multiple methods to evaluate the maximum regret of a schedule are considered. A new lower bound and a previously proposed dominance rule are studied. A branch-and-bound algorithm is proposed for the resolution of the problem. The approximation ratio of the midpoint scenario heuristic is analyzed.
single machine scheduling branch-and-bound uncertainty robust optimization