Chernykh Ilya Dmitrievich

Publications in Math-Net.Ru

1. On the two-machine routing open shop on a tree with preemption allowed
   
   Sib. Èlektron. Mat. Izv., 19:2 (2022),  548–561
2. On complexity of two-machine routing propotionate open shop
   
   Sib. Èlektron. Mat. Izv., 19:2 (2022),  528–539
3. Preemptive routing open shop on a link
   
   Diskretn. Anal. Issled. Oper., 19:3 (2012),  65–78
4. Some properties of optimal schedules for the Johnson problem with preemption
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006),  83–102
5. 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
6. A four-parameter analysis of the complexity of the open shop problem
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  59–77
7. A sufficient condition for the effective solvability of the open shop problem
   
   Diskretn. Anal. Issled. Oper., 3:1 (1996),  57–74