Approximation results for makespan minimization with budgeted uncertainty - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Approximation results for makespan minimization with budgeted uncertainty

Résumé

We study approximation algorithms for the problem of minimizing the makespan on a set of machines with uncertainty on the processing times of jobs. In the model we consider, which goes back to [3], once the schedule is defined an adversary can pick a scenario where deviation is added to some of the jobs' processing times. Given only the maximal cardinality of these jobs, and the magnitude of potential deviation for each job, the goal is to optimize the worst-case scenario. We consider both the cases of identical and unrelated machines. Our main result is an EPTAS for the case of identical machines. We also provide a 3-approximation algorithm and an inapproximability ratio of 2 − epsilon for the case of unrelated machines.
Fichier principal
Vignette du fichier
submission.pdf (300.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02277357 , version 1 (03-09-2019)

Identifiants

Citer

Marin Bougeret, Klaus Jansen, Michael Poss, Lars Rohwedder. Approximation results for makespan minimization with budgeted uncertainty. WAOA 2019 - 17th International Workshop on Approximation and Online Algorithms, Sep 2019, Munich, Germany. pp.60-71, ⟨10.1007/978-3-030-39479-0_5⟩. ⟨hal-02277357⟩
90 Consultations
69 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More