4
Views
20
CrossRef citations to date
0
Altmetric
Case-Oriented Paper

Application of Heuristic Techniques to the Cutting-Stock Problem for Worktops

Pages 369-377 | Published online: 20 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (4)

K. Ratanapan, C. H. Dagli & S. E. Grasman. (2007) An object-based evolutionary algorithm for solving nesting problems. International Journal of Production Research 45:4, pages 845-869.
Read now
Y. K. D. V. PRASAD, S. SOMASUNDARAM & K. P. RAO. (1995) A sliding algorithm for optimal nesting of arbitrarily shaped sheet metal blanks. International Journal of Production Research 33:6, pages 1505-1520.
Read now
RUSSELLD. TSAI, ERICM. MALSTROM & WAY KUO. (1993) THREE DIMENSIONAL PALLETIZATION OF MIXED BOX SIZES. IIE Transactions 25:4, pages 64-75.
Read now
WEISHUANG QU & JERRYL. SANDERS. (1987) A nesting algorithm for irregular parts and factors affecting trim losses. International Journal of Production Research 25:3, pages 381-397.
Read now

Articles from other publishers (16)

S. A. MirHassani & A. Jalaeian Bashirzadeh. (2015) A GRASP meta-heuristic for two-dimensional irregular cutting stock problem. The International Journal of Advanced Manufacturing Technology 81:1-4, pages 455-464.
Crossref
S.D. Allen, E.K. Burke & G. Kendall. (2011) A hybrid placement strategy for the three-dimensional strip packing problem. European Journal of Operational Research 209:3, pages 219-227.
Crossref
Edmund K. Burke, Graham Kendall & Glenn Whitwell. (2009) A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem. INFORMS Journal on Computing 21:3, pages 505-516.
Crossref
E. K. Burke, G. Kendall & G. Whitwell. (2004) A New Placement Heuristic for the Orthogonal Stock-Cutting Problem. Operations Research 52:4, pages 655-671.
Crossref
Parimal Kopardekar & Anil Mital. (2016) Cutting Stock Problem: A Heuristic Solution Based on Human Intuitive Strategies. Proceedings of the Human Factors and Ergonomics Society Annual Meeting 43:3, pages 143-147.
Crossref
Ralf Heckmann & Thomas Lengauer. (1998) Computing closely matching upper and lower bounds on textile nesting problems. European Journal of Operational Research 108:3, pages 473-489.
Crossref
Liu Hong, Zeng Guangzhou & Lin Zongkai. (1997) A system of optimizing nesting with analogical learning mechanism. Computers & Industrial Engineering 32:4, pages 713-725.
Crossref
K.K. Lai & Jimmy W.M. Chan. (1997) Developing a simulated annealing algorithm for the cutting stock problem. Computers & Industrial Engineering 32:1, pages 115-127.
Crossref
Ralf Heckmann & Thomas Lengauer. 1996. Algorithms — ESA '96. Algorithms — ESA '96 392 405 .
Jörg Heistermann & Thomas Lengauer. (1995) The nesting problem in the leather manufacturing industry. Annals of Operations Research 57:1, pages 147-173.
Crossref
Ralf Heckmann & Thomas Lengauer. (1995) A simulated annealing approach to the nesting problem in the textile manufacturing industry. Annals of Operations Research 57:1, pages 103-133.
Crossref
C.H Cheng, B.R Feiring & T.C.E Cheng. (1994) The cutting stock problem — a survey. International Journal of Production Economics 36:3, pages 291-305.
Crossref
Y.K.D.V. Prasad. (1994) A set of heuristic algorithms for optimal nesting of two-dimensional irregularly shaped sheet-metal blanks. Computers in Industry 24:1, pages 55-70.
Crossref
Yuval Lirov. (1992) Knowledge based approach to the cutting stock problem. Mathematical and Computer Modelling 16:1, pages 107-125.
Crossref
Robert J. Graves, Mickey R. Wilhelm, Leon F. McGinnis & Richard E. WardRussell D. Tsai, Eric M. Malstrom & Way Kuo. 1991. Material Handling ’90. Material Handling ’90 181 201 .
Stelios H. Zanakis, James R. Evans & Alkis A. Vazacopoulos. (1989) Heuristic methods and applications: A categorized survey. European Journal of Operational Research 43:1, pages 88-110.
Crossref

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:

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:

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.