Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
A Parametric Scheme for Online Uniform-Machine Scheduling to Minimize the Makespan
Authors: Alexandre Dolgui, Vladimir Kotov, Alain Quilliot
– 0.12 Mb
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 \leq 2$ 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).Alexandre Dolgui
LIMOS, UMR CNRS 6158, Ecole Nationale Superieure
des Mines, 158 cours Fauriel, 42023
SAINT-ETIENNE cedex - FRANCE
E-mail:
Vladimir Kotov
Belarusian State University, 4, Nezalezhnasti Av., 220030,
MINSK - BELARUS
E-mail:
Alain Quilliot
LIMOS, UMR CNRS 6158, ISIMA, Complexe scientifique
des Cezeaux, 63173 AUBIERE cedex - FRANCE
E-mail:
LIMOS, UMR CNRS 6158, Ecole Nationale Superieure
des Mines, 158 cours Fauriel, 42023
SAINT-ETIENNE cedex - FRANCE
E-mail:
Vladimir Kotov
Belarusian State University, 4, Nezalezhnasti Av., 220030,
MINSK - BELARUS
E-mail:
Alain Quilliot
LIMOS, UMR CNRS 6158, ISIMA, Complexe scientifique
des Cezeaux, 63173 AUBIERE cedex - FRANCE
E-mail:
Fulltext
– 0.12 Mb
Contents
- On certain subclasses of analytic functions associated with generalized struve functions
- Rational bases of GL(2, R)-comitants and of GL(2, R)-invariants for the planar system of differential equations with nonlinearities of the fourth degree
- Certain classes of p-valent analytic functions with negative coefficients and (lambda,p)-starlike with respect to certain points
- Third Hankel determinant for the inverse of reciprocal of bounded turning functions
- Generating Cubic Equations as a Method for Public Encryption
- Determining the Distribution of the Duration of Stationary Games for Zero-Order Markov Processes with Final Sequence of States
- Cubic differential systems with two affine real non-parallel invariant straight lines of maximal multiplicity
- A Parametric Scheme for Online Uniform-Machine Scheduling to Minimize the Makespan
- On the absence of finite approximation relative to model completeness in propositional provability logic
- Alexei Cașu (Kashu). On his 75th Anniversary.
