Theo dõi
Paulo Morelato Franca (retired)
Paulo Morelato Franca (retired)
Universidade Estadual Paulista - UNESP - Brazil
Email được xác minh tại fct.unesp.br - Trang chủ
Tiêu đề
Trích dẫn bởi
Trích dẫn bởi
Năm
A memetic algorithm for the total tardiness single machine scheduling problem
PM França, A Mendes, P Moscato
European Journal of Operational Research 132 (1), 224-242, 2001
2692001
Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family setups
PM França, JND Gupta, AS Mendes, P Moscato, KJ Veltink
Computers & Industrial Engineering 48 (3), 491-506, 2005
1872005
A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times
PM França, M Gendreau, G Laporte, FM Müller
International Journal of Production Economics 43 (2-3), 79-89, 1996
1821996
A new memetic algorithm for the asymmetric traveling salesman problem
L Buriol, PM França, P Moscato
Journal of Heuristics 10, 483-506, 2004
1692004
Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem
CFM Toledo, PM França, R Morabito, A Kimms
International Journal of Production Research 47 (11), 3097-3119, 2009
1412009
The m-traveling salesman problem with minmax objective
PM França, M Gendreau, G Laporte, FM Müller
Transportation Science 29 (3), 267-275, 1995
1301995
The combined cutting stock and lot-sizing problem in industrial processes
MCN Gramani, PM França
European Journal of Operational Research 174 (1), 509-521, 2006
1282006
A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
CFM Toledo, M da Silva Arantes, MYB Hossomi, PM França, K Akartunalı
Journal of heuristics 21, 687-717, 2015
1102015
Genome-wide meta-analysis of cerebral white matter hyperintensities in patients with stroke
M Traylor, CR Zhang, P Adib-Samii, WJ Devan, OE Parsons, ...
Neurology 86 (2), 146-153, 2016
1032016
A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging
CFM Toledo, RRR De Oliveira, PM França
Computers & Operations Research 40 (4), 910-919, 2013
1002013
Comparing meta-heuristic approaches for parallel machine scheduling problems
AS Mendes, FM Müller, PM França, P Moscato
Production Planning & Control 13 (2), 143-154, 2002
992002
An adaptive tabu search algorithm for the capacitated clustering problem
PM França, NM Sosa, V Pureza
International Transactions in Operational Research 6 (6), 665-678, 1999
941999
A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
PM França, M Gendreau, G Laporte, FM Müller
Computers & operations research 21 (2), 205-210, 1994
931994
A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem
MCN Gramani, PM França, MN Arenales
International Journal of Production Economics 119 (2), 219-227, 2009
922009
A heuristic method for lot-sizing in multi-stage systems
PM França, VA Armentano, RE Berretta, AR Clark
Computers & Operations Research 24 (9), 861-874, 1997
911997
Solving stochastic transportation-location problems by generalized Benders decomposition
PM Franca, HPL Luna
Transportation Science 16 (2), 113-126, 1982
891982
Capacitor placement in large-sized radial distribution networks
A Mendes, PM Franca, C Lyra, C Pissarra, C Cavellucci
IEE Proceedings-Generation, Transmission and Distribution 152 (4), 496-502, 2005
822005
GRASP with evolutionary path-relinking for the capacitated arc routing problem
FL Usberti, PM França, ALM França
Computers & Operations Research 40 (12), 3206-3217, 2013
802013
Vehicle routing problems via tabu search metaheuristic
VM Pureza, PM França
Centre De Recherche Sur Les Transports Publication, 1991
751991
A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem
CFM Toledo, L de Oliveira, R de Freitas Pereira, PM Franca, R Morabito
Computers & Operations Research 48, 40-52, 2014
722014
Hệ thống không thể thực hiện thao tác ngay bây giờ. Hãy thử lại sau.
Bài viết 1–20