When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop - Conference attendances

When Irreducible Bin Packing Leads to Efficient Scheduling in the Routing Open Shop Conference attendances

Language

Английский

Participant type

Секционный

Conference

The 12th Annual Meeting of the Asian Association for Algorithms and Computation
19-21 Apr 2019 , Seoul

Authors

Pyatkin Artem Valerʹevich ¹ , Chernykh Ilya Dmitrievich ¹

Affiliations

1	Sobolev Institute of Mathematics

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