 |
Relative Regret Single Machine Scheduling for Minimizing Maximum Lateness with Interval Data
1 : Laboratoire de Conception, Optimisation et Modélisation des Systèmes
Université de Lorraine : EA7306
In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The interval uncertainty is related to processing times and delivery times. The maximal relative regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied problem is constructed.
