|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
P. M. Agzyamova, I. D. Chernykh, “On the two-machine routing open shop on a tree with preemption allowed”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 548–561   |
| 2. |
A. V. Pyatkin, I. D. Chernykh, “On complexity of two-machine routing propotionate open shop”, Sib. Èlektron. Mat. Izv., 19:2 (2022), 528–539 |
|
2012 |
| 3. |
A. V. Pyatkin, I. D. Chernykh, “Preemptive routing open shop on a link”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 65–78 ; J. Appl. Industr. Math., 6:3 (2012), 346–354 |
7
|
|
2006 |
| 4. |
S. V. Sevast'yanov, D. A. Chemisova, I. D. Chernykh, “Some properties of optimal schedules for the Johnson problem with preemption”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006), 83–102  ; J. Appl. Industr. Math., 1:3 (2007), 386–397  |
3
|
|
2001 |
| 5. |
K. N. Kashirskich, A. V. Kononov, S. V. Sevast'yanov, I. D. Chernykh, “A polynomially solvable case of a two-stage open shop problem with three machines”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001), 23–39 |
1
|
|
2000 |
| 6. |
K. N. Kashirskich, S. V. Sevast'yanov, I. D. Chernykh, “A four-parameter analysis of the complexity of the open shop problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000), 59–77 |
3
|
|
1996 |
| 7. |
S. V. Sevast'yanov, I. D. Chernykh, “A sufficient condition for the effective solvability of the open shop problem”, Diskretn. Anal. Issled. Oper., 3:1 (1996), 57–74 |
2
|
|
| Organisations |
|
| |
|
|
Contact us: