On the one-dimensional stock cutting problem in the paper tube industry
From MaRDI portal
Publication:640306
DOI10.1007/S10951-010-0164-2zbMATH Open1222.90048OpenAlexW1976554482MaRDI QIDQ640306FDOQ640306
Authors: Kazuki Matsumoto, Shunji Umetani, Hiroshi Nagamochi 
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
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
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Title not available (Why is that?)
- Pattern reduction in one-dimensional cutting stock problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- 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
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- One-dimensional cutting stock problem to minimize the number of different patterns
- Setup and open-stacks minimization in one-dimensional stock cutting
- Controlling Cutting Pattern Changes in One-Dimensional Trim Problems
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- Applications of modern heuristic search methods to pattern sequencing problems
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- An Application of Travelling-Salesman Routines to Solve Pattern-Allocation Problems in the Glass Industry
- Establishing the optimality of sequencing heuristics for cutting stock problems
- On a pattern sequencing problem to minimize the maximum number of open stacks
- Simulated annealing for order spread minimization in sequencing cutting patterns
- Improved heuristics for sequencing cutting patterns
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- Heuristics for sequencing cutting patterns
Cited In (13)
- A cutting stock problem with alternatives: the tubes rolling process
- Setup and open-stacks minimization in one-dimensional stock cutting
- One-dimensional cutting stock problem with a given number of setups: a hybrid approach of metaheuristics and linear programming
- Alternative configurations for cutting machines in a tube cutting mill
- 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
- 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 optimization in consecutive time periods
- One-dimensional cutting stock problems and solution procedures
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- Mathematical models for the minimization of open stacks problem
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- The one-dimensional cutting stock problem with sequence-dependent cut losses
Uses Software
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)
