Pattern minimisation in cutting stock problems
Discrete Applied Mathematics
Computers and Operations Research
Generating optimal T-shape cutting patterns for circular blanks
Computers and Operations Research
A hybrid heuristic to reduce the number of different patterns in cutting stock problems
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
INFORMS Journal on Computing
A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
Computers and Operations Research
A pattern generation-integer programming based formulation for the carpet loading problem
Computers and Industrial Engineering
New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
Computers and Operations Research
High density packings of equal circles in rectangles with variable aspect ratio
Computers and Operations Research
| Hi-index | 0.01 |
Circular items are often produced from stock plates using the cutting and stamping process that consists of two stages. A guillotine machine divides the plate into strips at the cutting stage, and then a press punches out the items from the strips at the stamping stage. The cutting cost at the first stage often increases with the number of strips in the cutting plan. An approach is presented for the two-dimensional cutting stock problem of the strips at the cutting stage. The objective is to minimize the sum of the material and the cutting costs. The approach formulates the problem as an integer linear programming, and uses a column generation method for generating the cutting patterns. The cutting patterns have the feature that each cut on the plate produces just one strip. The computational results indicate that the approach can greatly reduce the number of strips in the cutting plan.