Ilya Chernykh

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