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

Результат исследования: Научные публикации в периодических изданияхстатья

3 Цитирования (Scopus)

Аннотация

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.

Язык оригиналаанглийский
Страницы (с-по)42-84
Число страниц43
ЖурналSiberian Electronic Mathematical Reports
Том16
DOI
СостояниеОпубликовано - 1 янв 2019

Fingerprint Подробные сведения о темах исследования «An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times». Вместе они формируют уникальный семантический отпечаток (fingerprint).

  • Цитировать