Minimizing saw cycles on the cutting stock problem with processing times depending on the cutting pattern

dc.contributor.authorLemos, F. K. [UNESP]
dc.contributor.authorCherri, A. C. [UNESP]
dc.contributor.authorde Araujo, S. A. [UNESP]
dc.contributor.authorYanasse, H. H.
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)
dc.contributor.institutionUniversidade de São Paulo (USP)
dc.date.accessioned2023-03-01T20:07:02Z
dc.date.available2023-03-01T20:07:02Z
dc.date.issued2022-01-01
dc.description.abstractIn this paper the cutting stock problem minimizing saw cycles is considered. In this context where objects can be cut simultaneously the trade-off between raw material and machine utilization costs is of major interest. Different processing times for each cutting pattern are considered, according to the number of items on it, different from previous works of the literature. The optimization aims to minimize both machine utilization costs due to the saw cycles and raw material usage costs. An integer mathematical formulation is proposed, and a solution method based on a column generation procedure is used. Computational tests were performed to assess the impact on costs for illustrative and real industry instances. A set of instances were also randomly generated to analyse the behaviour of the outcome of the problem in face of different technical parameters.en
dc.description.affiliationSão Paulo State University (UNESP)
dc.description.affiliationFederal University of São Paulo (UNIFESP)
dc.description.affiliationUnespSão Paulo State University (UNESP)
dc.identifierhttp://dx.doi.org/10.1080/01605682.2022.2081520
dc.identifier.citationJournal of the Operational Research Society.
dc.identifier.doi10.1080/01605682.2022.2081520
dc.identifier.issn1476-9360
dc.identifier.issn0160-5682
dc.identifier.scopus2-s2.0-85131682515
dc.identifier.urihttp://hdl.handle.net/11449/240220
dc.language.isoeng
dc.relation.ispartofJournal of the Operational Research Society
dc.sourceScopus
dc.subjectcolumn generation
dc.subjectCutting
dc.subjectinteger programming
dc.subjectmachine utilization
dc.subjectsaw cycles
dc.titleMinimizing saw cycles on the cutting stock problem with processing times depending on the cutting patternen
dc.typeArtigo
unesp.author.orcid0000-0002-0488-7839[1]
unesp.author.orcid0000-0003-1934-4682[2]
unesp.author.orcid0000-0002-4762-2048[3]
unesp.author.orcid0000-0002-6946-9670[4]

Arquivos

Coleções