Abstract
The manufacturing industry often uses the cutting and stamping process to divide stock plates into circles. A guillotine machine cuts the plate into strips for stamping at the cutting stage, and then a stamping press punches out the circles from the strips at the stamping stage. The problem discussed is to cut a plate into strips of identical circles such that the number of circles is maximized. A dynamic programming algorithm is presented for generating the simplest optimal cutting patterns of the strips. The computational results indicate that the algorithm is much efficient in simplifying the cutting process.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Agrawal PK (1993) Minimizing trim loss in cutting rectangular blanks of a single size form a rectangular sheet using orthogonal guillotine cuts. Eur J Oper Res 64:410–422
Arslanov MZ (2000) Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles. Eur J Oper Res 125:239–248
Cui Y (2005a) Generating optimal T-shape cutting patterns for circular blanks. Comput Oper Res 32(1):143–152
Cui Y (2005b) Dynamic programming algorithms for the optimal cutting of equal rectangles. Appl Math Model 29:1040–1053
Cui Y (2006) Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors. Eur J Oper Res 169(1):30–40
Cui Y, Wang Q (2006) Exact and heuristic algorithms for the circle-cutting problem in the manufacturing industry of electric motors. J Comb Optim 14(1):35–44
Cui Y, Chen Y, Wu J (2006) Selecting the best sheet length for the steel stock used in circular blank production. IIE Trans 38(10):829–836
Cui Y, Zhang X, Zhang H, Zhao X (2007) Dynamic programming algorithms for the cutting problem of equal circles. J Eng Manuf 221(1):387–395
George JA, George JM, Lamar BW (1995) Packing different-sized circles into a rectangular container. Eur J Oper Res 84:693–712
Tarnowski AG, Terno J, Scheithauer G (1994) A polynomial time algorithm for the guillotine pallet-loading problem. INFOR 32:275–287
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cui, Y., Gu, T. & Hu, W. Simplest optimal guillotine cutting patterns for strips of identical circles. J Comb Optim 15, 357–367 (2008). https://doi.org/10.1007/s10878-007-9089-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-007-9089-x