Minimizing the weighted sum of completion times under processing time uncertainty - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Discrete Mathematics Année : 2018

Minimizing the weighted sum of completion times under processing time uncertainty

Résumé

We address the robust counterpart of a classical single machine scheduling problem by considering a budgeted uncertainty and an ellipsoidal uncertainty. We prove that the problem is N P-hard for arbitrary ellipsoidal uncertainty sets. Then, a mixedinteger linear programming reformulations and a second order cone programming reformulations are provided. We assess the reformulations on randomly generated instances, comparing them with branch-and-cut algorithms.
Fichier principal
Vignette du fichier
INOC_Scheduling.pdf (260.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-01768638 , version 1 (30-03-2021)

Identifiants

Citer

Zacharie Alès, Thi Sang Nguyen, Michael Poss. Minimizing the weighted sum of completion times under processing time uncertainty. Electronic Notes in Discrete Mathematics, 2018, 64, pp.15 - 24. ⟨10.1016/j.endm.2018.01.003⟩. ⟨hal-01768638⟩
170 Consultations
128 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More