Seguir
Cleder Marcos Schenekemberg
Cleder Marcos Schenekemberg
Outros nomesCleder M. Schenekemberg, Cleder Schenekemberg
E-mail confirmado em unifesp.br
Título
Citado por
Citado por
Ano
The two-echelon multi-depot inventory-routing problem
TA Guimarães, LC Coelho, CM Schenekemberg, CT Scarpin
Computers & Operations Research 101, 220-233, 2019
752019
The two-echelon production-routing problem
CM Schenekemberg, CT Scarpin, JE Pecora Jr, TA Guimarães, ...
European journal of operational research 288 (2), 436-449, 2021
472021
The exact solutions of several types of container loading problems
DV Kurpel, CT Scarpin, JEP Junior, CM Schenekemberg, LC Coelho
European Journal of Operational Research 284 (1), 87-107, 2020
432020
The two-echelon inventory-routing problem with fleet management
CM Schenekemberg, CT Scarpin, JE Pécora Jr, TA Guimarães, ...
Computers & Operations Research 121, 104944, 2020
202020
Mechanisms for feasibility and improvement for inventory-routing problems
TA Guimarães, CM Schenekemberg, LC Coelho, CT Scarpin, ...
CIRRELT, 2020
132020
The dial-a-ride problem with private fleet and common carrier
CM Schenekemberg, AA Chaves, LC Coelho, TA Guimarães, GG Avelino
Computers & Operations Research 147, 105933, 2022
102022
A parallel branch-and-cut and an adaptive metaheuristic to solve the Family Traveling Salesman Problem
AA Chaves, BL Vianna, TT da Silva, CM Schenekemberg
Expert Systems with Applications 238, 121735, 2024
62024
Heuristic approaches to solve a two-stage lot sizing and scheduling problem
TMP Schimidt, SC Tadeu, GV Loch, CM Schenekemberg
IEEE Latin America Transactions 17 (03), 434-443, 2019
62019
A mathematical model for the periodic capacitated arc routing problem with time windows
D Thomaz, G Loch, C Scarpin, C Schenekemberg
IEEE Latin America Transactions 16 (10), 2567-2573, 2018
62018
Mechanisms for feasibility and improvement for inventory-routing problems
TA Guimarães, CM Schenekemberg, LC Coelho, CT Scarpin, ...
Journal of the Operational Research Society 75 (1), 26-38, 2024
52024
A two-level lot sizing and scheduling problem applied to a cosmetic industry
TMP Schimidt, CT Scarpin, GV Loch, CM Schenekemberg
Computers & Chemical Engineering 163, 107837, 2022
52022
Lúdico no ensino de frações
DT Prevê, CM Sheneckemberg, RH Munhoz
Revista BOEM 2 (2), 88-99, 2014
52014
The Exact Solutions of Several Classes of Container Loading Problems
DV Kurpel, CM Schenekemberg, CT Scarpin, JEP Junior, LC Coelho
CIRRELT, Centre interuniversitaire de recherche sur les réseaux d'entreprise …, 2018
32018
A three-front parallel branch-and-cut algorithm for production and inventory routing problems
CM Schenekemberg, TA Guimarães, AA Chaves, LC Coelho
Transportation Science, 2023
22023
The two-echelon production-routing problem
CM Schenekemberg, CT Scarpin, JE Pécora Jr, TA Guimarães, ...
Faculté des sciences de l'administration, Université Laval, 2019
22019
The two-echelon inventory-routing problem with fleet management
CM Schenekemberg, CT Scarpin, JE Pécora Jr, TA Guimarães, ...
Faculté des sciences de l'administration, Université Laval, 2019
22019
Hybrid metaheuristic for an integrated Dial-a-Ride Problem with common carrier and public transportation
CM Schenekemberg, AA Chaves, LC Coelho, TA Guimarães
Faculté des sciences de l'administration, Université Laval, 2022
12022
Um modelo matemático exato para o problema de carregamento de contêineres com restrição de carregamento completo de grupos de itens
DV Kurpel, CM Schenekemberg, CT Scarpin
Revista Eletrônica Gestão e Saúde, 1214-1226, 2015
12015
Hybrid metaheuristic for the dial-a-ride problem with private fleet and common carrier integrated with public transportation
CM Schenekemberg, AA Chaves, TA Guimarães, LC Coelho
Annals of Operations Research, 1-39, 2024
2024
An integrated production planning and inventory management problem for a perishable product: optimization and Monte Carlo simulation as a tool for planning in scenarios with …
JA Cruz, LL Salles-Neto, CM Schenekemberg
TOP, 1-41, 2024
2024
O sistema não pode executar a operação agora. Tente novamente mais tarde.
Artigos 1–20