General parametric scheme for the online uniform machine scheduling problem with two different speeds - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2018

General parametric scheme for the online uniform machine scheduling problem with two different speeds

Résumé

In this paper, we consider the online uniform machine scheduling problem on m processors when speed s i = 1 for i = k+1, ..., m and s i = s, s > 1, for i = 1, ..., k. The objective is to minimize makespan. We propose a parametric scheme with the worst-case performance 2.618 when 1 < s ≤ 2, and with the asymptotic worst-case performance 1 2 (1+s+ √ 5 − 2s + s 2) for all s > 1 when the ratio m/k tends to infinity.
Fichier principal
Vignette du fichier
uniform.pdf (438.03 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01709442 , version 1 (15-02-2018)

Identifiants

Citer

Alexandre Dolgui, Vladimir Kotov, Aliaksandr Nekrashevich, Alain Quilliot. General parametric scheme for the online uniform machine scheduling problem with two different speeds. Information Processing Letters, 2018, 134, pp.18 - 23. ⟨10.1016/j.ipl.2018.01.009⟩. ⟨hal-01709442⟩
270 Consultations
109 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More