The following give various basic CSP models of this problem [frisch2001modelling], [frisch2001symmetry] [hnich2004hybrid].
More recent results, and more sophisticated models can be found in the following [gargani2007efficient] [schaus2011solving] [heinz2012solving].
This paper describes the closely related variable-sized bin-packing with colour constraints problem, and approximation algorithms to solve it [dawande2001variable].
This paper describes a more general (and significantly more complex) version of the steel mill problem [kalagnanam1998inventory].
[heinz2012solving]
Solving steel mill slab design problems
Constraints 17(1),
2012
[schaus2011solving]
Solving steel mill slab problems with constraint-based techniques: CP, LNS, and CBLS
Constraints 16(2),
2011
[gargani2007efficient]
An efficient model and strategy for the steel mill slab design problem
Principles and Practice of Constraint Programming–CP 2007,
2007
[hnich2004hybrid]
Hybrid modelling for robust solving
Annals of Operations Research 130(1-4),
2004
[dawande2001variable]
Variable sized bin packing with color constraints
Electronic Notes in Discrete Mathematics,
2001
[frisch2001modelling]
Modelling a steel mill slab design problem
Proceedings of the IJCAI-01 workshop on modelling and solving problems with constraints,
2001
[frisch2001symmetry]
Symmetry and implied constraints in the steel mill slab design problem
Proc. CP’01 Wshop on Modelling and Problem Formulation,
2001
[kalagnanam1998inventory]
Inventory matching problems in the steel industry
1998