Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Mateus Martin"'
Publikováno v:
International Journal of Production Research. 61:2895-2916
Publikováno v:
Journal of Combinatorial Optimization. 44:557-582
Publikováno v:
International Transactions in Operational Research. 29:2944-2967
Publikováno v:
Annals of Operations Research.
Publikováno v:
International Journal of Production Research. 60:1854-1873
We address two variants of the two-dimensional guillotine cutting problem that appear in different manufacturing settings that cut defective objects. Real-world applications include the production ...
Publikováno v:
Journal of the Operational Research Society. 72:2755-2769
In this article, we address the Constrained Two-dimensional Guillotine Cutting Problem (C2GCP) and the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP). These problems consist of cu...
Publikováno v:
International Journal of Production Research. 58:2712-2729
This paper addresses a variant of two-dimensional cutting problems in which rectangular small pieces are obtained by cutting a rectangular object through guillotine cuts. The characteristics of thi...
Publikováno v:
Repositório Institucional da USP (Biblioteca Digital da Produção Intelectual)
Universidade de São Paulo (USP)
instacron:USP
Universidade de São Paulo (USP)
instacron:USP
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::714c26653a34d9f2f4d2ba016f9fd714
Publikováno v:
Expert Systems with Applications. 168:114257
In this paper, we address the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP), which consists of cutting a larger cuboid block (object) to produce a limited number of smaller cuboid pieces (items) using orthogonal guillotine cuts onl
Publikováno v:
Computers & Operations Research. 115:104851
In this paper, we address the Constrained Two-dimensional Guillotine Placement Problem (C2GPP). This problem considers a rectangular large object and a set of rectangular small item types of given sizes and values. The objective is to select and cut