.png){kind=icon}
.png){kind=icon}
Return
A 0-1 integer programming model and solving strategies for the slab storage problem
.png){kind=icon}
PRE
AI
DOI：10.1080/00207543.2015.1076949.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We consider the slab storage problem (SSP) in slab yard operations. A set of slabs enter a slab yard in a specific order. A proper stack needs to be selected for each inbound slab, so that the number of relocations in the subsequent retrieval stage is minimised. We present a 0-1 integer programming model of the SSP that minimises the lower bound of the number of relocations. Four solving strategies are derived from several interesting properties of the mathematical model to speed up the solving process of the model. Making use of randomly generated instances and practical instances, we testify the effectiveness of the solving strategies and study the influence of problem parameters on the computational time of the model. Computational results show that the solving strategies can effectively reduce the computational time of the model and is applicable in medium-sized practical instances.
Keywords:
0-1 integer programming
slab yard operation
relocation
slab storage problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W