Geodesic
A branch-and-bound algorithm for one class of scheduling problem
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 12, pp. 2000-2005 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1992_32_12_a14,
     author = {V. G. Anisimov and E. G. Anisimov},
     title = {A branch-and-bound algorithm for one class of scheduling problem},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {2000--2005},
     year = {1992},
     volume = {32},
     number = {12},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_12_a14/}
}
TY  - JOUR
AU  - V. G. Anisimov
AU  - E. G. Anisimov
TI  - A branch-and-bound algorithm for one class of scheduling problem
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1992
SP  - 2000
EP  - 2005
VL  - 32
IS  - 12
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_12_a14/
LA  - ru
ID  - ZVMMF_1992_32_12_a14
ER  - 
%0 Journal Article
%A V. G. Anisimov
%A E. G. Anisimov
%T A branch-and-bound algorithm for one class of scheduling problem
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1992
%P 2000-2005
%V 32
%N 12
%U http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_12_a14/
%G ru
%F ZVMMF_1992_32_12_a14
V. G. Anisimov; E. G. Anisimov. A branch-and-bound algorithm for one class of scheduling problem. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 32 (1992) no. 12, pp. 2000-2005. http://geodesic.mathdoc.fr/item/ZVMMF_1992_32_12_a14/

[1] Mikhalevich V. S., Kuksa A. I., Metody posledovatelnoi optimizatsii v diskretnykh setevykh zadachakh optimalnogo raspredeleniya resursov, Nauka, M., 1983 | MR | Zbl

[2] Burkov V. N., Lovetskii S. E., “Evristicheskii podkhod k resheniyu dinamicheskikh zadach raspredeleniya resursov”, Avtomatika i telemekhan., 1966, no. 5, 82–90

[3] Burkov V. N., Landa B. D., Lovetskii S. E. i dr., Setevye modeli i zadachi upravleniya, Sov. radio, M., 1967 | Zbl

[4] Shkurba V. V., Podchasova T. P., Pshichuk A. N., Tur L. P., Zadachi kalendarnogo planirovaniya i metody ikh primeneniya, Nauk. dumka, Kiev, 1966

[5] Kuznetsov V. F., “Raspredelenie resursov s uchetom vozmozhnosti ikh peremescheniya pri zadannoi topologii seti”, Avtomatika i telemekhan., 1975, no. 5, 97–105 | MR | Zbl

[6] Konvei R. V., Maksvell V. L., Miller L. V., Teoriya raspisanii, Nauka, M., 1975 | MR

[7] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Per. s angl., Mir, M., 1982 | MR

[8] Podchasova T. P., Portugal V. M., Tatarov V. A., Shkurba V. V., Evristicheskie metody kalendarnogo planirovaniya, Tekhnika, Kiev, 1984

[9] E. G. Kofman (red.), Teoriya raspisanii i vychislitelnye mashiny, Nauka, M., 1984 | MR

[10] Shafranskii V. V., Matematicheskie modeli i metody planirovaniya razvitiya otraslei promyshlennosti, Nauka, M., 1984 | MR

[11] Aleksandrov N. I., Komkov N. I., Modelirovanie organizatsii i upravleniya resheniem nauchno-tekhnicheskikh problem, Nauka, M., 1988