The cutting stock problem (CSP) is an important problem that affects the profit of the processing industries. The CSP that deals with a set of rectangular items is classified as the 2D rectangular cutting stock problem (2DRCSP). Although the 2DRCSP has been researched widely in the field of mathematical programming, the solutions of these studies are not always suitable for the actual manufacturing. This is because most of the existing studies do not consider the cutting process in actual manufacturing. In this report, we formulate a solution for the 2DRCSP with the constraints of the cutting process being considered. As for the approach, we calculate smaller patterns of arrangement and perform all of arrangement by using them iteratively. In addition, we use the simulated annealing method to calculate their length.