Pages that link to "Item:Q2480991"
From MaRDI portal
The following pages link to A branch and bound algorithm for class based storage location assignment (Q2480991):
Displaying 5 items.
- A travel time estimation model for a high-level picker-to-part system with class-based storage policies (Q296631) (← links)
- Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional (Q998681) (← links)
- New solution procedures for the order picker routing problem in U-shaped Pick areas with a movable depot (Q2152010) (← links)
- Storage location assignment of steel coils in a manufacturing company: an integer linear programming model and a greedy randomized adaptive search procedure (Q2701171) (← links)
- Class-Based Storage Assignment in a Unit-Load Warehouse Employing AS/RS with Inventory Space Allocation Considering Product Specific Setup to Holding Cost Ratio (Q2931170) (← links)