Задача безотходного гильотинного ориентированного раскроя параллелепипеда на две детали

Abstract

Cutting and packing problems appears as application both in industry, transport, manufacture, as in ensemble of domains of mathematics, physics, biology. In this article we consider a non-trim three­dimensional guillotine cutting problem with two details. The rotations of details are not permitted. We don't take into account the assortiment of the details. We propose a polynomial-time algorithm for this problem.