Geodesic
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
Discrete mathematics & theoretical computer science, Tome 8 (2006).

Voir la notice de l'article provenant de la source Episciences

In this paper we study a semi on-line version of the classical multiprocessor scheduling problem on two identical processors. We assume that the sum of the tasks and an upper bound gamma on the size of each task are known. Each task has to be assigned upon arrival and the assignment cannot be changed later. The objective is the minimization of the maximum completion time on the processors. In this paper we propose new algorithms and improve known lower and upper bounds on the competitive ratio. Algorithms and bounds depend on the value of gamma. An optimal algorithm is obtained for gamma in the interval [ 1/n,2(n+1)/n(2n+1) ] and gamma = (2n-1)/2n(n-1), where n is any integer value larger or equal 2. 
@article{DMTCS_2006_8_a8,
     author = {Angelelli, Enrico and Speranza, Maria Grazia and Tuza, Zsolt},
     title = {New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {8},
     year = {2006},
     doi = {10.46298/dmtcs.367},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.367/}
}
TY  - JOUR
AU  - Angelelli, Enrico
AU  - Speranza, Maria Grazia
AU  - Tuza, Zsolt
TI  - New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
JO  - Discrete mathematics & theoretical computer science
PY  - 2006
VL  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.367/
DO  - 10.46298/dmtcs.367
LA  - en
ID  - DMTCS_2006_8_a8
ER  - 
%0 Journal Article
%A Angelelli, Enrico
%A Speranza, Maria Grazia
%A Tuza, Zsolt
%T New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
%J Discrete mathematics & theoretical computer science
%D 2006
%V 8
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.367/
%R 10.46298/dmtcs.367
%G en
%F DMTCS_2006_8_a8
Angelelli, Enrico; Speranza, Maria Grazia; Tuza, Zsolt. New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discrete mathematics & theoretical computer science, Tome 8 (2006). doi : 10.46298/dmtcs.367. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.367/

Cité par Sources :