Ilya Chernykh

Available identifiers

zbMath Open chernykh.ilyaMaRDI QIDQ340236

List of research outcomes

Publication	Date of Publication	Type
An exact solution with an improved running time for the routing flow shop problem with two machines	2024-10-16	Paper
Approximation algorithms for two-machine proportionate routing open shop on a tree	2023-08-21	Paper
Two-machine routing open shop: How long is the optimal makespan?	2022-03-22	Paper
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing	2021-12-13	Paper
Irreducible bin packing and normality in routing open shop	2021-11-04	Paper
Efficient algorithms for the routing open shop with unrelated travel times on cacti	2021-09-14	Paper
Sufficient conditions of polynomial solvability of the two-machine preemptive routing open shop on a tree	2021-05-18	Paper
On the optima localization for the three-machine routing open shop	2021-04-19	Paper
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes	2021-04-19	Paper
How the difference in travel times affects the optima localization for the routing open shop	2020-05-19	Paper
Routing Open Shop with Unrelated Travel Times	2018-02-13	Paper
The 2-Machine Routing Open Shop on a Triangular Transportation Network	2018-02-13	Paper
Efficient approximation algorithms for the routing open shop problem	2016-11-14	Paper
The Routing Open Shop Problem: New Approximation Algorithms	2010-05-11	Paper
The routing open-shop problem on a network: complexity and approximation	2006-06-30	Paper
A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network	2005-06-01	Paper
The \(m\)-machine flowshop problem with unit-time operations and intree precedence constraints	2005-06-01	Paper

Research outcomes over time

This page was built for person: Ilya Chernykh