Keyword: cutting stock

Found 79 papers in total
An Exact Algorithm for the Two‐Dimensional Strip‐Packing Problem
An Exact Algorithm for the Two‐Dimensional Strip‐Packing Problem
2010,
This paper considers the two‐dimensional strip‐packing problem (2SP) in...
Effective management policies for remnant inventory supply chains
Effective management policies for remnant inventory supply chains
2009,
A remnant inventory distribution system is considered where a set of geographically...
Optimal layout and path planning for flame cutting of sheet metals
Optimal layout and path planning for flame cutting of sheet metals
2009,
This paper presents a two-stage methodology for the optimisation of layout and path...
Hybrid optimisation with ant colony methods for the guillotine bin packing problem
Hybrid optimisation with ant colony methods for the guillotine bin packing problem
2009,
In this paper, we are interested in the guillotine bin packing problem...
Bin packing in multiple dimensions: Inapproximability results and approximation schemes
Bin packing in multiple dimensions: Inapproximability results and approximation schemes
2006,
We study the following packing problem: Given a collection of d–dimensional...
A recursive algorithm for the rectangular guillotine strip packing problem
A recursive algorithm for the rectangular guillotine strip packing problem
2008,
This article presents a recursive heuristic algorithm to generate cutting patterns for...
A coupling cutting stock–lot sizing problem in the paper industry
A coupling cutting stock–lot sizing problem in the paper industry
2008,
An important production programming problem arises in paper industries coupling...
Online bin packing of fragile objects with application in cellular networks
Online bin packing of fragile objects with application in cellular networks
2007,
We study a specific bin packing problem which arises from the channel assignment...
Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets
Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets
2006,
The manifest problem is faced by aerospace firms that produce launch vehicles to shoot...
A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem
A new bottom-left-fill heuristic algorithm for the two-dimensional irregular packing problem
2006,
This paper presents a new heuristic algorithm for the two-dimensional irregular...
Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
Cutting path optimization in CNC cutting processes using a two-step genetic algorithm
2006,
This paper deals with the problem of generating 2D cutting paths for a stock plate...
Carathéodory bounds for integer cones
Carathéodory bounds for integer cones
2006,
We provide analogues of Carathéodory's theorem for integer cones and apply our...
An exact approach to the Strip-Packing problem
An exact approach to the Strip-Packing problem
2003,
We consider the problem of orthogonally packing a given set of rectangular items into...
Applying a tabu search approach for solving the two-dimensional bin packing problem
Applying a tabu search approach for solving the two-dimensional bin packing problem
2005,
The 2DBPP (Two-Dimensional Bin Packing Problem) is a problem of packing each item into...
An improved best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
An improved best-first branch and bound algorithm for unconstrained two-dimensional cutting problems
2005,
In this paper, we develop an improved branch and bound algorithm for the (un)weighted...
Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
2006,
The author presents a method to generate optimal multi-segment cutting patterns to...
A stochastic programming model for optical fiber manufacturing
A stochastic programming model for optical fiber manufacturing
2001,
Optical fibers are made of solid rods of glass called preforms. The ends of the...
Embedding optimisation algorithms with Mosel
Embedding optimisation algorithms with Mosel
2003,
Algebraic modelling language allow models to be implemented in such a way that they...
A three-phase approach to solving the bidline problem
A three-phase approach to solving the bidline problem
2004,
This paper describes a three-phase approach to solving the bidline generation problem...
Solving nesting problems with non-convex polygons by constraint logic programming
Solving nesting problems with non-convex polygons by constraint logic programming
2003,
In this paper an application of constraint logic programming (CLP) to the resolution...
On-line A-shaped bin packing
On-line A-shaped bin packing
2002,
This paper presents a new variant of the classical bin packing problem (BP) named...
Integer linear programming models for 2-staged two-dimensional Knapsack problems
Integer linear programming models for 2-staged two-dimensional Knapsack problems
2003,
We are given a unique rectangular piece of stock material S , with height W , and a...
Part allocation to nesting layouts under variable demand
Part allocation to nesting layouts under variable demand
2003,
The problem formulation presented here deals with the choice of parts for nesting...
Solving an apparel trim placement problem using a maximum cover problem approach
Solving an apparel trim placement problem using a maximum cover problem approach
1999,
A trim placement problem from the apparel industry is presented and solved. The...
Papers per page: