|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2015, Number 3, Pages 102–109
(Mi basm399)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Research articles
A parametric scheme for online uniform-machine scheduling to minimize the makespan
Alexandre Dolguia, Vladimir Kotovb, Alain Quilliotc a LIMOS, UMR CNRS 6158, Ecole Nationale Superieure des Mines, 158 cours Fauriel, 42023, Saint-Etienne cedex, France
b Belarusian State University, 4, Nezalezhnasti Av., 220030, Minsk, Belarus
c LIMOS, UMR CNRS 6158, ISIMA, Complexe scientifique des Cezeaux, 63173 Aubiere, France
Abstract:
In this paper, we consider the Online Uniform Machine Scheduling problem in the case when speed $s_i=1$ for $i=n-k+1,\dots,n$ and $S_i=s$, $1\leq s\leq2$ for $i=1,\dots,k$, where $k$ is a constant, and we propose a parametric scheme with an asymptotic worst-case behavior (when $m$ tends to infinity).
Keywords and phrases:
online scheduling, uniform parallel machine, worst-case behavior, parametric scheme.
Received: 16.11.2015
Citation:
Alexandre Dolgui, Vladimir Kotov, Alain Quilliot, “A parametric scheme for online uniform-machine scheduling to minimize the makespan”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2015, no. 3, 102–109
Linking options:
https://www.mathnet.ru/eng/basm399 https://www.mathnet.ru/eng/basm/y2015/i3/p102
|
Statistics & downloads: |
Abstract page: | 281 | Full-text PDF : | 49 | References: | 30 |
|