( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
How the Difference in Travel Times Affects the Optima Localization for the Routing Open Shop.

, и . MOTOR, том 11548 из Lecture Notes in Computer Science, стр. 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.

Maksym Chernykh

Katja Ilyashava

Maxim Ilyasov

Rimma Ilyasova

Ilya Pavlyukevich

 

Другие публикации лиц с тем же именем

A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network., , и . Eur. J. Oper. Res., 166 (1): 3-24 (2005)The routing open-shop problem on a network: Complexity and approximation., , и . Eur. J. Oper. Res., 173 (2): 531-539 (2006)The 2-Machine Routing Open Shop on a Triangular Transportation Network., и . DOOR, том 9869 из Lecture Notes in Computer Science, стр. 284-297. Springer, (2016)On the Optima Localization for the Three-Machine Routing Open Shop., и . MOTOR, том 12095 из Lecture Notes in Computer Science, стр. 274-288. Springer, (2020)How the Difference in Travel Times Affects the Optima Localization for the Routing Open Shop., и . MOTOR, том 11548 из Lecture Notes in Computer Science, стр. 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., , и . MOTOR, том 12095 из Lecture Notes in Computer Science, стр. 301-312. Springer, (2020)The m-machine flowshop problem with unit-time operations and intree precedence constraints., , и . 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., и . J. Sched., 24 (4): 405-412 (2021)Routing Open Shop with Unrelated Travel Times.. DOOR, том 9869 из Lecture Notes in Computer Science, стр. 272-283. Springer, (2016)Two-Machine Routing Open Shop: How Long Is the Optimal Makespan?. MOTOR, том 12755 из Lecture Notes in Computer Science, стр. 253-266. Springer, (2021)