A Simulation-Based Optimization Method for Warehouse Worker Assignment
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 in calculating the benefit of an assignment a...
| Published in: | Algorithms |
|---|---|
| Main Authors: | , , , |
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-12-01
|
| Subjects: | |
| Online Access: | https://www.mdpi.com/1999-4893/13/12/326 |