## René A. van Bevern, Artem V. Pyatkin, and Sergey V. Sevastyanov.
An algorithm with parameterized complexity of constructing the
optimal schedule for the routing open shop problem with unit execution times.
*Siberian Electronic Mathematical Reports*, 16:42–84, 2019.

For the Routing Open Shop problem with unit
execution times, the first algorithm with
parameterized complexity is designed for
constructing an optimal schedule. Its running time
is bounded by a function (Pol(|V |) + f(m, g))·|I|,
where Pol(|V|) is a polynomial of the number of
network nodes, f(m, g) is a function of the number
of machines and the number of job locations, and |I|
is the input length in its compact encoding.

[ bib |
DOI |
.pdf ]
Back

*This file was generated by
bibtex2html 1.98.*