A Slicing Tree Representation and QCP-Model-Based Heuristic Algorithm for the Unequal-Area Block Facility Layout Problem

Table 1

Problem set data.

Problem; set	No. of dpt.	Problem; data	Width	Height	Shape; constraint
O7	7	[15]	8.54	13.00	𝛼^max=4
O8	8	[15]	11.31	13.00	𝛼^max=4
O9	9	[15]	12.00	13.00	𝛼^max=5
FO7	7	[15]	8.54	13.00	𝛼^max=5
FO8	8	[15]	11.31	13.00	𝛼^max=5
vC10Rs	10	[29]	51.00	25.00	𝜌^min=5
vC10Ra	10	[29]	51.00	25.00	𝛼^max=5
M11*	11	[30]	6.00	6.00	𝛼^max=5
Nug12	12	[31]	4.00	3.00	𝛼^max=5
AB20	20	[2]	30.00	20.00	𝛼^max=4

𝛼^max: maximum aspect ratio constraints.
𝜌^min: minimum side length constraints.