On the one-dimensional stock cutting problem in the paper tube industry
From MaRDI portal
Publication:640306
DOI10.1007/s10951-010-0164-2zbMath1222.90048OpenAlexW1976554482MaRDI QIDQ640306
Hiroshi Nagamochi, Shunji Umetani, Kazuki Matsumoto
Publication date: 18 October 2011
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-010-0164-2
Related Items
A cutting stock problem in the wood products industry: a two‐stage solution approach, Mathematical models for the minimization of open stacks problem, 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 with a limited number of open stacks: bounds and solutions from a new integer linear programming model
Uses Software
Cites Work
- Unnamed Item
- Heuristics for sequencing cutting patterns
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Establishing the optimality of sequencing heuristics for cutting stock problems
- On a pattern sequencing problem to minimize the maximum number of open stacks
- Applications of modern heuristic search methods to pattern sequencing problems
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Improved heuristics for sequencing cutting patterns
- One-dimensional cutting stock problem to minimize the number of different patterns
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An integrated cutting stock and sequencing problem
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- A Linear Programming Approach to the Cutting-Stock Problem
- An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- Pattern reduction in one-dimensional cutting stock problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
