HYHoracio Hideki Yanasse

Horacio Hideki Yanasse

*This is an algorithmically generated author record based on publicly available information.

Horacio Hideki Yanasse has a total of 61 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    EMPIRICAL STUDY ON ONE-DIMENSIONAL CUTTING STOCK PROBLEM SOLUTIONS USING ONLY CUTTING PATTERNS WITH A LIMITED NUMBER OF DISTINCT ITEM TYPES

    by Gabriel G. Guimarães, Horacio H. Yanasse

    In this study we focus on the approximate solution of the one-dimensional Cutting Stock Problem (CSP) by leveraging insights from studies on the Cutting Stock Problem with a Limited Number of Open Stacks (CS-LOSP). The CS-LOSP, a variant of the classical CSP, imposes a limit on the number of open stacks during production, reflecting constraints observed in many industrial environments. Em-pirical findings from CS-LOSP studies have shown that high-quality CSP solutions can be achieved with low values of C (the permitted number of open stacks). Inspired by these observations, we investigate a matheuristic pattern screening strategy that discards all cutting patterns generating more than C distinct item types to solve the CSP. The work is empirical in nature, supported by extensive computational tests designed to verify whether the promising results observed in CS-LOSP can be replicated in the classical one-dimensional CSP. Our experiments identify the conditions under which the matheuristic produces optimal or near-optimal solutions, particularly under medium to high demand levels, while its effectiveness tends to decrease in low-demand scenarios. Beyond demonstrating significant reductions in the size of the feasible pattern set to be considered when solving the CSP, our results underline the practical relevance of our approach. This is especially pertinent for sequential optimization systems in industrial applications.

  • The Multiplant Lot Sizing Problem with Multiple Periods and Items

    by Mariá C. V. Nascimento, Horacio H. Yanasse, Desiree M. Carvalho, Silvio Alexandre de Araujo

  • The Multiplant Lot Sizing Problem with Multiple Periods and Items

    by Mariá C. V. Nascimento, Horacio H. Yanasse, Desiree M. Carvalho, Silvio Alexandre de Araujo

  • Models for two-dimensional bin packing problems with customer order spread

    by Mateus Martin, Horacio Hideki Yanasse, Maristela O. Santos, Reinaldo Morabito


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

    by F. K. Lemos, A. C. Cherri, S. A. de Araujo, H. H. Yanasse

    In 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.


  • Models for two- and three-stage two-dimensional cutting stock problems with a limited number of open stacks

    by Mateus Martin, Horacio Hideki Yanasse, Maristela O. Santos, Reinaldo Morabito

    We address three variants of the two-dimensional cutting stock problem in which the guillotine cutting of large objects produces a set of demanded items. The characteristics of the variants are the rectangular shape of the objects and items; the number of two or three orthogonal guillotine stages; and a sequencing constraint that limits the number of open stacks to a scalar associated with the number of automatic compartments or available space near the cutting machine. These problems arise in manufacturing environments that seek minimum waste solutions with limited levels of work-in-process. Despite their practical relevance, we are not aware of mathematical models for them. In this paper, we propose an integer linear programming (ILP) formulation for each of these variants based on modelling strategies for the two-dimensional guillotine cutting stock problem and the minimisation of the open stacks problem. The first two variants deal with exact and non-exact 2-stage patterns, and the third with a specific type of 3-stage patterns. Using a general-purpose ILP solver, we performed computational experiments to evaluate these approaches with benchmark instances. The results show that several equivalent solutions of the cutting problem allow obtaining satisfactory solutions with a reduced number of open stacks.


  • Mathematical models for the minimization of open stacks problem

    by Mateus Martin, Horacio Hideki Yanasse, Maria José Pinto

    In this paper, we address the minimization of open stacks problem (MOSP). This problem often appears during production planning of manufacturing industries, such as in the cutting of objects to comply with space constraints around the cutting machine in the glass, furniture, and metallurgical industries. During the processing of the cutting patterns, all the copies of a demanded item are stored in a stack usually placed near the cutting machine. One stack for each type of demanded item, that is, different items do not share the same stack. In this sense, the MOSP consists of finding an optimal sequence of a given set of cutting patterns, while minimizing the maximum number of simultaneously open stacks. To effectively model and solve the problem, we present a novel integer linear programming (ILP) formulation based on a graph representation of the problem. We derive an ILP formulation from the modeling approach of Faggioli and Bentivoglio for the MOSP. Then we develop a simple constraint programming model based on interval variables and renewable resources. We performed computational experiments to evaluate the proposed approaches in comparison with other ILP formulations from the literature. Using a general‐purpose solver, the proposed approaches perform well in terms of solution quality and computational time in comparison to the benchmark models for small and moderate‐sized problem instances.


  • Open Access

    Forecast UTI: aplicativo para previsão de leitos de unidades de terapia intensiva no contexto da pandemia de covid-19

    by Luiz Leduíno de Salles Neto, Camila Bertini Martins, Antônio Augusto Chaves, Thais Cláudia Roma de Oliveira Konstantyner, Horácio Hideki Yanasse, Claudia Barbosa Ladeira de Campos, Ana Júlia de Oliveira Bellini, Renan Brito Butkeraites, Leonardo Correia, Igor Luciano Magro, et al.

    Frente à necessidade de gerenciamento e previsão do número de leitos de unidades de terapia intensiva (UTI) para pacientes graves de covid-19, foi desenvolvido o Forecast UTI, um aplicativo de livre acesso e que permite o monitoramento de indicadores hospitalares com base em dados históricos do serviço de saúde e na dinâmica temporal dessa epidemia por coronavírus. O Forecast UTI também possibilita realizar previsões de curto prazo sobre número de leitos ocupados pela doença diariamente, e estabelecer possíveis cenários de atendimento. Este artigo apresenta as funções, modo de acesso e exemplos de uso do Forecast UTI, uma ferramenta computacional destinada a auxiliar gestores de hospitais da rede pública e privada do Sistema Único de Saúde no subsídio à tomada de decisão, de forma rápida, estratégica e eficiente.

  • Open Access

    Forecast UTI: aplicativo para previsão de leitos de unidades de terapia intensiva no contexto da pandemia de COVID-19

    by Luiz Leduíno de Salles Neto, Camila Bertini Martins, Antônio Augusto Chaves, Thais Cláudia Roma de Oliveira Konstantyner, Horacio Hideki Yanasse, Claudia Barbosa Ladeira de Campos, Ana Júlia de Oliveira Bellini, Renan Brito Butkeraites, Leonardo Correia, Igor Luciano Magro, et al.

    Resumo Frente à necessidade de gerenciamento e previsão do número de leitos de unidades de terapia intensiva (UTIs) para pacientes graves de COVID-19, foi desenvolvido o Forecast UTI, um aplicativo de livre acesso, que permite o monitoramento de indicadores hospitalares com base em dados históricos do serviço de saúde e na dinâmica temporal da epidemia por coronavírus. O Forecast UTI também possibilita realizar previsões de curto prazo do número de leitos ocupados pela doença diariamente, e estabelecer possíveis cenários de atendimento. Este artigo apresenta as funções, modo de acesso e exemplos de uso do Forecast UTI, uma ferramenta computacional destinada a auxiliar gestores de hospitais da rede pública e privada do Sistema Único de Saúde (SUS) no subsídio à tomada de decisão, de forma rápida, estratégica e eficiente.