A new heuristic for rectangular stock-cutting problem
Summary: One of the important problems being faced in industry is to find appropriate patterns to cut sheets in order to have a production process with minimum material loss. The problem receives notable attention in several industries, such as steel, textile, paper, glass, wood, etc. In this paper, a new heuristic is proposed to cut rectangular objects with pre-specified length and width from a rectangular stock with limited width and unlimited length. In the proposed algorithm, two sorted lists are used concurrently, one for rectangles and another for positions produced during packing, and the algorithm adaptively decides about the list to be used. The proposed algorithm obtains promising results compared with those previously published in the literature. Extensive computational testing on the problem instances from the literature shows the effectiveness and efficiency of the proposed algorithm.
- Lp-Based Method For The Multi-Sheet Cutting Stock Problem
- An algorithm for a cutting stock problem on a strip
- Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns
- An approach to two-dimensional cutting stock problems
- An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
This page was built for publication: A new heuristic for rectangular stock-cutting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q646775)
