Advanced search
Publication Cover
International Journal of Computer Mathematics Volume 87, 2010 - Issue 12: Section B Special Section: Third International Conference on Mathematical Sciences, Al-Ain, UAE, March 2008
Submit an article Journal homepage
70
Views
0
CrossRef citations to date
0
Altmetric
Section B

A bi-objective guillotine cutting problem of stamping strips of equal circles

Yaodong Cui Department of Computer Science, Guangxi Normal University, Guilin, 541004, ChinaCorrespondence[email protected]
,
Tianlong Gu Department of Computer Science, Guilin University of Electronic Technology, Guilin, 541004, China
&
Wei Hu Library, Guangxi Normal University, Guilin, 541004, China
Pages 2716-2721 | Received 06 Mar 2007, Accepted 10 Jan 2009, Published online: 02 Jun 2010

References

  • Agrawal , P. K. 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 , M. Z. 2000 . Continued fractions in optimal cutting of a rectangular sheet into equal small rectangles . Eur. J. Oper. Res. , 125 : 239 – 248 .
  • Cui , Y. 2005 . Dynamic programming algorithms for the optimal cutting of equal rectangles . Appl. Math. Model. , 29 : 1040 – 1053 .
  • Cui , Y. 2005 . Generating optimal T-shape cutting patterns for circular blanks . Comput. Oper. Res. , 32 : 143 – 152 .
  • 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. and Wang , Q. 2007 . Exact and heuristic algorithms for the circle-cutting problem in the manufacturing industry of electric motors . J. Comb. Optim. , 14 : 35 – 44 .
  • Cui , Y. , Chen , Y. and 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. and Zhao , X. 2007 . Dynamic programming algorithms for the cutting problem of equal circles . J. Eng. Manufacture , 221 : 387 – 395 .
  • Cung , V. D. , Hifi , M. and Cun , B. L. 2000 . Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm . Int. Trans. Oper. Res. , 7 : 185 – 210 .
  • George , J. A. , George , J. M. and Lamar , B. W. 1995 . Packing different-sized circles into a rectangular container . Eur. J. Oper. Res. , 84 : 693 – 712 .
  • Gilmore , P. C. and Gomory , R. E. 1965 . Multistage cutting stock problems of two and more dimensions . Oper. Res. , 13 : 94 – 120 .
  • Gilmore , P. C. and Gomory , R. E. 1966 . The theory and computation of knapsack functions . Oper. Res. , 14 : 1045 – 1074 .
  • Hifi , M. 2001 . Exact algorithms for large-scale unconstrained two and three staged cutting problems . Comput. Optim. Appl. , 18 : 63 – 88 .
  • Hifi , M. and Rym , M. H. 2004 . Approximate algorithms for constrained circular cutting problems . Comput. Oper. Res. , 31 : 675 – 694 .
  • Locatelli , M. and Raber , U. 2002 . Packing equal circles in a square: a deterministic global optimization approach . Discrete Appl. Math. , 122 : 139 – 166 .
  • Stoyan , Y. G. and Yaskov , G. N. 1998 . Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints . Int. Trans. Oper. Res. , 5 : 45 – 57 .
  • Stoyan , Y. G. and Yaskov , G. 2004 . A mathematical model and a solution method for the problem of placing various-sized circles into a strip . Eur. J. Oper. Res. , 156 : 590 – 600 .
  • Tarnowski , A. G. , Terno , J. and Scheithauer , G. 1994 . A polynomial time algorithm for the guillotine pallet-loading problem . INFOR , 32 : 275 – 287 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.