When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop Доклады на конференциях
| Язык | Английский | ||
|---|---|---|---|
| Тип доклада | Секционный | ||
| Конференция |
The 12th Annual Meeting of the Asian Association for Algorithms and Computation 19-21 апр. 2019 , Seoul |
||
| Авторы |
|
||
| Организации |
|
Библиографическая ссылка:
Pyatkin A.V.
, Chernykh I.D.
When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop
The 12th Annual Meeting of the Asian Association for Algorithms and Computation 19-21 Apr 2019
When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop
The 12th Annual Meeting of the Asian Association for Algorithms and Computation 19-21 Apr 2019