Geodesic
Polynomial solvability of scheduling problems with storable resources and directive deadlines
Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 1, pp. 9-34.

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

@article{DA_2000_7_1_a1,
     author = {E. Kh. Gimadi and V. V. Zalyubovskii and S. V. Sevast'yanov},
     title = {Polynomial solvability of scheduling problems with storable resources and directive deadlines},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {9--34},
     publisher = {mathdoc},
     volume = {7},
     number = {1},
     year = {2000},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2000_7_1_a1/}
}
TY  - JOUR
AU  - E. Kh. Gimadi
AU  - V. V. Zalyubovskii
AU  - S. V. Sevast'yanov
TI  - Polynomial solvability of scheduling problems with storable resources and directive deadlines
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2000
SP  - 9
EP  - 34
VL  - 7
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2000_7_1_a1/
LA  - ru
ID  - DA_2000_7_1_a1
ER  - 
%0 Journal Article
%A E. Kh. Gimadi
%A V. V. Zalyubovskii
%A S. V. Sevast'yanov
%T Polynomial solvability of scheduling problems with storable resources and directive deadlines
%J Diskretnyj analiz i issledovanie operacij
%D 2000
%P 9-34
%V 7
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2000_7_1_a1/
%G ru
%F DA_2000_7_1_a1
E. Kh. Gimadi; V. V. Zalyubovskii; S. V. Sevast'yanov. Polynomial solvability of scheduling problems with storable resources and directive deadlines. Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 1, pp. 9-34. http://geodesic.mathdoc.fr/item/DA_2000_7_1_a1/