When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop Conference attendances
| Language | Английский | ||
|---|---|---|---|
| Participant type | Секционный | ||
| URL | https://toc.yonsei.ac.kr/aaac2019/ | ||
| Conference |
The 12th Annual Meeting of the Asian Association for Algorithms and Computation 19-21 Apr 2019 , Seoul |
||
| Authors |
|
||
| Affiliations |
|
Cite:
Chernykh I.
, Pyatkin A.
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