Ant algorithms for a time and space constrained assembly line balancing problem J Bautista, J Pereira European journal of operational research 177 (3), 2016-2032, 2007 | 281 | 2007 |
Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona J Bautista, J Pereira Omega 34 (6), 617-629, 2006 | 213 | 2006 |
Solving an urban waste collection problem using ants heuristics J Bautista, E Fernández, J Pereira Computers & Operations Research 35 (9), 3020-3033, 2008 | 176 | 2008 |
A dynamic programming based heuristic for the assembly line balancing problem J Bautista, J Pereira European Journal of Operational Research 194 (3), 787-794, 2009 | 149 | 2009 |
Ant algorithms for assembly line balancing J Bautista, J Pereira Ant Algorithms: Third International Workshop, ANTS 2002 Brussels, Belgium …, 2002 | 131 | 2002 |
A branch-and-bound algorithm for assembly line worker assignment and balancing problems M Vila, J Pereira Computers & Operations Research 44, 105-114, 2014 | 125 | 2014 |
A GRASP algorithm to solve the unicost set covering problem J Bautista, J Pereira Computers & Operations Research 34 (10), 3162-3173, 2007 | 73 | 2007 |
An exact approach for the robust assembly line balancing problem J Pereira, E Álvarez-Miranda Omega 78, 85-98, 2018 | 71 | 2018 |
Exact and heuristic algorithms for the interval data robust assignment problem J Pereira, I Averbakh Computers & Operations Research 38 (8), 1153-1163, 2011 | 58 | 2011 |
A memetic algorithm for the cost-oriented robotic assembly line balancing problem J Pereira, M Ritt, ÓC Vásquez Computers & Operations Research 99, 249-261, 2018 | 55 | 2018 |
The robust set covering problem with interval data J Pereira, I Averbakh Annals of Operations Research 207, 217-235, 2013 | 55 | 2013 |
The flowtime network construction problem I Averbakh, J Pereira Iie Transactions 44 (8), 681-694, 2012 | 54 | 2012 |
The robust (minmax regret) assembly line worker assignment and balancing problem J Pereira Computers & Operations Research 93, 27-40, 2018 | 49 | 2018 |
The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective J Pereira Computers & Operations Research 66, 141-152, 2016 | 48 | 2016 |
Models and procedures for electric energy distribution planning. A review R Sempértegui, J Bautista, RG Cubero, J Pereira IFAC Proceedings Volumes 35 (1), 395-400, 2002 | 42 | 2002 |
Ant algorithms for urban waste collection routing J Bautista, J Pereira Ant Colony Optimization and Swarm Intelligence: 4th International Workshop …, 2004 | 40 | 2004 |
A GRASP approach for the extended car sequencing problem J Bautista, J Pereira, B Adenso-Díaz Journal of Scheduling 11, 3-16, 2008 | 37 | 2008 |
Procedures for the time and space constrained assembly line balancing problem J Bautista, J Pereira European Journal of Operational Research 212 (3), 473-481, 2011 | 36 | 2011 |
Beam-ACO applied to assembly line balancing C Blum, J Bautista, J Pereira Ant Colony Optimization and Swarm Intelligence: 5th International Workshop …, 2006 | 36 | 2006 |
A beam search approach for the optimization version of the car sequencing problem J Bautista, J Pereira, B Adenso-Díaz Annals of Operations Research 159, 233-244, 2008 | 35 | 2008 |