Abstract: Giving the definitions of all kinds of modules and proving some of their properties, an algorithm for solving the laying-off problem was designed in terms of these definitions and properties. The idea of the algorithm has two steps： handling the fundamental module first and then planning its layout in two different cases. The complexity and generality of the algorithm were analyzed. Three examples were given. The results show that the cutting efficiency is more satisfactory.

Key words: basic subject of science and technology for computer , laying-off problem , foundational module , lay?out of the module , algorithm , complexity