A cutting stock problem and its solution in the manufacturing industry of large electric generators
From MaRDI portal
Publication:1777147
Recommendations
- Generating optimal T-shape cutting patterns for circular blanks
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
- Generating optimal two-section cutting patterns for rectangular blanks
- An exact algorithm for generating homogeneous T-shape cutting patterns
Cites work
- A 2-exchange heuristic for nesting problems
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- A Linear Programming Approach to the Cutting-Stock Problem
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- LP models for bin packing and cutting stock problems
- Unbounded knapsack problem: Dynamic programming revisited
Cited in
(6)- Generating optimal T-shape cutting patterns for circular blanks
- Modified greedy heuristic for the one-dimensional cutting stock problem
- Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors
- Dynamic programming algorithms for generating optimal strip layouts
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- Renovation of the cutting stock process
This page was built for publication: A cutting stock problem and its solution in the manufacturing industry of large electric generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777147)