Pattern-based ILP models for the one-dimensional cutting stock problem with setup cost

The one-dimensional cutting stock problem with setup cost (CSP-S) is a cutting problem that seeks a cutting plan with a minimum number of objects and a minimum number of different patterns. This problem gains relevance in manufacturing settings, where time consuming operations to set up the knives o...

Full description

Saved in:
Bibliographic Details
Published inJournal of combinatorial optimization Vol. 44; no. 1; pp. 557 - 582
Main Authors Martin, Mateus, Yanasse, Horacio Hideki, Salles-Neto, Luiz Leduíno
Format Journal Article
LanguageEnglish
Published New York Springer US 01.08.2022
Springer Nature B.V
Subjects
Combinatorics
Convex and Discrete Geometry
Cutlery
Cutting equipment
Integer programming
Iterative methods
Knives
Linear programming
Machine tools
Mathematical Modeling and Industrial Mathematics
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Pareto optimum
Polynomials
Production costs
Theory of Computation
Upper bounds
Integer linear programming
Setup cost
Cutting and packing
Multi-objective optimization
Cutting stock problem
Online AccessGet full text
ISSN1382-6905
1573-2886
DOI10.1007/s10878-022-00848-z

Cover