Ilya Chernykh

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 13

Top Topics

Top Venues

Publications

Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
An exact solution with an improved running time for the routing flow shop problem with two machines. J. Sched. 27 (4) (2024)
Ilya Chernykh, Ekaterina Lgotina
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass. Optim. Methods Softw. 36 (4) (2021)
Ilya Chernykh, Artem V. Pyatkin
Irreducible bin packing and normality in routing open shop. Ann. Math. Artif. Intell. 89 (8-9) (2021)
Ilya Chernykh
Two-Machine Routing Open Shop: How Long Is the Optimal Makespan? MOTOR (2021)
Antonina P. Khramova, Ilya Chernykh
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing. J. Sched. 24 (4) (2021)
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes. CoRR (2020)
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes. MOTOR (2020)
Ilya Chernykh, Olga Krivonogova
On the Optima Localization for the Three-Machine Routing Open Shop. MOTOR (2020)
Ilya Chernykh, Artem V. Pyatkin
Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop. LION (2019)
Ilya Chernykh, Ekaterina Lgotina
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass. CoRR (2019)
Ilya Chernykh, Ekaterina Lgotina
How the Difference in Travel Times Affects the Optima Localization for the Routing Open Shop. MOTOR (2019)
Ilya Chernykh
Routing Open Shop with Unrelated Travel Times. DOOR (2016)
Ilya Chernykh, Ekaterina Lgotina
The 2-Machine Routing Open Shop on a Triangular Transportation Network. DOOR (2016)
Sergey Sevastyanov, D. A. Chemisova, Ilya Chernykh
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion. Ann. Oper. Res. 213 (1) (2014)
Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov
Efficient approximation algorithms for the routing open shop problem. Comput. Oper. Res. 40 (3) (2013)
Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov
The Routing Open Shop Problem: New Approximation Algorithms. WAOA (2009)
Igor Averbakh, Oded Berman, Ilya Chernykh
The routing open-shop problem on a network: Complexity and approximation. Eur. J. Oper. Res. 173 (2) (2006)
Igor Averbakh, Oded Berman, Ilya Chernykh
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network. Eur. J. Oper. Res. 166 (1) (2005)
Igor Averbakh, Oded Berman, Ilya Chernykh
-machine flowshop problem with unit-time operations and intree precedence constraints. Oper. Res. Lett. 33 (3) (2005)