In this paper, the methods for stock cutting outlined in an earlier paper in this Journal [Opns Res 9, 849--859 1961] are extended and adapted to the specific full-scale paper trim problem. The paper describes a new and faster knapsack method, experiments, and formulation changes. The experiments include ones used to evaluate speed-up devices and to explore a connection with integer programming. Other experiments give waste as a function of stock length, examine the effect of multiple stock lengths on waste, and the effect of a cutting knife limitation. The formulation changes discussed are i limitation on the number of cutting knives available, n balancing of multiple machine usage when orders are being filled from more than one machine, and m introduction of a rational objective function when customers' orders are not for fixed amounts, but rather for a range of amounts. The methods developed are also applicable to a variety of cutting problems outside of the paper industry.
[1]
G. Dantzig.
UPPER BOUNDS, SECONDARY CONSTRAINTS, AND BLOCK TRIANGULARITY IN LINEAR PROGRAMMING
,
1955
.
[2]
G. Dantzig.
Discrete-Variable Extremum Problems
,
1957
.
[3]
Ralph E. Gomory,et al.
An algorithm for integer solutions to linear programs
,
1958
.
[4]
R. Gomory,et al.
A Linear Programming Approach to the Cutting-Stock Problem
,
1961
.
[5]
Abraham Charnes,et al.
Programming with linear fractional functionals
,
1962
.
[6]
W. Dinkelbach.
Die Maximierung eines Quotienten zweier linearer Funktionen unter linearen Nebenbedingungen
,
1962
.
[7]
F. Glover.
AN ALL-INTEGER INTEGER PROGRAMMING ALGORITHM
,
1963
.