An exact solution with an improved running time for the routing flow shop problem with two machines › Research Explorer

Novosibirsk State University's Research Portal

An exact solution with an improved running time for the routing flow shop problem with two machines

Research output: Contribution to journal › Article › peer-review

Theoretical Cybernetics Section

DOI

https://doi.org/10.1007/s10951-023-00784-8
Final published version

Ilya Chernykh
Alexander Kononov
Sergey Sevastyanov

Original language	English
Number of pages	12
Journal	Journal of Scheduling
DOIs	https://doi.org/10.1007/s10951-023-00784-8
Publication status	Published - 2023

Research areas

Dynamic programming, Polynomially solvable case, Routing flow shop, Scheduling

OECD FOS+WOS

1.01 MATHEMATICS

ID: 56438587