A 0-1 integer programming model and solving strategies for the slab storage problem
针对板坯堆场中如何为每块入库板坯选择合适堆垛以最小化后续取料时的倒垛次数，建立了0-1整数规划模型，并利用模型性质提出四种加速求解策略，在随机和实际算例中验证了有效性。
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.