Modification of Haessler’s sequential heuristic procedure for the one-dimensional cutting stock problem with setup cost
Mateus Martin; Antonio Moretti; Marcia Gomes-Ruggiero; Luiz Salles Neto
Abstract
Keywords
References
Araujo, S., Poldi, K., & Smith, J. (2014). A genetic algorithm for the one-dimensional cutting stock problem with setups.
Aliano Filho, A., Moretti, A. & Pato, M. (2017). A comparative study of exact methods for the bi-objective integer one-dimensional cutting stock problem.
Belov, G., & Scheithauer, G. (2007). Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting.
Cherri, A. C., Arenales, M. N., Yanasse, H. H., Poldi, K. C., & Gonçalves Vianna, A. C. (2014). The one-dimensional cutting stock problem with usable leftovers - A survey.
Cui, Y., Zhao, X., Yang, Y., & Yu, P. (2008). A heuristic for the one-dimensional cutting stock problem with pattern reduction.
Cui, Y., Zhong, C., & Yao, Y. (2015). Pattern-set generation algorithm for the one-dimensional cutting stock problem with setup cost.
Diegel, A., Miller, G., Montocchio, E., van Schalkwyk, S., & Diegel, O. (2006). Enforcing minimum run length in the cutting stock problem.
Cemil Dikili, A., Sarıöz, E., & Akman Pek, N. (2007). A successive elimination method for one-dimensional stock cutting problems in ship production.
Eilon, S. (1960). Optimizing the shearing of steel bars.
Foerster, H., & Wäscher, G. (2000). Pattern reduction in one-dimensional cutting stock problems.
Gau, T., & Wäscher, G. (1995). CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem.
Gilmore, P. C., & Gomory, R. E. (1961). A Linear Programming Approach to the Cutting-Stock Problem.
Gilmore, P. C., & Gomory, R. E. (1963). A Linear Programming Approach to the Cutting Stock Problem - Part II.
Haessler, R. W. (1975). Controlling Cutting Pattern Changes in One-Dimensional Trim Problems.
Henn, S., & Wäscher, G. (2013). Extensions of cutting problems: setups.
Kantorovich, L. (1960). Mathematical methods of organizing and planning production.
Kolen, A., & Spieksma, F. (2000). Solving a bi-criterion cutting stock problem with open-ended demand: a case study.
Metzger, R. W. (1958). Stock slitting. In R. W. Metzger.
Mobasher, A., & Ekici, A. (2013). Solution approaches for the cutting stock problem with setup cost.
Umetani, S., Yagiura, M., & Ibaraki, T. (2003). One-dimensional cutting stock problem to minimize the number of different patterns.
Umetani, S. (2018).
Vahrenkamp, R. (1996). Random search in the one-dimensional cutting stock problem.
Yanasse, H. (1997). On a pattern sequencing problem to minimize the maximum number of open stacks.
Yanasse, H. H., & Limeira, M. S. (2006). A hybrid heuristic to reduce the number of different patterns in cutting stock problems.
Facebook
Google+
Twitter
LinkedIn
Mendeley
StumbleUpon
CiteULike
Reddit
Email