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

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

0.00 Avg rating0 Votes
Article ID: iaor20082423
Country: United Kingdom
Volume: 6
Issue: 2
Start Page Number: 287
End Page Number: 296
Publication Date: Jun 2007
Journal: Journal of Mathematical Modelling and Algorithms
Authors:
Keywords: programming: integer
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.