2018 Volume 54 Issue 2 Pages 298-306
In the steel industry, the role of the slab yard which is the intermediate process between the steel-making and the rolling is becoming significant. By promoting the logistics from steel-making to rolling, we can reduce the cost of fuel to reheating and improve the productivity. In the yard slabs are expected to be sorted into stacks as little transport as possible and as high as possible. It is the slab stacking problem. In this paper, we find the slab stacking problem has the similar structure with the set partitioning problem. And by using this feature, we formulate the slab stacking problem with the 0-1 programming. In addition, we show the efficient method of numerating the feasible stacks. Finally we prove the efficiency of this method with the computational experiment using the real operational data.
