Abstract
A description of some examples of the application of cutting stock problems is given.
Focusing on a small firm and its special problems a case from the glass industry is presented. The case leads to a two-dimensional cutting stock problem where large rectangles have to be cut into smaller rectangles. At the same time a group of additional constraints have to be satisfied. The solution method is a near optimal method using knapsack functions. It is shown that the waste can be reduced by approximately 50% in comparison to the solution normally used by the company. Furthermore a sequencing procedure for the ordering of the glass sheets is suggested.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A.R. Brown, “Selling television time: an optimization problem”,The Computer Journal (1969).
Bendt G. Christensen, “Planning of glass cutting” (in Danish), report from IMSOR, The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark (Copenhagen, August 1975).
E. Cuthill and J. McKee, “Reducing the bandwidth of symmetric matrices”, in:Proceedings of 24th Nat. Conf. Assoc. Comput. Mach. (ACM publication P-69, New York, 1969.)
R.G. Dyson and A.S. Gregory, “The cutting stock problem in the flat glass industry”,Operations Research Quarterly (1974) 41–54.
N.E. Gibbs, W.G. Poole and P.K. Stockmeyer, “An algorithm for reducing the bandwidth and profile of a sparse matrix”,SIAM Journal on Numerical Analysis 13 (1976) 236–250.
Allan George, “Ordering, partitioning and solution schemes for finite element equations”, in: V.A. Barker, ed.,Sparse matrix techniques (Springer, New York, 1977) pp. 52–101.
Gilmore and R.E. Gomory, “A linear programming approach to the cutting stock problem. Part I”,Operations Research 9 (1961) 849–859.
Gilmore and R.E. Gomory, “A linear programming approach to the cutting stock problem. Part II”,Operations Research 11 (1963) 863–888.
Gilmore and R.E. Gomory, “Multi-stage cutting stock problems of two and more dimensions”,Operations Research (1965) 94–120.
Gilmore and R.E. Gomory, “The theory and computations of knapsack functions”,Operations Research 14 (1966) 1045–1074.
Robert W. Haessler, “A heuristic programming solution to a nonlinear cutting stock problem”,Management Science (Application) 17 (1971) B793-B802.
Susan G. Hahn, “On the optimal cutting of defective sheets”,Operations Research 16 (1968) 1100–1114.
Uffe B. Nielsen, “Algorithms for planning the use of currugated paper machines” (in Danish), report from IMSOR, The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark (Copenhagen, Nov. 1967).
C.B. Tilanus and C. Gerhardt, “An application of cutting stock in the steel industry”, in: K.B. Haley, ed.,Operational Research '75 (North-Holland, Amsterdam, 1976) pp. 669–675.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Madsen, O.B.G. Glass cutting in a small firm. Mathematical Programming 17, 85–90 (1979). https://doi.org/10.1007/BF01588227
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01588227