Single machine robust scheduling with budgeted uncertainty - Archive ouverte HAL
Article Dans Une Revue Operations Research Letters Année : 2023

Single machine robust scheduling with budgeted uncertainty

Résumé

We consider robust single machine scheduling problems. First, we prove that with uncertain processing times, minimizing the number of tardy jobs is NP-hard. Second, we show that the weighted variant of the problem has the same complexity as the nominal counterpart whenever only the weights are uncertain. Last, we provide approximation algorithms for the problems minimizing the weighted sum of completion times. Noticeably, our algorithms extend to more general robust combinatorial optimization problems with cost uncertainty, such as max-cut.
Fichier principal
Vignette du fichier
new_draft4.pdf (319.62 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03926286 , version 1 (06-01-2023)

Identifiants

Citer

Marin Bougeret, Artur Alves Pessoa, Michael Poss. Single machine robust scheduling with budgeted uncertainty. Operations Research Letters, 2023, 51 (2), pp.137-141. ⟨10.1016/j.orl.2023.01.007⟩. ⟨hal-03926286⟩
58 Consultations
141 Téléchargements

Altmetric

Partager

More