A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry

European Journal of Operational Research

Volumn 141, Issue 2, 2002, Pages 328-340

  Armbruster, Michael ^a  

^a CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Cutting stock problem; Heuristic; Pattern sequencing

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INTEGER PROGRAMMING; IRON AND STEEL INDUSTRY; PROBLEM SOLVING;

CUTTING STOCK PROBLEM; PATTERN SEQUENCING PROBLEM;

INVENTORY CONTROL;

EID: 0036722352     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00128-5     Document Type: Article

References (15)

1. Heuristic and exact methods for the cutting sequencing problem
2. Simulated annealing for order spread minimization in sequencing cutting patterns
3. A linear programming approach to the cutting-stock problem
4. A linear programming approach to the cutting-stock problem - Part II
5. Near-optimal solutions to one-dimensional cutting stock problems
6. Heuristics for the one-dimensional cutting stock problem: A computational study
7. On a pattern sequencing problem to minimize the maximum number of open stacks
8. Heuristics for sequencing cutting patterns
9. Establishing the optimality of sequencing heuristics for cutting stock problems
10. Improved heuristics for sequencing cutting patterns