Work

Exact algorithms in bar nesting: How to cut general items from linear stocks so that wastage is minimised

Year: 2024

Type: article

Abstract: This paper proposes exact, polynomial-time algorithms that solve the problem of cutting items with angled sides from a single linear stock so that wastage is minimised. In industry, this problem is called “bar nesting”. Here we give an algorithmic framework that solves several important variants of the problem, including cutting items from stocks with asymmetric cross-sections, cutting items whose sides occur on different planes, and the minimum score separation problem. • Exact, polynomial-time algorithms are given for single-stock bar nesting problems. • Several industry-related problem variants are considered. • Correctness proofs and source code are provided.

Source: Computers & Industrial Engineering

DOI: 10.1016/j.cie.2024.110838

Authors: Rhyd Lewis, Louis Bonnet

Institutions: Cardiff University, Centre National de la Recherche Scientifique, Laboratoire d'Analyse et d'Architecture des Systèmes

Language: English

Topic: Optimization and Packing Problems

Subfield: Industrial and Manufacturing Engineering

Field: Engineering

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,440

OpenAlex ID: W4405950604

FWCI: 0.209

Cites: 21

Cited by: 1

Related to: 10