Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||A Grasp Metaheuristic For The Ordered Cutting Stock Problem|
de Salles Neto L.L.
|Abstract:||This study presents a new mathematical model a Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic to solve the ordered cutting stock problem. The ordered cutting stock problem was recently introduced in literature. It is appropriate to minimize the raw material used by industries that deal with reduced product inventories, such as industries that use the just-in-time basis for their production. In such cases, classic models for solving the cutting stock problem are useless. Results obtained from computational experiments for a set of random instances demonstrate that the proposed method can be applied to large industries that process cuts on their production lines and do not stock their products.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.