.
Mathematica Applicanda, Tome 27 (1999) no. 41, pp. 35-44.

Voir la notice de l'article provenant de la source Annales Societatis Mathematicae Polonae Series

Heuristics algorithms for the single machine total tardiness problem. This paper presents approximations algorithms for the single machine total weighted tardiness problems. The algorithms is based on a tabu search technique with a specific neighborhood definition. Results of testing the algorithms on large number of randomly generated examples are also given and analysed.
DOI : 10.14708/ma.v27i41.1869
Classification : 90B35 (90C35)
Mots-clés : Scheduling theory, deterministic, Programming involving graphs or networks
@article{10_14708_ma_v27i41_1869,
     author = {Mieczys{\l}aw Wodecki},
     title = {.},
     journal = {Mathematica Applicanda},
     pages = { 35--44},
     publisher = {mathdoc},
     volume = {27},
     number = {41},
     year = {1999},
     doi = {10.14708/ma.v27i41.1869},
     language = {pl},
     url = {http://geodesic.mathdoc.fr/articles/10.14708/ma.v27i41.1869/}
}
TY  - JOUR
AU  - Mieczysław Wodecki
TI  - .
JO  - Mathematica Applicanda
PY  - 1999
SP  -  35
EP  - 44
VL  - 27
IS  - 41
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.14708/ma.v27i41.1869/
DO  - 10.14708/ma.v27i41.1869
LA  - pl
ID  - 10_14708_ma_v27i41_1869
ER  - 
%0 Journal Article
%A Mieczysław Wodecki
%T .
%J Mathematica Applicanda
%D 1999
%P  35-44
%V 27
%N 41
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.14708/ma.v27i41.1869/
%R 10.14708/ma.v27i41.1869
%G pl
%F 10_14708_ma_v27i41_1869
Mieczysław Wodecki. .. Mathematica Applicanda, Tome 27 (1999) no. 41, pp.  35-44. doi : 10.14708/ma.v27i41.1869. http://geodesic.mathdoc.fr/articles/10.14708/ma.v27i41.1869/

Cité par Sources :