Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 2, pp. 15-32
Citer cet article
A. V. Kononov. Combinatorial complexity of scheduling jobs with simple linear growth of processing times. Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 2, pp. 15-32. http://geodesic.mathdoc.fr/item/DA_1996_3_2_a1/
@article{DA_1996_3_2_a1,
author = {A. V. Kononov},
title = {Combinatorial complexity of scheduling jobs with simple linear growth of processing times},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {15--32},
year = {1996},
volume = {3},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_1996_3_2_a1/}
}
TY - JOUR
AU - A. V. Kononov
TI - Combinatorial complexity of scheduling jobs with simple linear growth of processing times
JO - Diskretnyj analiz i issledovanie operacij
PY - 1996
SP - 15
EP - 32
VL - 3
IS - 2
UR - http://geodesic.mathdoc.fr/item/DA_1996_3_2_a1/
LA - ru
ID - DA_1996_3_2_a1
ER -
%0 Journal Article
%A A. V. Kononov
%T Combinatorial complexity of scheduling jobs with simple linear growth of processing times
%J Diskretnyj analiz i issledovanie operacij
%D 1996
%P 15-32
%V 3
%N 2
%U http://geodesic.mathdoc.fr/item/DA_1996_3_2_a1/
%G ru
%F DA_1996_3_2_a1
