On the one-dimensional stock cutting problem in the paper tube industry
From MaRDI portal
(Redirected from Publication:640306)
Recommendations
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- One-dimensional cutting stock problems and solution procedures
- scientific article; zbMATH DE number 1594516
- A cutting stock problem with alternatives: the tubes rolling process
- One-dimensional cutting stock optimization in consecutive time periods
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process
- An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
- An integrated cutting stock and sequencing problem
- Applications of modern heuristic search methods to pattern sequencing problems
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Establishing the optimality of sequencing heuristics for cutting stock problems
- Heuristics for sequencing cutting patterns
- Improved heuristics for sequencing cutting patterns
- On a pattern sequencing problem to minimize the maximum number of open stacks
- One-dimensional cutting stock problem to minimize the number of different patterns
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- Pattern reduction in one-dimensional cutting stock problems
- Setup and open-stacks minimization in one-dimensional stock cutting
- Simulated annealing for order spread minimization in sequencing cutting patterns
Cited in
(13)- One-dimensional cutting stock problems and solution procedures
- The one-dimensional cutting stock problem with sequence-dependent cut losses
- A cutting stock problem with alternatives: the tubes rolling process
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- A cutting stock problem in the wood products industry: a two‐stage solution approach
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing
- Setup and open-stacks minimization in one-dimensional stock cutting
- Alternative configurations for cutting machines in a tube cutting mill
- Mathematical models for the minimization of open stacks problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- One-dimensional cutting stock optimization in consecutive time periods
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
This page was built for publication: On the one-dimensional stock cutting problem in the paper tube industry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640306)
