|
|
|
Publications in Math-Net.Ru |
Citations |
|
1992 |
| 1. |
K. V. Shakhbazyan, N. B. Lebedinskaya, “Lattices of processes for graphs”, Zap. Nauchn. Sem. POMI, 202 (1992), 135–153    ; J. Math. Sci., 79:3 (1996), 1115–1125 |
|
1987 |
| 2. |
N. B. Lebedinskaya, T. E. Safonova, “Stability of optimal structured schedule”, Zap. Nauchn. Sem. LOMI, 159 (1987), 56–68 |
|
1983 |
| 3. |
N. B. Lebedinskaya, “On one algorithm for finding an optimal structural schedule”, Zap. Nauchn. Sem. LOMI, 124 (1983), 5–20 |
|
1981 |
| 4. |
K. V. Shakhbazyan, N. B. Lebedinskaya, “Effective optimization methods for single-machine scheduling (Survey)”, Zap. Nauchn. Sem. LOMI, 111 (1981), 195–217 ; J. Soviet Math., 24:1 (1984), 133–148 |
3
|
|
1980 |
| 5. |
N. B. Lebedinskaya, “Minimization of maximum penalty in the case of preemption of jobs”, Zap. Nauchn. Sem. LOMI, 102 (1980), 61–67 ; J. Soviet Math., 22:2 (1983), 1203–1207 |
|
1978 |
| 6. |
N. B. Lebedinskaya, “Minimization of the maximum deviation with preemption”, Zap. Nauchn. Sem. LOMI, 80 (1978), 117–124 ; J. Soviet Math., 28:3 (1985), 354–359 |
2
|
|
1977 |
| 7. |
K. V. Shakhbazyan, N. B. Lebedinskaya, “Minimization of the total cost in the problem of parallel ordering of $n$ independent tasks”, Dokl. Akad. Nauk SSSR, 237:4 (1977), 790–792 |
| 8. |
K. V. Shakhbazyan, N. B. Lebedinskaya, “Optimal schedulings with gaps for independent jobs in a service system with $N$ servers”, Zap. Nauchn. Sem. LOMI, 70 (1977), 205–231 ; J. Soviet Math., 23:1 (1983), 2033–2056 |
4
|
|
1974 |
| 9. |
K. V. Shakhbazyan, T. A. Tushkina, N. B. Lebedinskaya, “Some algorithm of the construction of the optimal Schedule for parallelsequential networks”, Zap. Nauchn. Sem. LOMI, 48 (1974), 200–204 |
|
| Organisations |
|
| |
|
|
Contact us: