|
This article is cited in 8 scientific papers (total in 8 papers)
Computational mathematics
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
R. A. van Beverna, A. V. Pyatkinb, S. V. Sevastyanovb a Novosibirsk National Research University,
1, str. Pirogova,
Novosibirsk, 630090, Russia
b Sobolev Institute of Mathematics,
4, pr. Koptyuga,
Novosibirsk, 630090, Russia
Abstract:
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))\cdot|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.
Keywords:
$FPT$-algorithm, Open Shop problem, routing, scheduling, UET, parameterized complexity.
Received October 2, 2018, published January 27, 2019
Citation:
R. A. van Bevern, A. V. Pyatkin, S. V. Sevastyanov, “An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times”, Sib. Èlektron. Mat. Izv., 16 (2019), 42–84
Linking options:
https://www.mathnet.ru/eng/semr1059 https://www.mathnet.ru/eng/semr/v16/p42
|
Statistics & downloads: |
Abstract page: | 372 | Full-text PDF : | 157 | References: | 29 |
|