Ilya Chernykh
Orcid: 0000-0001-5671-8562
According to our database1,
Ilya Chernykh
authored at least 17 papers
between 2005 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
An exact solution with an improved running time for the routing flow shop problem with two machines.
J. Sched., August, 2024
2021
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing.
J. Sched., 2021
Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass.
Optim. Methods Softw., 2021
Ann. Math. Artif. Intell., 2021
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.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2020
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.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop.
Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019
2016
Proceedings of the Discrete Optimization and Operations Research, 2016
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.
Ann. Oper. Res., 2014
2013
Comput. Oper. Res., 2013
2009
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009
2006
Eur. J. Oper. Res., 2006
2005
The <i>m</i>-machine flowshop problem with unit-time operations and intree precedence constraints.
Oper. Res. Lett., 2005
A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network.
Eur. J. Oper. Res., 2005