Results 221 to 230 of about 39,747 (262)

Modeling multistage cutting stock problems

European Journal of Operational Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

An algorithm for a cutting stock problem on a strip

Journal of the Operational Research Society, 1997
Summary: A cutting stock problem is formulated as follows: a set of rectangular pieces must be cut from a set of sheets, so as to minimize total waste. In our problem the pieces are requested in large quantities and the set of sheets are long rolls of material.
openaire   +3 more sources

A Stochastic Cutting Stock Procedure: Cutting Rolls of Insulating Tape

Management Science, 1981
This paper develops a one-dimensional cutting stock procedure which will minimize material wastage when a batch of small pieces are cut from several long pieces. The problem differs from the classical one-dimensional cutting stock problem in that the dimensions of the material to be cut are random variables due to fringe defects caused by the ...
openaire   +2 more sources

Cutting Stock by Iterated Matching

1995
The combinatorial optimization problem considered in this paper is a special two dimensional cutting stock problem arising in the wood, metal and glass industry. Given a demand of non oriented small rectangles and a theoretically infinite set of large stock rectangles of given lengths and widths, our aim is to generate slicing trees specifying how to ...
Andreas Fritsch, Oliver Vornberger
openaire   +1 more source

An application of simulated annealing to the cutting stock problem

European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Optimal Stock Sizing in a Cutting Stock Problem with Stochastic Demands

2017
One dimensional cutting stock problems arise in many manufacturing domains such as pulp and paper, textile and wood. In this paper, a new real life variant of the problem occuring in the rubber mold industry is introduced. It integrates both operational and strategical planning optimization: on one side, items need to be cut out of stocks of different ...
openaire   +1 more source

Approaches to the Cutting Stock Problem

A I I E Transactions, 1976
Abstract In this paper, we survey various approaches to the cutting stock problem; available computational experience is discussed. The intention is to synthesize the considerable work that has been done on this problem. The different approaches studied will include column generation, zero-one programming, combinatorial heuristics, and subgradient ...
openaire   +1 more source

On the MAXGAP problem for cutting stock problems

J. Inf. Process. Cybern., 1994
Summary: The MAXGAP problem of a linear integer optimization problem \(P\) consists in determining the maximum difference (gap) \(\Delta(P)\) between the optimal value \(z^*(E)\) of an instance \(E\in P\) and the LP bound \(z_c(E)\) with respect to all \(E\in P\).
openaire   +1 more source

On Cutting Stock Problems

Journal of the Operational Research Society, 1978
I. Coverdale, F. Wharton
openaire   +1 more source

Integer cutting stock procedures

2023
1he purpose of this study was to explore several methods for solving the one-dimensional. integer cutting stock problem and to synthesize a general integer cutting stock model for paper industry applications. Of the several integer programming and discrete alternative approaches that existed, the combinatorial programming procedure of Pierce was chosen
openaire   +1 more source