| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 257.71 KB | Adobe PDF |
Advisor(s)
Abstract(s)
This paper proposes a zero-one quadratic assignment model for dealing with the storage location assignment problem when there are weight constraints. Our analysis shows that operations can be improved using our model. When comparing the strategy currently used in a real-life company with the designed model, we found that the new placement of products allowed a reduction of up to 22% on the picking distance. This saving is higher than that achieved with the creation of density zones, a procedure commonly used to deal with weight constraints, according to the literature.
Description
Keywords
Storage location assignment problem (SLAP) Correlated policy Precedence constraints