A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data

We consider a version of the total flow time single machine scheduling problem where uncertainty about processing times is taken into account. Namely an interval of equally possible processing times is considered for each job, and optimization is carried out according to a robustness criterion. We propose the first mixed integer linear programming formulation for the resulting optimization problem and we explain how some known preprocessing rules can be translated into valid inequalities for this formulation. Computational results are finally presented.