Article Dans Une Revue Computers & Industrial Engineering Année : 2025

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

Résumé

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.

Fichier principal
Vignette du fichier
BarNestingPaper_2025.pdf (1.92 Mo) Télécharger le fichier
Origine Publication financée par une institution
Licence

Dates et versions

hal-05069687 , version 1 (15-05-2025)

Licence

Identifiants

Citer

Rhyd Lewis, Louis Bonnet. Exact algorithms in bar nesting: How to cut general items from linear stocks so that wastage is minimised. Computers & Industrial Engineering, 2025, 200, pp.110838. ⟨10.1016/j.cie.2024.110838⟩. ⟨hal-05069687⟩
359 Consultations
196 Téléchargements

Altmetric

Partager

  • More