Open AccessAn algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times
Author(s) -
R. A. van Bevern,
A. V. Pyatkin,
Sergey Sevastyanov
Publication year - 2019
Publication title -
sibirskie elektronnye matematicheskie izvestiya
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.468
H-Index - 11
ISSN - 1813-3304
DOI - 10.33048/semi.2019.16.003
Subject(s) - parameterized complexity , schedule , computer science , unit (ring theory) , routing (electronic design automation) , open shop , mathematical optimization , algorithm , job shop scheduling , mathematics , flow shop scheduling , embedded system , operating system , mathematics education
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom