Voir la notice de l'article provenant de la source Math-Net.Ru
@article{ISU_2011_11_2_a15, author = {A. M. Magomedov}, title = {The continuous schedule with two-element instructions}, journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics}, pages = {113--119}, publisher = {mathdoc}, volume = {11}, number = {2}, year = {2011}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/ISU_2011_11_2_a15/} }
TY - JOUR AU - A. M. Magomedov TI - The continuous schedule with two-element instructions JO - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics PY - 2011 SP - 113 EP - 119 VL - 11 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ISU_2011_11_2_a15/ LA - ru ID - ISU_2011_11_2_a15 ER -
A. M. Magomedov. The continuous schedule with two-element instructions. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 11 (2011) no. 2, pp. 113-119. http://geodesic.mathdoc.fr/item/ISU_2011_11_2_a15/
[1] Svami M., Tkhulasiraman K., Grafy, seti i algoritmy, Mir, M., 1984, 455 pp.
[2] Magomedov A. M., “Uplotnenie raspisaniya s direktivnym srokom, kratnym kolichestvu zanyatii kazhdogo prepodavatelya”, Mat. zametki, 85:1 (2009), 65–72 | DOI | MR | Zbl
[3] Tanaev V. S., Sotskov Yu. N., Strusevich V. A., Teoriya raspisanii. Mnogostadiinye sistemy, Nauka, M., 1989, 328 pp. | MR | Zbl
[4] Magomedov A. M., “Nepreryvnoe raspisanie dlya spetsializirovannykh protsessorov bez otnosheniya predshestvovaniya”, Vestn. Mosk. energ. in-ta. Ser. Avtomatika, vychislitelnaya tekhnika, informatika, 2009, no. 5, 14–17
[5] Magomedov A. M., Sapozhenko A. A., “Usloviya suschestvovaniya nepreryvnykh raspisanii dlitelnosti pyat”, Vestn. MGU. Ser. Vychislitelnaya matematika i kibernetika, 34:1 (2010), 39–44 | MR | Zbl
[6] Ore O., Teoriya grafov, Nauka. Gl. red. fiz.-mat. lit., M., 1980, 336 pp. | MR