A 0-1 integer programming model and solving strategies for the slab storage problem. Issue 8 (17th April 2016)

• Record Type: Journal Article
• Authors: Lu, Chao; Zhang, Ruiyou; Liu, Shixin
• Is Part Of: International journal of production research. Volume 54:Issue 8(2016)
• Page Start: 2366
• Page End: 2376
• Publication Date: 2016-04-17
• Subjects: slab yard operation -- slab storage problem -- relocation -- 0-1 integer programming; Factory management -- Periodicals; 658.57
• DOI: 10.1080/00207543.2015.1076949
• Languages: English
• ISSNs: 0020-7543

Abstract

Abstract : 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.