Keyword: cutting stock

Found 79 papers in total
Sufficient condition for partial efficiency in a bicriteria nonlinear cutting stock problem
Sufficient condition for partial efficiency in a bicriteria nonlinear cutting stock problem
2017,
This work presents a sufficient criteria for partial efficient solutions of the...
A study on decision making of cutting stock with frustum of cone bars
A study on decision making of cutting stock with frustum of cone bars
2017,
This paper considers the cutting stock problem with frustum of cone bars. A multiple...
Mathematical models and routing algorithms for CAD technological preparation of cutting processes
Mathematical models and routing algorithms for CAD technological preparation of cutting processes
2017,
Resource‐conscious technologies for cutting sheet material include the ICP and...
New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers
New model and heuristic solution approach for one-dimensional cutting stock problem with usable leftovers
2017,
In the one‐dimensional cutting stock problem with usable leftovers (1DCSPUL),...
New solutions to the constrained compartmentalised knapsack problem
New solutions to the constrained compartmentalised knapsack problem
2017,
The compartmentalised knapsack problem has been described in the literature as...
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
2016,
We propose a new exact algorithm for the two‐dimensional...
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
2016,
We propose a framework to model general guillotine restrictions in...
An integrated genetic algorithm approach to 1D-cutting stock problem
An integrated genetic algorithm approach to 1D-cutting stock problem
2016,
Manufacturing industries face trim minimisation problem, which if not effectively...
Quasi-phi-functions and optimal packing of ellipses
Quasi-phi-functions and optimal packing of ellipses
2016,
We further develop our phi‐function technique for solving Cutting and Packing...
Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization
Cutting and packing problems for irregular objects with continuous rotations: mathematical modelling and non-linear optimization
2016,
We further improve our methodology for solving irregular packing and cutting problems....
An arc flow-based optimization approach for the two-stage guillotine strip cutting problem
An arc flow-based optimization approach for the two-stage guillotine strip cutting problem
2015,
Despite its broad range of industrial applications, the two‐stage guillotine...
One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
2016,
We address a one‐dimensional cutting stock problem where, in addition to...
A biased random-key genetic algorithm for the minimization of open stacks problem
A biased random-key genetic algorithm for the minimization of open stacks problem
2016,
This paper describes a biased random‐key genetic algorithm (BRKGA) for the...
Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
2016,
Cut order planning (COP) is an NP‐hard nonlinear optimization problem. Managers...
Heuristic for constrained two-dimensional three-staged patterns
Heuristic for constrained two-dimensional three-staged patterns
2015,
Three‐staged cutting patterns are often used in dividing large plates into...
On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
2015,
Many cutting problems on two- or three-dimensional objects require that the cuts be...
Max‐k‐Cut by the Discrete Dynamic Convexized Method
Max‐k‐Cut by the Discrete Dynamic Convexized Method
2013,
In this paper, we propose a ‘multistart‐type’ algorithm for solving...
A New Graph‐Theoretical Model for the Guillotine‐Cutting Problem
A New Graph‐Theoretical Model for the Guillotine‐Cutting Problem
2013,
We consider the problem of determining whether a given set of rectangular items can be...
A new dynamic programming procedure for three‐staged cutting patterns
A new dynamic programming procedure for three‐staged cutting patterns
2013,
Three‐staged patterns are often used to solve the 2D cutting stock problem of...
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
Semidefinite Programming Based Algorithms for the Sparsest Cut Problem
2011,
In this paper we analyze a known relaxation for the Sparsest Cut problem based on...
Multi‐dimensional bin packing problems with guillotine constraints
Multi‐dimensional bin packing problems with guillotine constraints
2010,
The problem addressed in this paper is the decision problem of determining if a set of...
Solution approaches for the cutting stock problem with setup cost
Solution approaches for the cutting stock problem with setup cost
2013,
In this paper, we study the Cutting Stock Problem with Setup Cost (CSP‐S) which...
Reducing the number of cuts in generating three‐staged cutting patterns
Reducing the number of cuts in generating three‐staged cutting patterns
2012,
Three‐staged guillotine patterns are widely used in the manufacturing industry...
A Parallel Branch‐and‐Bound Approach to the Rectangular Guillotine Strip Cutting Problem
A Parallel Branch‐and‐Bound Approach to the Rectangular Guillotine Strip Cutting Problem
2011,
This paper presents a parallel branch‐and‐bound method to address the...
Papers per page: