Article:

Mhand Hifi. Exact algorithms for the guillotine strip cutting/packing problem. Computers and Operations Research, 25:925-940, 1998

Instances defined:

SCP1-SCP25

Instances used:

-

Results:

The algorithm was coded in C and tested on Sparc-Server20 (module 712 MP).

Problem Strip Width Box Types # Boxes Value Time
SCP1
( 5)
5
10
65
<0.1 s
SCP2
( 4)
5
11
160
1.2 s
SCP3
( 6)
5
15
84
19.4 s
SCP4
( 6)
6
11
120
4.1 s
SCP5
( 20)
5
8
400
0.1 s
SCP6
( 30)
7
7
1140
3.4 s
SCP7
( 15)
5
8
210
1.4 s
SCP8
( 15)
5
12
255
2.3 s
SCP9
( 27)
6
12
1836
0.1 s
SCP10
( 50)
4
8
4000
0.5 s
SCP11
( 27)
10
10
1296
0.7 s
SCP12
( 81)
6
18
2754
2.7 s
SCP13
( 70)
7
7
3500
16.8 s
SCP14
( 100)
4
10
6900
48.7 s
SCP15
( 45)
10
14
1530
165.7 s
SCP16
( 6)
7
14
198
165.7 s
SCP17
( 42)
9
9
1638
323.6 s
SCP18
( 70)
5
10
7070
327.8 s
SCP19
( 5)
6
12
130
473.0 s
SCP20
( 15)
10
10
315
673.9 s
SCP21
( 30)
7
11
4350
2001.8 s
SCP22
( 90)
10
22
3060
757.8 s
SCP23
( 15)
5
12
525
1031.9 s
SCP24
( 50)
10
10
5700
5585.7 s
SCP25
( 25)
15
15
900
2662.9 s