A branch and bound algorithm for class based storage location assignment (Q2480991): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Storage-Retrieval Interleaving in Automatic Warehousing Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Research on warehouse operation: a comprehensive review / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal Storage Assignment in Automatic Warehousing Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Expected travel time and optimal boundary formulas for a two-class-based automated storage/retrieval system / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A revised proof of optimality for the cube-per-order index rule for stored item location / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Warehouse design and control: Framework and literature review / rank | |||
Normal rank | |||
Latest revision as of 19:58, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for class based storage location assignment |
scientific article |
Statements
A branch and bound algorithm for class based storage location assignment (English)
0 references
7 April 2008
0 references
branch and bound
0 references
class based storage
0 references
order picking
0 references
storage space
0 references
warehouse storage planning
0 references
0 references
0 references
