A GRASP ALGORITHM FOR GUILLOTINE CUTS
DOI:
https://doi.org/10.15381/idata.v9i2.5869Keywords:
GRASP, heuristics, relaxing parameter, 2D cutsAbstract
This work focus upon the first one, which, due to its high computational cost that causes us to obtain exact solutions, the use of a GRASP Algorithm for straight guillotine cuts, which allows to find good solutions for any instance in suitable times is thought to be used, having as the main goal to minimize the lost or waste of materials generated in the cutting process. This will allow us the enhancement of productivity and the reduction of costs making it attractive for applying it in the paper, glass, metal and wood industry sector.
Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2006 María Ruiz Rivera, Edgar Ruiz Lizama
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the INDUSTRIAL DATA.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating the source of publication (the originator of the work, journal, volume, number and date).
