A Scatter Search Algorithm for the Slab Stack Shuffling Problem

  • Xu Cheng
  • Lixin Tang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6145)


Slab Stack Shuffling (SSS) problem is a kind of warehousing operations management problem abstracted from steel industry. SSS problem is to choose appropriate slabs for hot rolling schedule with the objective of minimizing shuffles during the retrieval process. Different from previous literatures, the substitute of slabs is a set of slabs which satisfy the given order demand. The problem in this paper considers balancing the shuffles between two sub-yards and the measurement of one shuffle is also different. The problem is formulated as an integer programming model by considering above practical requirements. The complexity of the model motivated us to develop a scatter search algorithm to solve the problem approximately. Problem-oriented coding scheme and solution combination method are proposed in scatter search. The computational results tested on real data show that the shuffles are decreased by 36.9% in average compared with the manual schedule.


Steel industry The SSS problem Scatter Search algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Assaf, I., Chen, M., Katzberg, J.: Steel Production Schedule Generation. J. International Journal of Production Research 35, 467–477 (1997)zbMATHCrossRefGoogle Scholar
  2. 2.
    Tang, L.X., Liu, J.Y., Rong, A.Y., Yang, Z.H.: An Effective Heuristic Algorithm to Minimise Stack Shuffles in Selecting Steel Slabs from the Slab Yard for Heating and Rolling. Journal of the Operational Research Society 52(10), 1091–1097 (2001)zbMATHCrossRefGoogle Scholar
  3. 3.
    Tang, L.X., Liu, J.Y., Rong, A.Y., Yang, Z.H.: Modeling and A Genetic Algorithm Solution for the Slab Stack Shuffling Problem when Implementing Steel Rolling Schedules. International Journal of Production Research 40(7), 1583–1595 (2002)zbMATHCrossRefGoogle Scholar
  4. 4.
    Singh, K.A., Srinivas, Tiwari, M.K.: Modelling the Slab Stack Shuffling Problem in Developing Steel Rolling Schedules and Its Solution Using Improved Parallel Genetic Algorithms. International Journal of Production Economics 91(2), 135–147 (2004)CrossRefGoogle Scholar
  5. 5.
    Campos, V., Glover, F., Lagua, M.: An Experimental Evaluation of A Scatter Search for the Linear Ordering Problem. Journal of Global Optimization 21, 397–414 (2001)zbMATHCrossRefGoogle Scholar
  6. 6.
    Hamiez, J.P., Hao, J.K.: Scatter Search for Graph Coloring. In: Collet, P., Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M. (eds.) EA 2001. LNCS, vol. 2310, pp. 168–179. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Marti, R., Laguna, M., Glover, F.: Principles of Scatter Search. European Journal of Operational Research 183(1), 100–114 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Xu Cheng
    • 1
  • Lixin Tang
    • 1
  1. 1.Liaoning Key Laboratory of Manufacturing System and Logistics, The Logistics InstituteNortheastern UniversityShenyangChina

Personalised recommendations