Felipe Muller

Dr. Felipe Muller

orcid

Research Focus & Metrics

Academic Career Length

27Years (2000-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 June 2014 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
FSFernando Stefanello
Fernando Stefanello
OAOlinto CESAR BASSI Araujo
Olinto CESAR BASSI Araujo
FMFelipe Muller
Felipe Muller

16 January 2018 in International Journal of Production Research
Verified
Journal Article
Open access
RTRenan Spencer Trindade
Renan Spencer Trindade
OAOlinto CESAR BASSI Araujo
Olinto CESAR BASSI Araujo
MFMarcia Fampa
Marcia Fampa
FMFelipe Muller
Felipe Muller
Problems of scheduling batch-processing machines to minimise the makespan are widely exploited in the literature, mainly motivated by real-world applications, such as burn-in tests in the semiconductor industry. These problems consist of grouping jobs in batches and scheduling them on machines. We consider problems where jobs have non-identical sizes and processing times, and the total size of each batch cannot exceed the machine capacity. The processing time of a batch is defined as the longest processing time among all jobs assigned to it. Jobs can also have non-identical release times, and in this case, a batch can only be processed when all jobs assigned to it are available. This paper discusses four different versions of batch scheduling problems, considering a single processing machine or parallel processing machines and considering jobs with or without release times. New mixed integer linear programming formulations are proposed as enhancements of formulations proposed in the literature, and symmetry breaking constraints are investigated to reduce the size of the feasible sets. Computational results show that the proposed formulations have a better performance than other models in the literature, being able to solve to optimality instances only considered before to be solved by heuristic procedures.

24 December 2021 in Algorithms
Verified
Journal Article
Open access
PDF file
FMFelipe Muller
Felipe Muller
IBIaê Santos Bonilha
Iaê Santos Bonilha
Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the objective of intelligently combining heuristic methods to solve hard optimization problems. Ant colony optimization (ACO) algorithms have been proven to deal with Dynamic Optimization Problems (DOPs) properly. Despite the good results obtained by the integration of local search operators with ACO, little has been done to tackle DOPs. In this research, one of the most reliable ACO schemes, the MAX-MIN Ant System (MMAS), has been integrated with advanced and effective local search operators, resulting in an innovative hyper-heuristic. The local search operators are the Lin–Kernighan (LK) and the Unstringing and Stringing (US) heuristics, and they were intelligently chosen to improve the solution obtained by ACO. The proposed method aims to combine the adaptation capabilities of ACO for DOPs and the good performance of the local search operators chosen in an adaptive way and based on their performance, creating in this way a hyper-heuristic. The travelling salesman problem (TSP) was the base problem to generate both symmetric and asymmetric dynamic test cases. Experiments have shown that the MMAS provides good initial solutions to the local search operators and the hyper-heuristic creates a robust and effective method for the vast majority of test cases.

1 January 2019 in Gestão & Produção
Verified
Journal Article
Open access
PDF file
IHIvan Londero Hoffmann
Ivan Londero Hoffmann
RNRaul Ceretta Nunes
Raul Ceretta Nunes
FMFelipe Muller
Felipe Muller
Resumo A evasão no ensino superior representa uma preocupação na gestão e um campo fértil para estudos acadêmicos. No Brasil, o Ministério de Educação realiza anualmente o Censo da Educação Superior. As diferentes metodologias para o cálculo e análises de indicadores da evasão são muitas vezes consideradas imprecisas e inconsistentes, fragilizando sua importância nas estratégias e políticas públicas de controle e melhorias dos serviços educacionais no âmbito das instituições de ensino superior. Este trabalho exploratório e com abordagem quantitativa propõe uma sistematização para a análise da evasão, utilizando como fonte de dados o Censo. A análise de 2009 a 2014 demonstra que, a partir dos dados do Censo, o conhecimento organizacional pode ser extraído de forma sistemática. A metodologia proposta contribui para o alinhamento entre a tecnologia da informação com a gestão do conhecimento, sendo possível desenvolver soluções que facilitem e organizem o compartilhamento de ideias, boas práticas e dados que podem ser transformados do estado implícito para o explícito, contribuindo na tomada de decisão dos gestores e coordenadores de curso com a finalidade de controlar a evasão.

11 January 2024 in IEEE Access
Verified
Journal Article
Open access
FMFelipe Muller
Felipe Muller
VSVanessa A. Schneider
Vanessa A. Schneider
IBIaê Santos Bonilha
Iaê Santos Bonilha
VSVeridiane Barbara De Souza
Veridiane Barbara De Souza
GCGreici Da Rosa Da Cruz
Greici Da Rosa Da Cruz
MMMichalis Mavrovouniotis
Michalis Mavrovouniotis
This paper deals with the problem of selecting a set of clients that will receive an offer of one or more products during a promotional campaign. Such campaigns are essential marketing tools to improve the economic profit of an enterprise, either by acquiring new customers or generating additional revenue from existing customers. In this research, a well-known mathematical model for the problem is used and extended with the cannibalism constraint which avoids some products being offered simultaneously to simulate competing products cannibalizing each other’s market. To solve this problem, a hybrid heuristic is proposed, which uses a genetic algorithm (GA) as long-term memory for a tabu search (TS). The main idea is not to use GA exclusively as an optimization procedure but also as a diversification strategy. In particular, GA elite solutions replace the TS’s current solutions exploring in this way new areas in the search space. GA also receives the best TS solutions to maintain its population with high-quality solutions. Extensive computational experiments are performed on a set of existing benchmark test problems integrated with the restriction of cannibalism. A new set of instances with a high degree of difficulty is generated and are available to the research community through GitHub. The proposed method is compared with state-of-the-art methods demonstrating better overall performance (sometimes more than 10 percentage points) and statistical significance.

2 October 2022
Verified
Book Chapter
Closed access
PDF file
MMMichalis Mavrovouniotis
Michalis Mavrovouniotis
GEGeorgios Ellinas
Georgios Ellinas
IBIaê Santos Bonilha
Iaê Santos Bonilha
FMFelipe Muller
Felipe Muller
MPMarios Polycarpou
Marios Polycarpou