Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop Научная публикация

Журнал	Lecture Notes in Computer Science ISSN: 0302-9743 , E-ISSN: 1611-3349
Вых. Данные	Год: 2020, Страницы: 106-120 Страниц : 15 DOI: 10.1007/978-3-030-38629-0_9
Ключевые слова	Bin packing to the maximum; Efficient normality; Irreducible Bin Packing; Job aggregation; Polynomially solvable subcase; Routing open shop; Superoverloaded node
Авторы	Chernykh Ilya 1,2,3 , Pyatkin Artem 1,2
Организации	1 Sobolev Institute of Mathematics, Koptyug Avenue 4, Novosibirsk, 630090, Russia 2 Novosibirsk State University, Pirogova Street 2, Novosibirsk, 630090, Russia 3 Novosibirsk State Technical University, Marksa Avenue 20, Novosibirsk, 630073, Russia