|
|
|
|
|
Odkhishig Ganbold, Kaustav Kundu, Haobin Li and Wei Zhang
The general assignment problem is a classical NP-hard (non-deterministic polynomial-time) problem. In a warehouse, the constraints on the equipment and the characteristics of consecutive processes make it even more complicated. To overcome the difficulty...
ver más
|
|
|
|
|