Folgen
Deisemara Ferreira
Titel
Zitiert von
Zitiert von
Jahr
Solution approaches for the soft drink integrated production lot sizing and scheduling problem
D Ferreira, R Morabito, S Rangel
European Journal of Operational Research 196 (2), 697-706, 2009
2232009
Heuristic approaches for the multiperiod location-transportation problem with reuse of vehicles in emergency logistics
A Moreno, D Alem, D Ferreira
Computers & Operations Research 69, 79-96, 2016
1362016
Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
D Ferreira, R Morabito, S Rangel
Computers & Operations Research 37 (4), 684-691, 2010
1312010
Single-stage formulations for synchronised two-stage lot sizing and scheduling in soft drink production
D Ferreira, AR Clark, B Almada-Lobo, R Morabito
International Journal of Production Economics 136 (2), 255-265, 2012
1022012
Building disaster preparedness and response capacity in humanitarian supply chains using the Social Vulnerability Index
D Alem, HF Bonilla-Londono, AP Barbosa-Povoa, S Relvas, D Ferreira, ...
European Journal of Operational Research 292 (1), 250-275, 2021
562021
Optimization model for a production, inventory, distribution and routing problem in small furniture companies
PL Miranda, R Morabito, D Ferreira
Top 26, 30-67, 2018
502018
Um modelo de otimização inteira mista e heurísticas relax and fix para a programação da produção de fábricas de refrigerantes de pequeno porte
D Ferreira, R Morabito, S Rangel
Production 18, 76-88, 2008
372008
A decomposition heuristic to solve the two-stage lot sizing and scheduling problem with temporal cleaning
A Toscano, D Ferreira, R Morabito
Flexible Services and Manufacturing Journal 31, 142-173, 2019
302019
Formulation and MIP-heuristics for the lot sizing and scheduling problem with temporal cleanings
A Toscano, D Ferreira, R Morabito
Computers & Chemical Engineering 142, 107038, 2020
202020
Um modelo de dimensionamento de lotes para uma fábrica de refrigerantes
MS Rangel, D Ferreira
Trends in Computational and Applied Mathematics 4 (2), 237-246, 2003
202003
Using the maximal covering location problem to design a sustainable recycling network
XD Medrano-Gómez, D Ferreira, EAV Toso, OJ Ibarra-Rojas
Journal of cleaner production 275, 124020, 2020
162020
Usando o ATSP na modelagem do problema integrado de produção de bebidas
CM Defalque, S Rangel, D Ferreira
TEMA (São Carlos) 12, 195-209, 2011
152011
Mixed integer formulations for a coupled lot-scheduling and vehicle routing problem in furniture settings
PL Miranda, R Morabito, D Ferreira
INFOR: Information Systems and Operational Research 57 (4), 563-596, 2019
142019
Heuristics and meta-heuristics for lot sizing and scheduling in the soft drinks industry: a comparison study
D Ferreira, PM França, A Kimms, R Morabito, S Rangel, CFM Toledo
Metaheuristics for Scheduling in Industrial and Manufacturing Applications …, 2008
132008
A study of different subsequence elimination strategies for the soft drink production planning
M Maldonado, S Rangel, D Ferreira
Journal of applied research and technology 12 (4), 631-641, 2014
112014
Formulações monoestágio para o problema de programação da produção de bebidas dois estágios com sincronia
D Ferreira, B Almada-Lobo, R Morabito
Production 23, 107-119, 2013
102013
A bi-objective model for the location of relief centers and distribution of commodities in disaster response operations
A Moreno, D Ferreira, D Alem
dyna 84 (200), 356-366, 2017
72017
Um modelo de dimensionamento de lotes aplicado à indústria de bebidas
S Rangel, D Ferreira
TEMA–Tendências em Matemática Aplicada 4 (2), 237-246, 2003
72003
Uma reformulação mono estágio de um modelo de programação da produção de bebidas dois estágios com sincronia
D Ferreira, AR Clark, B Almada-Lobo, R Morabito
XLI Simpósio Brasileiro de Pesquisa Operacional, 2009
52009
A heuristic approach to optimize the production scheduling of fruit-based beverages
A Toscano, D Ferreira, R Morabito, M Trassi
Gestão & Produção 27, e4869, 2020
22020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20