Advances in Operations Research

Research Article

An Exact Method for the 2D Guillotine Strip Packing Problem

Algorithm 1

Dichotomic Algorithm (Bekrar et al. [14]).
  input: : number of items;
   : list of items with their dimensions;
   : the width of the strip;
   : the limit of the algorithm running time;
  output: , the optimal height to pack all items
 1 //Functions;
 2 UBF(n, listP, W) : the function computing the upper bounds;
 3 (n, listP, W) : the function computing the lower bounds;
 4 OPP(n, S, W1, H1) : this procedure returns TRUE if the set of items can be packed in
  a bin of width and height ;
 5 //initialization;
 6 ;
 7 ;
 8 if then
 9  Return ; STOP;
10 else
11   if OPP TRUE then
12    Return ; STOP;
13   else
14    while do
15      if then
16       Return ; STOP;
17      else
18        ;
19       if OPP then
20         ;
21       else
22         ;