An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times Full article
| Journal |
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2019, Volume: 16, Pages: 42-84 Pages count : 43 DOI: 10.33048/semi.2019.16.003 | ||||
| Tags | FPT-algorithm; Open Shop problem; Parameterized complexity; Routing; Scheduling; UET | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
Bevern R.A.v.
, Pyatkin A.V.
, Sevastyanov S.V.
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2019. V.16. P.42-84. DOI: 10.33048/semi.2019.16.003 WOS Scopus OpenAlex
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2019. V.16. P.42-84. DOI: 10.33048/semi.2019.16.003 WOS Scopus OpenAlex
Identifiers:
| Web of science: | WOS:000462268100003 |
| Scopus: | 2-s2.0-85067680644 |
| OpenAlex: | W3015742027 |