( en | de | ru )

 

Disambiguation of "Chernykh, Ilya"

Author of the publication

copydeleteadd this publication to your clipboard
How the Difference in Travel Times Affects the Optima Localization for the Routing Open Shop.

, and . MOTOR, volume 11548 of Lecture Notes in Computer Science, page 187-201. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Maksym Chernykh

Katja Ilyashava

Rimma Ilyasova

Maxim Ilyasov

Ilya Christoffel

 

Other publications of authors with the same name

A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network., , and . Eur. J. Oper. Res., 166 (1): 3-24 (2005)An exact solution with an improved running time for the routing flow shop problem with two machines., , and . J. Sched., 27 (4): 329-340 (August 2024)How the Difference in Travel Times Affects the Optima Localization for the Routing Open Shop., and . MOTOR, volume 11548 of Lecture Notes in Computer Science, page 187-201. Springer, (2019)A Polynomial-Time Algorithm for the Routing Flow Shop Problem with Two Machines: An Asymmetric Network with a Fixed Number of Nodes., , and . MOTOR, volume 12095 of Lecture Notes in Computer Science, page 301-312. Springer, (2020)The routing open-shop problem on a network: Complexity and approximation., , and . Eur. J. Oper. Res., 173 (2): 531-539 (2006)The 2-Machine Routing Open Shop on a Triangular Transportation Network., and . DOOR, volume 9869 of Lecture Notes in Computer Science, page 284-297. Springer, (2016)On the Optima Localization for the Three-Machine Routing Open Shop., and . MOTOR, volume 12095 of Lecture Notes in Computer Science, page 274-288. Springer, (2020)The m-machine flowshop problem with unit-time operations and intree precedence constraints., , and . Oper. Res. Lett., 33 (3): 263-266 (2005)A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing., and . J. Sched., 24 (4): 405-412 (2021)Routing Open Shop with Unrelated Travel Times.. DOOR, volume 9869 of Lecture Notes in Computer Science, page 272-283. Springer, (2016)