Geodesic
An efficiently solvable case of the scheduling problem with renewable resources
Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 1, pp. 75-82.

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

@article{DA_2000_7_1_a6,
     author = {V. V. Servakh},
     title = {An efficiently solvable case of the scheduling problem with renewable resources},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {75--82},
     publisher = {mathdoc},
     volume = {7},
     number = {1},
     year = {2000},
     language = {ru},
     url = {https://geodesic-test.mathdoc.fr/item/DA_2000_7_1_a6/}
}
TY  - JOUR
AU  - V. V. Servakh
TI  - An efficiently solvable case of the scheduling problem with renewable resources
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2000
SP  - 75
EP  - 82
VL  - 7
IS  - 1
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DA_2000_7_1_a6/
LA  - ru
ID  - DA_2000_7_1_a6
ER  - 
%0 Journal Article
%A V. V. Servakh
%T An efficiently solvable case of the scheduling problem with renewable resources
%J Diskretnyj analiz i issledovanie operacij
%D 2000
%P 75-82
%V 7
%N 1
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DA_2000_7_1_a6/
%G ru
%F DA_2000_7_1_a6
V. V. Servakh. An efficiently solvable case of the scheduling problem with renewable resources. Diskretnyj analiz i issledovanie operacij, Tome 7 (2000) no. 1, pp. 75-82. https://geodesic-test.mathdoc.fr/item/DA_2000_7_1_a6/