A one-dimensional cutting stock problem in the aluminium industry and its solution

DOI10.1016/0377-2217(90)90356-GzbMath0684.90049OpenAlexW2028332213MaRDI QIDQ1825753

Hartmut Stadtler

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90356-g

zbMATH Keywords

column generationone-dimensional cutting stockfirst fit decreasing heuristicreal world cutting stock

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Production models (90B30) Combinatorial optimization (90C27)

Related Items (29)

Solving binary cutting stock problems by column generation and branch- and-bound ⋮ A residual recombination heuristic for one-dimensional cutting stock problems ⋮ Procedures for solving a 1-dimensional cutting problem ⋮ The nesting problem in the leather manufacturing industry ⋮ The one dimensional Compartmentalised Knapsack problem: a case study ⋮ An integrated cutting stock and sequencing problem ⋮ Optimization of roll cutting in clothing industry ⋮ Heuristics for the integer one-dimensional cutting stock problem: A computational study ⋮ CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Sufficient condition for partial efficiency in a bicriteria nonlinear cutting stock problem ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ A hybrid heuristic to reduce the number of different patterns in cutting stock problems ⋮ Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches ⋮ Classification and literature review of integrated lot-sizing and cutting stock problems ⋮ Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths ⋮ Modified greedy heuristic for the one-dimensional cutting stock problem ⋮ A hybrid approach for optimization of one-dimensional cutting ⋮ A simulated annealing heuristic for the one-dimensional cutting stock problem ⋮ Random search in the one-dimensional cutting stock problem ⋮ Setup minimising conditions in the trim loss problem ⋮ The one-dimensional cutting stock problem with usable leftover - a heuristic approach ⋮ Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound ⋮ A genetic algorithm solution for one-dimensional bundled stock cutting ⋮ LP models for bin packing and cutting stock problems ⋮ Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths ⋮ Simulated annealing for order spread minimization in sequencing cutting patterns ⋮ Evaluation of algorithms for one-dimensional cutting ⋮ One-dimensional cutting stock problem to minimize the number of different patterns

Cites Work

• An instance of the cutting stock problem for which the rounding property does not hold
• Near-optimal solutions to one-dimensional cutting stock problems
• A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
• Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979)
• A Linear Programming Approach to the Cutting-Stock Problem
• A Study of Composite Heuristic Algorithms
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A one-dimensional cutting stock problem in the aluminium industry and its solution