default search action
Camino R. Vela
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j38]Noelia Rico, Camino R. Vela, Irene Díaz
:
Runtime bounds prediction for the Kemeny problem. J. Ambient Intell. Humaniz. Comput. 15(1): 175-185 (2024) - [c47]Sezin Afsar
A Genetic Approach to Green Flexible Job Shop Problem Under Uncertainty. IWINAC (2) 2024: 183-192 - 2023
- [j37]Sezin Afsar, Camino R. Vela, Juan José Palacios
Mathematical models and benchmarking for the fuzzy job shop scheduling problem. Comput. Ind. Eng. 183: 109454 (2023) - [j36]Noelia Rico, Camino R. Vela
Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner. Eur. J. Oper. Res. 305(3): 1323-1336 (2023) - [j35]Pablo García-Gómez
Enhanced memetic search for reducing energy consumption in fuzzy flexible job shops. Integr. Comput. Aided Eng. 30(2): 151-167 (2023) - [j34]Hernán Díaz, Juan José Palacios
An elitist seasonal artificial bee colony algorithm for the interval job shop. Integr. Comput. Aided Eng. 30(3): 223-242 (2023) - [j33]Hernán Díaz, Juan José Palacios
Robust schedules for tardiness optimization in job shop with interval uncertainty. Log. J. IGPL 31(2): 240-254 (2023) - [j32]Hernán Díaz, Juan José Palacios
Fast elitist ABC for makespan optimisation in interval JSP. Nat. Comput. 22(4): 645-657 (2023) - [j31]Pablo García-Gómez, Camino R. Vela, Inés González Rodríguez:
Neighbourhood search for energy minimisation in flexible job shops under fuzziness. Nat. Comput. 22(4): 685-704 (2023) - 2022
- [j30]Sezin Afsar
Multi-objective enhanced memetic algorithm for green job shop scheduling with uncertain times. Swarm Evol. Comput. 68: 101016 (2022) - [c46]Carlos Carmona-Muñoz, Juan José Palacios Alonso
Solving a Vehicle Routing Problem with uncertain demands and adaptive credibility thresholds. FUZZ-IEEE 2022: 1-8 - [c45]Hernán Díaz
Elite Artificial Bee Colony for Makespan Optimisation in Job Shop with Interval Uncertainty. IWINAC (1) 2022: 98-108 - [c44]Pablo García-Gómez
Reducing Energy Consumption in Fuzzy Flexible Job Shops Using Memetic Search. IWINAC (1) 2022: 140-150 - 2020
- [j29]Camino R. Vela
Evolutionary tabu search for flexible due-date satisfaction in fuzzy job shop scheduling. Comput. Oper. Res. 119: 104931 (2020) - [j28]Inés González Rodríguez
Multi-objective evolutionary algorithm for solving energy-aware fuzzy job shop problems. Soft Comput. 24(21): 16291-16302 (2020) - [c43]Hernán Díaz
Tardiness Minimisation for Job Shop Scheduling with Interval Uncertainty. HAIS 2020: 209-220 - [c42]Hernán Díaz
A Genetic Approach to the Job Shop Scheduling Problem with Interval Uncertainty. IPMU (2) 2020: 663-676
2010 – 2019
- 2019
- [j27]Juan José Palacios
Satisfying flexible due dates in fuzzy job shop by means of hybrid evolutionary algorithms. Integr. Comput. Aided Eng. 26(1): 65-84 (2019) - 2018
- [j26]Jorge García-Álvarez, Miguel A. González
Metaheuristics for solving a real-world electric vehicle charging scheduling problem. Appl. Soft Comput. 65: 292-306 (2018) - [j25]Jorge García-Álvarez, Inés González Rodríguez
Genetic fuzzy schedules for charging electric vehicles. Comput. Ind. Eng. 121: 51-61 (2018) - 2017
- [j24]Juan José Palacios
Robust multiobjective optimisation for fuzzy job shop problems. Appl. Soft Comput. 56: 604-616 (2017) - [j23]Miguel A. González
Scatter search for minimizing weighted tardiness in a single machine scheduling with setups. J. Heuristics 23(2-3): 81-110 (2017) - [c41]Jorge García-Álvarez, Miguel A. González, Camino R. Vela, Ramiro Varela
Electric Vehicle Charging Scheduling Using an Artificial Bee Colony Algorithm. IWINAC (1) 2017: 115-124 - [c40]Juan José Palacios
A Memetic Algorithm for Due-Date Satisfaction in Fuzzy Job Shop Scheduling. IWINAC (1) 2017: 135-145 - 2016
- [j22]Juan José Palacios
Benchmarks for fuzzy job shop problems. Inf. Sci. 329: 736-752 (2016) - 2015
- [j21]Miguel A. González
An advanced scatter search algorithm for solving job shops with sequence dependent and non-anticipatory setups. AI Commun. 28(2): 179-193 (2015) - [j20]Juan José Palacios
A particle swarm solution based on lexicographical goal programming for a multiobjective fuzzy open shop problem. AI Commun. 28(2): 239-257 (2015) - [j19]Miguel A. González
An efficient memetic algorithm for total weighted tardiness minimization in a single machine with setups. Appl. Soft Comput. 37: 506-518 (2015) - [j18]Juan José Palacios
Genetic tabu search for the fuzzy flexible job shop problem. Comput. Oper. Res. 54: 74-89 (2015) - [j17]Miguel A. González
Scatter search with path relinking for the flexible job shop scheduling problem. Eur. J. Oper. Res. 245(1): 35-45 (2015) - [j16]Juan José Palacios
Coevolutionary makespan optimisation through different ranking methods for the fuzzy flexible job shop. Fuzzy Sets Syst. 278: 81-97 (2015) - [j15]Juan José Palacios
Swarm lexicographic goal programming for fuzzy open shop scheduling. J. Intell. Manuf. 26(6): 1201-1215 (2015) - [c39]Jorge García-Álvarez, Miguel A. González, Camino R. Vela
A Genetic Algorithm for Scheduling Electric Vehicle Charging. GECCO 2015: 393-400 - 2014
- [j14]Juan José Palacios
Robust swarm optimisation for fuzzy open shop scheduling. Nat. Comput. 13(2): 145-156 (2014) - [c38]Juan José Palacios
Schedule Generation Schemes for Job Shop Problems with Fuzziness. ECAI 2014: 687-692 - [c37]Juan José Palacios
β-Robust Solutions for the Fuzzy Open Shop Scheduling. IPMU (1) 2014: 447-456 - 2013
- [j13]Miguel A. González
Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times. J. Intell. Manuf. 24(4): 741-754 (2013) - [c36]Miguel A. González, Camino R. Vela, Ramiro Varela:
An Efficient Memetic Algorithm for the Flexible Job Shop with Setup Times. ICAPS 2013 - [c35]Jorge Puente-Peinador
GRASPing Examination Board Assignments for University-Entrance Exams. IEA/AIE 2013: 171-180 - [c34]Juan José Palacios
Hybrid Tabu Search for Fuzzy Job Shop. IWINAC (1) 2013: 376-385 - 2012
- [j12]Miguel A. González
A competent memetic algorithm for complex scheduling. Nat. Comput. 11(1): 151-160 (2012) - [j11]Miguel A. González
An efficient hybrid evolutionary algorithm for scheduling with setup times and weighted tardiness minimization. Soft Comput. 16(12): 2097-2113 (2012) - 2011
- [c33]Jorge Puente
Combining Neighbourhoods in Fuzzy Job Shop Problems. CAEPIA 2011: 343-352 - [c32]Miguel A. González
Weighted Tardiness Minimization in Job Shops with Setup Times by Hybrid Genetic Algorithm. CAEPIA 2011: 363-372 - [c31]Juan José Palacios
Particle Swarm Optimisation for Open Shop Problems with Fuzzy Durations. IWINAC (1) 2011: 362-371 - 2010
- [j10]Camino R. Vela
Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J. Heuristics 16(2): 139-165 (2010) - [j9]Inés González Rodríguez
A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty. J. Intell. Manuf. 21(1): 65-73 (2010) - [c30]Jorge Puente
Fast Local Search for Fuzzy Job Shop Scheduling. ECAI 2010: 739-744 - [c29]Inés González Rodríguez
Heuristic local search for fuzzy open shop scheduling. FUZZ-IEEE 2010: 1-8
2000 – 2009
- 2009
- [j8]Ramiro Varela
An effective solution for a real cutting stock problem in manufacturing plastic rolls. Ann. Oper. Res. 166(1): 125-146 (2009) - [c28]Inés González Rodríguez, Camino R. Vela, Jorge Puente, Alejandro Hernández-Arauzo:
Improved Local Search for Job Shop Scheduling with uncertain Durations. ICAPS 2009 - [c27]Miguel A. González, Camino R. Vela
A Tabu Search Algorithm to Minimize Lateness in Scheduling Problems with Setup Times. CAEPIA 2009: 212-221 - [c26]Jorge Puente
Improving Local Search for the Fuzzy Job Shop Using a Lower Bound. CAEPIA 2009: 222-232 - [c25]Juan José Palacios
A Genetic Algorithm for the Open Shop Problem with Uncertain Durations. IWINAC (1) 2009: 255-264 - [c24]Miguel A. González
Genetic Algorithm Combined with Tabu Search for the Job Shop Scheduling Problem with Setup Times. IWINAC (1) 2009: 265-274 - 2008
- [j7]Inés González Rodríguez
Semantics of Schedules for the Fuzzy Job-Shop Problem. IEEE Trans. Syst. Man Cybern. Part A 38(3): 655-666 (2008) - [c23]Miguel A. González, Camino R. Vela, Ramiro Varela:
A New Hybrid Genetic Algorithm for the Job Shop Scheduling Problem with Setup Times. ICAPS 2008: 116-123 - [c22]Inés González Rodríguez, Camino R. Vela, Jorge Puente, Ramiro Varela:
A New Local Search for the Job Shop Problem with Uncertain Durations. ICAPS 2008: 124-131 - [c21]Inés González Rodríguez
A Study of Schedule Robustness for Job Shop with Uncertainty. IBERAMIA 2008: 31-41 - 2007
- [c20]Inés González Rodríguez
A Multiobjective Approach to Fuzzy Job Shop Problem Using Genetic Algorithms. CAEPIA 2007: 80-89 - [c19]Inés González Rodríguez
A Memetic Approach to Fuzzy Job Shop Based on Expectation Model. FUZZ-IEEE 2007: 1-6 - [c18]César Muñoz, María R. Sierra, Jorge Puente
Improving Cutting-Stock Plans with Multi-objective Genetic Algorithms. IWINAC (1) 2007: 528-537 - [c17]Inés González Rodríguez
Sensitivity Analysis for the Job Shop Problem with Uncertain Durations and Flexible Due Dates. IWINAC (1) 2007: 538-547 - [c16]Noelia González, Camino R. Vela
Comparative Study of Meta-heuristics for Solving Flow Shop Scheduling Problem Under Fuzziness. IWINAC (1) 2007: 548-557 - 2006
- [c15]Inés González Rodríguez
Study of Objective Functions in Fuzzy Job-Shop Problem. ICAISC 2006: 360-369 - [c14]Miguel A. González, Camino R. Vela
Scheduling with Memetic Algorithms over the Spaces of Semi-active and Active Schedules. ICAISC 2006: 370-379 - [c13]Miguel A. González, María R. Sierra, Camino R. Vela, Ramiro Varela, Jorge Puente:
Combining metaheuristics for the job shop scheduling problem with sequence dependent setup times. ICSOFT (2) 2006: 211-218 - [c12]Miguel A. González
Combining Metaheuristics for the Job Shop Scheduling Problem with Sequence Dependent Setup Times. ICSOFT (Selected Papers) 2006: 348-360 - [c11]Miguel A. González
Comparing Schedule Generation Schemes in Memetic Algorithms for the Job Shop Scheduling Problem with Sequence Dependent Setup Times. MICAI 2006: 472-482 - 2005
- [c10]Miguel A. González, María R. Sierra, Camino R. Vela
Genetic Algorithms Hybridized with Greedy Algorithms and Local Search over the Spaces of Active and Semi-active Schedules. CAEPIA 2005: 231-240 - [c9]Inés González Rodríguez
An Evolutionary Approach to Designing and Solving Fuzzy Job-Shop Problems. IWINAC (2) 2005: 74-83 - 2003
- [j6]Camino R. Vela, Jorge Puente, César Luis Alonso, Ramiro Varela:
Computación Evolutiva para Resolución de CSPs. Inteligencia Artif. 7(20): 57-68 (2003) - [j5]Ramiro Varela
A knowledge-based evolutionary strategy for scheduling problems with bottlenecks. Eur. J. Oper. Res. 145(1): 57-71 (2003) - [c8]Jorge Puente
Heuristic Rules and Genetic Algorithms for Open Shop Scheduling Problem. CAEPIA 2003: 394-403 - [c7]Jorge Puente
Hybridizing a Genetic Algorithm with Local Search and Heuristic Seeding. IWANN (2) 2003: 329-336 - 2002
- [c6]Ramiro Varela, Camino R. Vela, Jorge Puente, David Serrano, Ana Suárez:
A New Chromosome Codification for Scheduling Problems. JCIS 2002: 647-650 - 2001
- [j4]César Luis Alonso, Camino R. Vela
Ordered structures for parallel rule-based computations. Int. J. Comput. Math. 78(4): 499-520 (2001) - [c5]Camino R. Vela, Ramiro Varela
Initialization in Genetic Algorithms for Constraint Satisfaction Problems. IWANN (1) 2001: 693-700 - 2000
- [j3]Ramiro Varela
Parallel Logic Programming for Problem Solving. Int. J. Parallel Program. 28(3): 275-319 (2000)
1990 – 1999
- 1999
- [c4]Ramiro Varela
Heuristic Generation of the Initial Population in Solving Job Shop Problems by Evolutionary Strategies. IWANN (1) 1999: 690-699 - 1998
- [c3]Jorge Puente, Ramiro Varela, Camino R. Vela, César Luis Alonso:
A Parallel Programming Approach to Job Shop Scheduling Constrain Satisfaction Problems. APPIA-GULP-PRODE 1998: 29-42 - 1997
- [c2]Camino R. Vela
A Genetic Approach to Computing Independent AND Parallelism in Logic Programs. IWANN 1997: 566-575 - 1996
- [c1]Ramiro Varela, Camino R. Vela, Jorge Puente:
Efficient Producer/Consumer Parallelism in Logic Programming. APPIA-GULP-PRODE 1996: 233-244 - 1995
- [j2]Camino R. Vela
The Best Nondeterministic Representations of Finite Orderings. J. Comput. Syst. Sci. 51(3): 486-494 (1995) - 1992
- [j1]Camino R. Vela
An algorithm to minimize representations of finite order relations. Int. J. Comput. Math. 41(3-4): 139-150 (1992)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-05 21:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: