An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times

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

Original language	English
Pages (from-to)	42-84
Number of pages	43
Journal	Сибирские электронные математические известия
Volume	16
DOIs	https://doi.org/10.33048/semi.2019.16.003
Publication status	Published - 1 Jan 2019

FPT-algorithm, Open Shop problem, Parameterized complexity, Routing, Scheduling, UET, routing, scheduling, parameterized complexity, SETUP

ID: 21610275