Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01709442
Contributor : Alexandre Dolgui <>
Submitted on : Thursday, February 15, 2018 - 8:22:15 AM
Last modification on : Thursday, February 27, 2020 - 1:17:38 AM
Document(s) archivé(s) le : Sunday, May 6, 2018 - 1:40:58 PM

File

uniform.pdf
Files produced by the author(s)

Identifiers

Citation

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, Elsevier, 2018, 134, pp.18 - 23. ⟨10.1016/j.ipl.2018.01.009⟩. ⟨hal-01709442⟩

Share

Metrics

Record views

396

Files downloads

280