Glass cutting in a small firm

DOI10.1007/BF01588227zbMath0403.90055OpenAlexW2033249055MaRDI QIDQ4189048

Oli B. G. Madsen

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01588227

zbMATH Keywords

KnapsackApproximate SolutionCase StudyCutting SequencingCutting StockGlass IndustrySmall FirmSmall Order Size

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Operations research and management science (90B99)

Related Items

A method for solving the minimization of the maximum number of open stacks problem within a cutting process, Practical adaptations of the Gilmore-Gomory approach to cutting stock problems, An integrated cutting stock and sequencing problem, Heuristic methods to consecutive block minimization, Establishing the optimality of sequencing heuristics for cutting stock problems, Iterated local search for consecutive block minimization, Exponential neighborhood search for consecutive block minimization, Mathematical models for the minimization of open stacks problem, Solving two-dimensional cutting stock problem via a DNA computing algorithm, Exploiting Packing Components in General-Purpose Integer Programming Solvers, Limiting the number of each piece in two-dimensional cutting stock patterns, Knowledge based approach to the cutting stock problem, Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais, Selection of stockplate characteristics and cutting style for two dimensional cutting stock situations, The cutting stock problem in the canvas industry, Heuristic and exact methods for the cutting sequencing problem, Heuristics for sequencing cutting patterns

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• An Algorithm for Reducing the Bandwidth and Profile of a Sparse Matrix
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• The Theory and Computation of Knapsack Functions
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem