Abstract: In order to solve the constrained rectangle cutting problem effectively，a quick model is proposed，which obtains the most optimal scheme by comparing the different layouts of the rectangles.Compared with those of the heuristic algorithms，the speed of the presented algorithm，which is based on the analytic computation completely，is improved remarkably，although the optimal solution can not be found by this algorithm.The experimental results show that the algorithm can get the satisfied layout within a short time and is a promising and efficient guillotine rectangle cutting method.