Skip to Main content Skip to Navigation
Journal articles

Minimizing the weighted sum of completion times under processing time uncertainty

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01768638
Contributor : Michaël Poss Connect in order to contact the contributor
Submitted on : Tuesday, March 30, 2021 - 1:55:18 PM
Last modification on : Wednesday, March 23, 2022 - 11:56:04 AM

File

INOC_Scheduling.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

140

Files downloads

59