Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Joaquín Bautista

dblp:33/1146 · also Joaquín Bautista Valhondo · DBLP profile ↗
← Back
12ranked-venue papers
6as first author
0since 2021 · last 2018
0000-0002-2214-4991ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 11 · 6 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Mathematical optimization › scheduling › production scheduling
assembly line balancing		 0.012000
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks · ICRA 2000
Mathematical optimization
combinatorial optimization		 0.012000
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks · ICRA 2000
Mathematical optimization › evolutionary computation
genetic algorithm		 0.012000
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks · ICRA 2000
Mathematical optimization
metaheuristic optimization		 0.012000
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks · ICRA 2000
Mathematical optimization › combinatorial optimization
local search		 0.012000
Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks · ICRA 2000

Methods — techniques the papers use, named apart from their topics

priority rule heuristics · 0.0greedy randomized adaptive search · 0.0genetic algorithm · 0.0
YearPublicationVenuePosition
2018 An expert system to minimize operational costs in mixed-model sequencing problems with activity factor
Joaquín Bautista, Rocío Alfaro Pozo
 Expert Syst. Appl.1
2015 Consideration of human resources in the Mixed-model Sequencing Problem with Work Overload Minimization: Legal provisions and productivity improvement
Joaquín Bautista, Rocío Alfaro Pozo, Cristina Batalla García
 Expert Syst. Appl.1
2015 Interactive preferences in multiobjective ant colony optimisation for assembly line balancing
Manuel Chica, Oscar Cordón, Sergio Damas, Joaquín Bautista
 Soft Comput.4
2012 Solving the Fm∣block∣Cmax problem using Bounded Dynamic Programming
Joaquín Bautista, Alberto Cano 0002, Ramón Companys, Imma Ribas
 Eng. Appl. Artif. Intell.1
2012 Multiobjective memetic algorithms for time and space assembly line balancing
Manuel Chica, Oscar Cordón, Sergio Damas, Joaquín Bautista
 Eng. Appl. Artif. Intell.4
2012 Modeling and solving a variant of the mixed-model sequencing problem with work overload minimisation and regularity constraints. An application in Nissan's Barcelona Plant
Joaquín Bautista, Alberto Cano 0002, Rocío Alfaro Pozo
 Expert Syst. Appl.1
2011 A bounded dynamic programming algorithm for the MMSP-W considering workstation dependencies and unrestricted interruption of the operations
abstract
In this paper, we propose a procedure based on Bounded Dynamic Programming (BDP) to solve the Mixed-Model Sequencing Problem with Workload Minimisation (MMSP-W), with serial workstations and unrestricted (or free) interruption of the operations. We performed a computational experiment with 225 instances from the literature. The results of our proposal are compared with those obtained through the CPLEX solver.
Joaquín Bautista, Alberto Cano 0002, Rocío Alfaro Pozo
 ISDA1
2011 Including different kinds of preferences in a multi-objective ant algorithm for time and space assembly line balancing on different Nissan scenarios
Manuel Chica, Oscar Cordón, Sergio Damas, Joaquín Bautista
 Expert Syst. Appl.4
2010 A Multiobjective GRASP for the 1/3 Variant of the Time and Space Assembly Line Balancing Problem
Manuel Chica, Oscar Cordón, Sergio Damas, Joaquín Bautista
 IEA/AIE (3)4
2010 Multiobjective constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and random greedy search
Manuel Chica, Oscar Cordón, Sergio Damas, Joaquín Bautista
 Inf. Sci.4
2008 An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem
Christian Blum 0001, Joaquín Bautista, Jordi Pereira
 EvoCOP2
2000 Local Search Heuristics for the Assembly Line Balancing Problem with Incompatibilities Between Tasks
abstract
This paper deals with the assembly line balancing problem considering incompatibilities between the tasks with the aim of: first minimizing the number of workstations, and then minimizing the cycle time for the minimum number of workstations. In order to solve the problem we propose the use of a greedy randomized adaptive search procedure obtained from the application of some classic heuristics based on priority rules, and a genetic algorithm that searches for the solution in the heuristic space. A computational experience is included to illustrate the performance of the proposed approach.
Joaquín Bautista, Raúl Suárez, Manuel Mateo, Ramón Companys
 ICRA1