Geodesic
Running time of local search algorithms for a~scheduling problem on the parallel machines
Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 5, pp. 21-34

Voir la notice de l'article provenant de la source Math-Net.Ru

We study behavior of local search algorithms with quadratic neighborhoods for the NP-hard scheduling problem $P\|C_{\max}$. We obtain new upper and lower bounds for the running time of the local search algorithms with the given pivoting rule. Bibliogr. 11.
Keywords: local search algorithm, neighborhood, running time of the algorithm, upper and lower bounds. 
@article{DA_2012_19_5_a1,
     author = {Yu. Yu. Velikanova},
     title = {Running time of local search algorithms for a~scheduling problem on the parallel machines},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {21--34},
     publisher = {mathdoc},
     volume = {19},
     number = {5},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2012_19_5_a1/}
}
TY  - JOUR
AU  - Yu. Yu. Velikanova
TI  - Running time of local search algorithms for a~scheduling problem on the parallel machines
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2012
SP  - 21
EP  - 34
VL  - 19
IS  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2012_19_5_a1/
LA  - ru
ID  - DA_2012_19_5_a1
ER  - 
%0 Journal Article
%A Yu. Yu. Velikanova
%T Running time of local search algorithms for a~scheduling problem on the parallel machines
%J Diskretnyj analiz i issledovanie operacij
%D 2012
%P 21-34
%V 19
%N 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2012_19_5_a1/
%G ru
%F DA_2012_19_5_a1
Yu. Yu. Velikanova. Running time of local search algorithms for a~scheduling problem on the parallel machines. Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 5, pp. 21-34. http://geodesic.mathdoc.fr/item/DA_2012_19_5_a1/