Cutting operations in manufacturing are characterized by practical requirements and utility criteria that usually increase the complexity of formulations or, even worse, are difficult to be modeled in terms of mathematical programming. However, disregarding or just simplifying those requirements often leads to solutions considered not attractive or even useless by the manufacturer. In this paper we consider a rich two-dimensional cutting stock problem that covers the whole specification of a family of wood cutting machines produced by a worldwide leader in industrial machinery manufacturing. A sequential value correction heuristic is implemented to minimize the employed stock area while reducing additional objective functions.
A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem / Rosetti, Roberto; Pizzuti, Andrea; Marinelli, Fabrizio; Arbib, Claudio. - ELETTRONICO. - (2018), pp. 31-37. (Intervento presentato al convegno 7th International Conference on Operations Research and Enterprise Systems tenutosi a Madeira, Portugal nel January 24-26, 2018) [10.5220/0006534500310037].
A Heuristic for a Rich and Real Two-dimensional Woodboard Cutting Problem
Rosetti, Roberto;PIZZUTI, ANDREA;Marinelli, Fabrizio;ARBIB, CLAUDIO
2018-01-01
Abstract
Cutting operations in manufacturing are characterized by practical requirements and utility criteria that usually increase the complexity of formulations or, even worse, are difficult to be modeled in terms of mathematical programming. However, disregarding or just simplifying those requirements often leads to solutions considered not attractive or even useless by the manufacturer. In this paper we consider a rich two-dimensional cutting stock problem that covers the whole specification of a family of wood cutting machines produced by a worldwide leader in industrial machinery manufacturing. A sequential value correction heuristic is implemented to minimize the employed stock area while reducing additional objective functions.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.