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

Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X and Bonnet, Louis 2025. Exact algorithms in bar nesting: How to cut general items from linear stocks so that wastage is minimised. Computers & Industrial Engineering 200 , 110838. 10.1016/j.cie.2024.110838

Preview

PDF - Published Version Available under License Creative Commons Attribution. Download (2MB) | Preview

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Additional Information:	License information from Publisher: LICENSE 1: Title: This article is under embargo with an end date yet to be finalised.
Publisher:	Elsevier
ISSN:	0360-8352
Date of First Compliant Deposit:	6 January 2025
Date of Acceptance:	21 December 2024
Last Modified:	08 Jan 2025 11:48
URI:	https://orca.cardiff.ac.uk/id/eprint/175006

Actions (repository staff only)

Edit Item