Modelagem matemática para o problema de corte de estoque com limitação no número máximo de pilhas abertas
Resumo
O Problema de Corte de Estoque (PCE) é um problema de otimização no qual busca-se sa- tisfazer a demanda de um conjunto de itens de tamanho específico que são obtidos a partir do corte de peças maiores (objetos). [...]
Downloads
Referências
Claudio Arbib, Fabrizio Marinelli e Paolo Ventura. “One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model”. Em: International Transactions in Operational Research 23 (2016), pp. 47–63. doi: 10.1111/itor.12134.
Gleb Belov e Guntram Scheithauer. “Setup and open-stacks minimization in one-dimensional stock cutting”. Em: INFORMS Journal on Computing 19.1 (2007), pp. 27–35. doi: 10. 1287/ijoc.1050.0132.
P. C. Gilmore e R. E. Gomory. “A linear programming approach to the cutting-stock problem— Part II.” Em: Operations Research 11 (1963), pp. 863–888. doi: 10.1287/opre. 11.6.863.
P. C. Gilmore e R. E. Gomory. “A linear programming approach to the cutting-stock problem.” Em: Operations Research 9 (1961), pp. 849–859. doi: 10.1287/opre.9.6.849.
P. C. Gilmore e R. E. Gomory. “Multi-stage cutting stock problems of two and more dimensions.” Em: Operations Research 13 (1965), pp. 94–120. doi: 10.1287/opre.13.1.94.
Gerhard Wäscher, Heike Haußner e Holger Schumann. “An improved typology of cutting and packing problems”. Em: European Journal of Operational Research 183.3 (2007), pp. 1109–1130. doi: 10.1016/j.ejor.2005.12.047.
Horacio Hideki Yanasse e Maria Jose Pinto Lamosa. “An integrated cutting stock and sequencing problem”. Em: European Jornal of Operational Research 183.3 (2007), pp. 1353– 1370. doi: 10.1016/j.ejor.2005.09.054.
