Ilya Chernykh

According to our database, Ilya Chernykh authored at least 16 papers between 2005 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing.

Antonina P. Khramova, Ilya Chernykh

J. Sched., 2021

Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass.

Ilya Chernykh, Ekaterina Lgotina

Optim. Methods Softw., 2021

Irreducible bin packing and normality in routing open shop.

Ilya Chernykh, Artem V. Pyatkin

Ann. Math. Artif. Intell., 2021

Two-Machine Routing Open Shop: How Long Is the Optimal Makespan?

Ilya Chernykh

Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

2020

A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes.

Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov

Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

On the Optima Localization for the Three-Machine Routing Open Shop.

Ilya Chernykh, Olga Krivonogova

Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

2019

How the Difference in Travel Times Affects the Optima Localization for the Routing Open Shop.

Ilya Chernykh, Ekaterina Lgotina

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop.

Ilya Chernykh, Artem V. Pyatkin

Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

2016

The 2-Machine Routing Open Shop on a Triangular Transportation Network.

Ilya Chernykh, Ekaterina Lgotina

Proceedings of the Discrete Optimization and Operations Research, 2016

Routing Open Shop with Unrelated Travel Times.

Ilya Chernykh

Proceedings of the Discrete Optimization and Operations Research, 2016

2014

On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion.

Sergey Sevastyanov, D. A. Chemisova, Ilya Chernykh

Ann. Oper. Res., 2014

2013

Efficient approximation algorithms for the routing open shop problem.

Ilya Chernykh, Alexander V. Kononov, Sergey Sevastyanov

Comput. Oper. Res., 2013

2009

The Routing Open Shop Problem: New Approximation Algorithms.

Ilya Chernykh, Nikita Dryuck, Alexander V. Kononov, Sergey Sevastyanov

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

2006

The routing open-shop problem on a network: Complexity and approximation.

Igor Averbakh, Oded Berman, Ilya Chernykh

Eur. J. Oper. Res., 2006

2005

The <i>m</i>-machine flowshop problem with unit-time operations and intree precedence constraints.

Igor Averbakh, Oded Berman, Ilya Chernykh

Oper. Res. Lett., 2005

A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network.

Igor Averbakh, Oded Berman, Ilya Chernykh

Eur. J. Oper. Res., 2005