The one-dimensional cutting stock problem with usable leftovers - A survey
Contribuinte(s) |
Universidade Estadual Paulista (UNESP) |
---|---|
Data(s) |
03/12/2014
03/12/2014
16/07/2014
|
Resumo |
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) In this article, we review published studies that consider the solution of the one-dimensional cutting stock problem (1DCSP) with the possibility of using leftovers to meet future demands, if long enough. The one-dimensional cutting stock problem with usable leftovers (1DCSPUL) is a problem frequently encountered in practical settings but often, it is not dealt with in an explicit manner. For each work reviewed, we present the application, the mathematical model if one is proposed and comments on the computational results obtained. The approaches are organized into three classes: heuristics, item-oriented, or cutting pattern-oriented. (c) 2013 Elsevier B.V. All rights reserved. |
Formato |
395-402 |
Identificador |
http://dx.doi.org/10.1016/j.ejor.2013.11.026 European Journal Of Operational Research. Amsterdam: Elsevier Science Bv, v. 236, n. 2, p. 395-402, 2014. 0377-2217 http://hdl.handle.net/11449/113532 10.1016/j.ejor.2013.11.026 WOS:000334143100001 |
Idioma(s) |
eng |
Publicador |
Elsevier B.V. |
Relação |
European Journal of Operational Research |
Direitos |
closedAccess |
Palavras-Chave | #Usable leftovers #Cutting stock problem #Review |
Tipo |
info:eu-repo/semantics/article |