Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors

DOI10.1016/J.EJOR.2004.05.023MaRDI QIDQ2569094zbMATH OpenOpenAlexFDO

Authors Yaodong Cui

Publication date 17 October 2005

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2004.05.023

zbMATH Keywords

packingcuttingtwo-dimensional cuttingsilicon steel sheet

Mathematics Subject Classification ID

Production models (90B30)

Recommendations

• Generating optimal T-shape cutting patterns for circular blanks
• A cutting stock problem and its solution in the manufacturing industry of large electric generators
• Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
• Simplest optimal guillotine cutting patterns for strips of identical circles
• A research on the algorithms for generating optimal two-segment cutting patterns with cuts number consideration

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• A Linear Programming Approach to the Cutting-Stock Problem
• A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
• An optimal algorithm for rectangle placement
• Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles
• Cutting rectangles avoiding rectangular defects
• Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
• LP models for bin packing and cutting stock problems
• Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
• Optimising the palletisation of cylinders in cases
• Packing different-sized circles into a rectangular container
• Unbounded knapsack problem: Dynamic programming revisited

Cited in

(10)

• Arc-flow model for the two-dimensional guillotine cutting stock problem
• Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
• Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
• Generating optimal two-section cutting patterns for rectangular blanks
• A bi-objective guillotine cutting problem of stamping strips of equal circles
• A cutting stock problem and its solution in the manufacturing industry of large electric generators
• A simple algorithm for generating optimal equal circle cutting patterns with minimum sections
• Generating optimal T-shape cutting patterns for circular blanks
• Strips minimization in two-dimensional cutting stock of circular items
• Simplest optimal guillotine cutting patterns for strips of identical circles

This page was built for publication: Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569094)