Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics Massimo Pinto Antonioli, Carlos Diego Rodrigues, Bruno de Athayde Prata International Journal of Industrial Engineering Computations, 2022 This paper aims at presenting a customer order scheduling environment in which the setup times are explicit and depend on the production sequence. The considered objective function is the total tardiness minimization. Since the variant under study is NP-hard, we propose a mixed-integer linear programming (MILP) model, an adaptation of the Order-Scheduling Modified Due-Date heuristic (OMDD) (referred to as Order-Scheduling Modified Due-Date Setup (OMMD-S)), an adaptation of the Framinan and Perez-Gonzalez heuristic (FP) (hereinafter referred to as Framinan and Perez-Gonzalez Setup (FP-S)), a matheuristic with Same Permutation in All Machines (SPAM), and the hybrid matheuristic SPAM-SJPO based on Job-Position Oscillation (JPO). The algorithms under comparison have been compared on an extensive benchmark of randomly generated test instances, considering two performance measures: Relative Deviation Index (RDI) and Success Rate (SR). For the small-size evaluated instances, the SPAM is the most efficient algorithm, presenting the better values of RDI and SR. For the large-size evaluated instances, the hybrid matheuristic SPAM-JPO and MILP model are the most efficient methods.
Power allocation schemes for multichannel two-hop relaying systems Jose M. B. da Silva, Yuri C. B. Silva, Tarcisio F. Maciel, Francisco R. P. Cavalcanti, Carlos D. Rodrigues, et al. Proceedings of the International Symposium on Wireless Communication Systems, 2012
Recent hybrid techniques for the multi-knapsack problem Carlos Diego Rodrigues, Philippe Michelon, Manoel B. Campêlo Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 2008
RECENT SCHOLAR PUBLICATIONS
Integer Linear Optimization Models for Solving the Preference Manipulation Problem Within the Graph Model for Conflict Resolution HV Silva, LC Rêgo, CD Rodrigues Group Decision and Negotiation 35 (1), 1 , 2026 2026
Hub-and-spoke network design problem with multiple modes of transport B da Rocha Mendonça, CD Rodrigues, B de Athayde Prata Transportation Letters, 1-12 , 2025 2025
UM MODELO DE PROGRAMAÇÃO INTEIRA PARA UM JOGO DE BUSCA E EVASÃO COM MÚLTIPLOS PESQUISADORES CD Rodrigues Revista Contemporânea 4 (11), e6541-e6541 , 2024 2024
Strip based compact formulation for two-dimensional guillotine cutting problems CD Rodrigues, AC Cherri, SA de Araujo Computers & Operations Research 149, 106044 , 2023 2023 Citations: 15
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness BA Prata, V Fernandez-Viagas, JM Framinan, CD Rodrigues 2022
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness B de Athayde Prata, V Fernandez-Viagas, JM Framinan, CD Rodrigues Computers & Operations Research 145, 105880 , 2022 2022 Citations: 18
A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times B de Athayde Prata, CD Rodrigues, JM Framinan Expert Systems with Applications 189, 116097 , 2022 2022 Citations: 37
Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics MP Antonioli, CD Rodrigues, BA Prata International Journal of Industrial Engineering Computations , 2022 2022 Citations: 14
Optimizing the cost of preference manipulation in the graph model for conflict resolution LC Rêgo, HV Silva, CD Rodrigues Applied Mathematics and Computation 392, 125729 , 2021 2021 Citations: 37
UMA ABORDAGEM MATEHEURÍSTICA DE JANELA DESLIZANTE PARA O PROBLEMA DE PLANEJAMENTO DE CIRCUITOS VLSI LL Pavanello, CD Rodrigues, A Cherri Galoá , 2021 2021
Customer order scheduling problem to minimize makespan with sequence-dependent setup times B de Athayde Prata, CD Rodrigues, JM Framinan Computers & Industrial Engineering 151, 106962 , 2021 2021 Citations: 34
HEURÍSTICAS CONSTRUTIVAS PARA O PROBLEMA DE PLANEJAMENTO DE CIRCUITOS HPWL LL Pavanello, A Cherri, CD Rodrigues Galoá , 2020 2020
A Path-Relinking algorithm for the multi-mode resource-constrained project scheduling problem AEF Muritiba, CD Rodrigues, FA da Costa Computers & Operations Research 92, 145-154 , 2018 2018 Citations: 76
t-linearizalização de funções quadráticas de variáveis binárias P Soares, M Campêlo, CD Rodrigues, P Michelon Anais do XLIX SBPO, 2569-2580 , 2017 2017 Citations: 3
BITCLIQUE: um algoritmo de Branch-and-Bound para o problema da clique máxima ponderada WA Tavares, MBC Neto, CD Rodrigues, P Michelon Anais XLVIII SBPO, 2429-2440 , 2016 2016 Citations: 1
On the complexity of the flow coloring problem M Campelo, C Huiban, CD Rodrigues, RM Sampaio Discrete Applied Mathematics 197, 75-92 , 2015 2015 Citations: 3
Um algoritmo de branch and bound para o problema da clique máxima ponderada WA Tavares, MBC Neto, CD Rodrigues, P Michelon Proceedings of XLVII SBPO 1 , 2015 2015 Citations: 10
Two phase solution for an intelligent moving target search problem based on a 0–1 linear model B Detienne, D Quadri, CD Rodrigues International Journal of Production Research 52 (24), 7177-7192 , 2014 2014 Citations: 1
0-1 Quadratic Knapsack Problems: An Exact Approach Based on a -Linearization CD Rodrigues, D Quadri, P Michelon, S Gueye SIAM Journal on Optimization 22 (4), 1449-1468 , 2012 2012 Citations: 24
The flow coloring problem M Campêlo, R Corrêa, C Huiban, CD Rodrigues Congreso Latino-Iberoamericano de Investigacion Operativa (CLAIO), 3256-3267 , 2012 2012 Citations: 4
MOST CITED SCHOLAR PUBLICATIONS
A Path-Relinking algorithm for the multi-mode resource-constrained project scheduling problem AEF Muritiba, CD Rodrigues, FA da Costa Computers & Operations Research 92, 145-154 , 2018 2018 Citations: 76
A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times B de Athayde Prata, CD Rodrigues, JM Framinan Expert Systems with Applications 189, 116097 , 2022 2022 Citations: 37
Optimizing the cost of preference manipulation in the graph model for conflict resolution LC Rêgo, HV Silva, CD Rodrigues Applied Mathematics and Computation 392, 125729 , 2021 2021 Citations: 37
Customer order scheduling problem to minimize makespan with sequence-dependent setup times B de Athayde Prata, CD Rodrigues, JM Framinan Computers & Industrial Engineering 151, 106962 , 2021 2021 Citations: 34
0-1 Quadratic Knapsack Problems: An Exact Approach Based on a -Linearization CD Rodrigues, D Quadri, P Michelon, S Gueye SIAM Journal on Optimization 22 (4), 1449-1468 , 2012 2012 Citations: 24
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness B de Athayde Prata, V Fernandez-Viagas, JM Framinan, CD Rodrigues Computers & Operations Research 145, 105880 , 2022 2022 Citations: 18
Strip based compact formulation for two-dimensional guillotine cutting problems CD Rodrigues, AC Cherri, SA de Araujo Computers & Operations Research 149, 106044 , 2023 2023 Citations: 15
Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics MP Antonioli, CD Rodrigues, BA Prata International Journal of Industrial Engineering Computations , 2022 2022 Citations: 14
Um algoritmo de branch and bound para o problema da clique máxima ponderada WA Tavares, MBC Neto, CD Rodrigues, P Michelon Proceedings of XLVII SBPO 1 , 2015 2015 Citations: 10
On fractional and integral chromatic numbers of a graph via cutting and pricing M Campêlo, V Campos, R Corrêa, C Rodrigues Proceedings of the Fifth ALIO/EURO Conference on Combinatorial Optimization … , 2005 2005 Citations: 5
The flow coloring problem M Campêlo, R Corrêa, C Huiban, CD Rodrigues Congreso Latino-Iberoamericano de Investigacion Operativa (CLAIO), 3256-3267 , 2012 2012 Citations: 4
Abordagens híbridas na solução de problemas de programação inteira da teoria e prática CD Rodrigues 2010 Citations: 4
t-linearizalização de funções quadráticas de variáveis binárias P Soares, M Campêlo, CD Rodrigues, P Michelon Anais do XLIX SBPO, 2569-2580 , 2017 2017 Citations: 3
On the complexity of the flow coloring problem M Campelo, C Huiban, CD Rodrigues, RM Sampaio Discrete Applied Mathematics 197, 75-92 , 2015 2015 Citations: 3
Power allocation schemes for multichannel two-hop relaying systems JMB da Silva, YCB Silva, TF Maciel, FRP Cavalcanti, CD Rodrigues, ... 2012 International Symposium on Wireless Communication Systems (ISWCS), 356-360 , 2012 2012 Citations: 3
Un modèle bi-niveau pour le problème de la recherche d’une cible dynamique C Rodrigues, P Michelon, D Quadri MajecSTIC, Avignon, France , 2009 2009 Citations: 2
BITCLIQUE: um algoritmo de Branch-and-Bound para o problema da clique máxima ponderada WA Tavares, MBC Neto, CD Rodrigues, P Michelon Anais XLVIII SBPO, 2429-2440 , 2016 2016 Citations: 1
Two phase solution for an intelligent moving target search problem based on a 0–1 linear model B Detienne, D Quadri, CD Rodrigues International Journal of Production Research 52 (24), 7177-7192 , 2014 2014 Citations: 1
Applying the T-linearization to the quadratic knapsack problem CD Rodrigues, D Quadri, P Michelon, S Gueye, M Leblond ROADEF 2009, 19 , 2009 2009 Citations: 1
Recent Hybrid Techniques for the Multi-Knapsack Problem CD Rodrigues, P Michelon, MB Campêlo International Conference on Principles and Practice of Constraint … , 2008 2008 Citations: 1