A POLYNOMIAL-TIME ALGORITHM FOR THE GUILLOTINE PALLET LOADING PROBLEM

A polynomial time algorithm is presented for solving the two-dimensional guillotine cutting stock problem where all small rectangles are of the same dimensions (generating pallet loading patterns). It is based on the initial problem decomposition into three subproblems. Two of these subproblems are solved by dynamic programming recurrence in polynomial time and third subproblem is solved during constant time. This algorithm requires the minimization of linear modulo functions. A polynomial time algorithm is used for this purpose.