Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 1, pp. 80-90
Citer cet article
A. G. Shchukin; N. I. Glebov. On the complexity of some generalizations of Johnson's two-machine problem. Diskretnyj analiz i issledovanie operacij, Tome 3 (1996) no. 1, pp. 80-90. http://geodesic.mathdoc.fr/item/DA_1996_3_1_a7/
@article{DA_1996_3_1_a7,
author = {A. G. Shchukin and N. I. Glebov},
title = {On the complexity of some generalizations of {Johnson's} two-machine problem},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {80--90},
year = {1996},
volume = {3},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_1996_3_1_a7/}
}
TY - JOUR
AU - A. G. Shchukin
AU - N. I. Glebov
TI - On the complexity of some generalizations of Johnson's two-machine problem
JO - Diskretnyj analiz i issledovanie operacij
PY - 1996
SP - 80
EP - 90
VL - 3
IS - 1
UR - http://geodesic.mathdoc.fr/item/DA_1996_3_1_a7/
LA - ru
ID - DA_1996_3_1_a7
ER -
%0 Journal Article
%A A. G. Shchukin
%A N. I. Glebov
%T On the complexity of some generalizations of Johnson's two-machine problem
%J Diskretnyj analiz i issledovanie operacij
%D 1996
%P 80-90
%V 3
%N 1
%U http://geodesic.mathdoc.fr/item/DA_1996_3_1_a7/
%G ru
%F DA_1996_3_1_a7