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

von Chernykh, Ilya
Veröffentlicht in MOTOR (20. : 2021 : Irkutsk) Mathematical Optimization Theory and Operations Research (2021)

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

von Chernykh, Ilya
Veröffentlicht in MOTOR (19. : 2020 : Online) Mathematical optimization theory and operations research (2020)

Efficient Algorithms for the Routing Open Shop with Unrelated Travel Times on Cacti

von Chernykh, Ilya
Veröffentlicht in OPTIMA (10. : 2019 : Petrovac na Moru) Optimization and applications (2020)

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

von Chernykh, Ilya
Veröffentlicht in LION (13. : 2019 : Chania) Learning and intelligent optimization (2020)

Approximation Algorithms for Two-Machine Proportionate Routing Open Shop on a Tree

von Chernykh, Ilya
Veröffentlicht in MOTOR (22. : 2023 : Jekaterinburg) Mathematical optimization theory and operations research (2023)

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

von Chernykh, Ilya
Veröffentlicht in MOTOR (19. : 2020 : Online) Mathematical optimization theory and operations research (2020)

Efficient approximation algorithms for the routing open shop problem

von Chernykh, Ilya
Veröffentlicht in Computers & operations research (2013)