default search action
Rubén Ruiz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j95]Hongtao Wang
, Fulgencia Villa, Eva Vallada, Rubén Ruiz
Solving the yard crane scheduling problem with dynamic assignment of input/output points. Comput. Oper. Res. 173: 106853 (2025) - 2024
- [j94]Celia Jiménez-Piqueras
The container premarshalling problem under limited crane time: A constraint programming approach. Comput. Oper. Res. 166: 106635 (2024) - 2023
- [j93]Reza Zanjirani Farahani, Rubén Ruiz, Luk N. Van Wassenhove:
Introduction to the special issue on the role of operational research in future epidemics/ pandemics. Eur. J. Oper. Res. 304(1): 1-8 (2023) - [j92]Celia Jiménez-Piqueras
A constraint programming approach for the premarshalling problem. Eur. J. Oper. Res. 306(2): 668-678 (2023) - [j91]Bahman Naderi
Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook. INFORMS J. Comput. 35(4): 817-843 (2023) - [j90]Mingjing Wang
An incremental learning evolutionary algorithm for many-objective optimization with irregular Pareto fronts. Inf. Sci. 642: 119115 (2023) - [j89]Juan G. Villegas, Jorge E. Mendoza, Celso C. Ribeiro, Rubén Ruiz, Andrés L. Medaglia:
Preface to the Special Issue on Developments in Metaheuristics. Int. Trans. Oper. Res. 30(2): 653-654 (2023) - [j88]Haizhu Bao, Quanke Pan, Rubén Ruiz, Liang Gao
A collaborative iterated greedy algorithm with reinforcement learning for energy-aware distributed blocking flow-shop scheduling. Swarm Evol. Comput. 83: 101399 (2023) - [j87]Yadi Wang
Feature Selection With Maximal Relevance and Minimal Supervised Redundancy. IEEE Trans. Cybern. 53(2): 707-717 (2023) - [j86]Guangshun Yao
Failure-Aware Elastic Cloud Workflow Scheduling. IEEE Trans. Serv. Comput. 16(3): 1846-1859 (2023) - [c17]Haihong Zhu, Xiaoping Li, Long Chen, Rubén Ruiz:
Smart Offloading Computation-intensive & Delay-intensive Tasks of Real-time Workflows in Mobile Edge Computing. ICWS 2023: 695-697 - 2022
- [j85]Artur Brum, Rubén Ruiz, Marcus Ritt:
Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization. Comput. Ind. Eng. 163: 107843 (2022) - [j84]Xiaoping Li, Dongyuan Pan, Yadi Wang, Rubén Ruiz:
Scheduling multi-tenant cloud workflow tasks with resource reliability. Sci. China Inf. Sci. 65(9): 1-18 (2022) - [j83]Ahmed Missaoui, Rubén Ruiz
A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows. Eur. J. Oper. Res. 303(1): 99-113 (2022) - [j82]Zhang Xiaodong
Task Scheduling for Spark Applications With Data Affinity on Heterogeneous Clusters. IEEE Internet Things J. 9(21): 21792-21801 (2022) - [j81]Yuanzhen Li
A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion. Knowl. Based Syst. 239: 108036 (2022) - [j80]Claus Aranha
Metaphor-based metaheuristics, a call for action: the elephant in the room. Swarm Intell. 16(1): 1-6 (2022) - [j79]Xiaoping Li
A Survey on Sparse Learning Models for Feature Selection. IEEE Trans. Cybern. 52(3): 1642-1660 (2022) - [j78]Xiaoping Li
Energy-Aware Cloud Workflow Applications Scheduling With Geo-Distributed Data. IEEE Trans. Serv. Comput. 15(2): 891-903 (2022) - [j77]Jia Wang, Xiaoping Li
Energy Utilization Task Scheduling for MapReduce in Heterogeneous Clusters. IEEE Trans. Serv. Comput. 15(2): 931-944 (2022) - [j76]Guangshun Yao
A Hybrid Fault-Tolerant Scheduling for Deadline-Constrained Tasks in Cloud Systems. IEEE Trans. Serv. Comput. 15(3): 1371-1384 (2022) - [j75]Xiaoping Li
MapReduce Task Scheduling in Heterogeneous Geo-Distributed Data Centers. IEEE Trans. Serv. Comput. 15(6): 3317-3329 (2022) - 2021
- [j74]Consuelo Parreño-Torres
Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm. Comput. Oper. Res. 133: 105383 (2021) - [j73]Juan C. Yepes-Borrero
Bi-objective parallel machine scheduling with additional resources during setups. Eur. J. Oper. Res. 292(2): 443-455 (2021) - [j72]Long Chen, Xiaoping Li
Hybrid Resource Provisioning for Cloud Workflows with Malleable and Rigid Tasks. IEEE Trans. Cloud Comput. 9(3): 1089-1102 (2021) - [j71]Shuang Wang
Multi-Queue Request Scheduling for Profit Maximization in IaaS Clouds. IEEE Trans. Parallel Distributed Syst. 32(11): 2838-2851 (2021) - [j70]Haiyan Xu, Xiaoping Li
Group Scheduling With Nonperiodical Maintenance and Deteriorating Effects. IEEE Trans. Syst. Man Cybern. Syst. 51(5): 2860-2872 (2021) - [c16]Wenzheng Li, Xiaoping Li, Rubén Ruiz:
Scheduling Microservice-based Workflows to Containers in On-demand Cloud Resources. CSCWD 2021: 61-66 - 2020
- [j69]Zikai Zhang
Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: A multi-objective approach. Comput. Oper. Res. 118: 104905 (2020) - [j68]Pedro Alfaro-Fernández
Automatic Algorithm Design for Hybrid Flowshop Scheduling Problems. Eur. J. Oper. Res. 282(3): 835-845 (2020) - [j67]Reza Zanjirani Farahani
Mass casualty management in disaster scene: A systematic review of OR&MS research in humanitarian operations. Eur. J. Oper. Res. 287(3): 787-819 (2020) - [j66]Tolga Bektas
Benders decomposition for the mixed no-idle permutation flowshop scheduling problem. J. Sched. 23(4): 513-523 (2020) - [j65]Jia Wang, Xiaoping Li
Allocating MapReduce workflows with deadlines to heterogeneous servers in a cloud data center. Serv. Oriented Comput. Appl. 14(2): 101-118 (2020) - [j64]Shuang Wang, Xiaoping Li
Performance Analysis for Heterogeneous Cloud Servers Using Queueing Theory. IEEE Trans. Computers 69(4): 563-576 (2020) - [j63]Jie Zhu
Scheduling Periodical Multi-Stage Jobs With Fuzziness to Elastic Cloud Resources. IEEE Trans. Parallel Distributed Syst. 31(12): 2819-2833 (2020) - [j62]Long Chen, Xiaoping Li
Resource Renting for Periodical Cloud Workflow Applications. IEEE Trans. Serv. Comput. 13(1): 130-143 (2020) - [c15]Aarathi Prasad, Matthew Clark
Analyzing Privacy Practices of Existing mHealth Apps. HEALTHINF 2020: 563-570
2010 – 2019
- 2019
- [j61]Luis Fanjul-Peyro
Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times. Comput. Oper. Res. 101: 173-182 (2019) - [j60]Consuelo Parreño-Torres
Integer programming models for the pre-marshalling problem. Eur. J. Oper. Res. 274(1): 142-154 (2019) - [j59]Reza Zanjirani Farahani
OR models in urban service facility location: A critical review of applications and future developments. Eur. J. Oper. Res. 276(1): 1-27 (2019) - [j58]Shunji Tanaka
A branch and bound approach for large pre-marshalling problems. Eur. J. Oper. Res. 278(1): 211-225 (2019) - [j57]Francisco J. Casas
A Microwave Polarimeter Demonstrator for Astronomy with Near-Infra-Red Up-Conversion for Optical Correlation and Detection. Sensors 19(8): 1870 (2019) - [j56]Zhicheng Cai, Xiaoping Li
Resource Provisioning for Task-Batch Based Workflows with Deadlines in Public Clouds. IEEE Trans. Cloud Comput. 7(3): 814-826 (2019) - [j55]Yadi Wang, Xiaoping Li
Weighted General Group Lasso for Gene Selection in Cancer Classification. IEEE Trans. Cybern. 49(8): 2860-2873 (2019) - [c14]Yadi Wang, Xiaoping Li, Rubén Ruiz, Xia Zhu:
Feature Selection via Adaptive Spectral Clustering based on Joint Mutual Information. CSCWD 2019: 164-169 - [c13]Shuang Wang, Xiaoping Li, Rubén Ruiz, Yun Wang:
Cost Minimization for Service Providers with Impatient Consumers in Cloud Computing. CSCWD 2019: 374-379 - [c12]Aarathi Prasad, Rubén Ruiz, Timothy Stablein:
Understanding Parents' Concerns with Smart Device Usage in the Home. HCI (29) 2019: 176-190 - 2018
- [j54]Zhicheng Cai
Price forecasting for spot instances in Cloud computing. Future Gener. Comput. Syst. 79: 38-53 (2018) - [j53]Long Chen, Xiaoping Li
Idle block based methods for cloud workflow scheduling with preemptive and non-preemptive tasks. Future Gener. Comput. Syst. 89: 659-669 (2018) - [j52]Xiaoping Li
An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects. Inf. Sci. 453: 408-425 (2018) - [j51]Yamin Wang, Xiaoping Li
An Iterated Greedy Heuristic for Mixed No-Wait Flowshop Problems. IEEE Trans. Cybern. 48(5): 1553-1566 (2018) - [j50]Jie Zhu
Scheduling Stochastic Multi-Stage Jobs to Elastic Hybrid Cloud Resources. IEEE Trans. Parallel Distributed Syst. 29(6): 1401-1415 (2018) - [j49]Xiaoping Li
Cloud Workflow Scheduling with Deadlines and Time Slot Availability. IEEE Trans. Serv. Comput. 11(2): 329-340 (2018) - [j48]Xiaoping Li
Methods for Scheduling Problems Considering Experience, Learning, and Forgetting Effects. IEEE Trans. Syst. Man Cybern. Syst. 48(5): 743-754 (2018) - [c11]Yamin Wang, Xiaoping Li, Rubén Ruiz
A Fast Algorithm for Finding the Bi-objective Shortest Path in Complicated Networks. CSCWD 2018: 104-109 - [r3]Thomas Stützle, Rubén Ruiz
Iterated Greedy. Handbook of Heuristics 2018: 547-577 - [r2]Thomas Stützle, Rubén Ruiz
Iterated Local Search. Handbook of Heuristics 2018: 579-605 - [r1]Rubén Ruiz
Scheduling Heuristics. Handbook of Heuristics 2018: 1197-1220 - 2017
- [j47]Quan-Ke Pan
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows. Comput. Oper. Res. 80: 50-60 (2017) - [j46]Victor Fernandez-Viagas
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. Eur. J. Oper. Res. 257(3): 707-721 (2017) - [j45]Xia Zhu, Rubén Ruiz
An effective heuristic for project scheduling with resource availability cost. Eur. J. Oper. Res. 257(3): 746-762 (2017) - [j44]Antonio Martinez-Sykora
Matheuristics for the irregular bin packing problem with free rotations. Eur. J. Oper. Res. 258(2): 440-455 (2017) - [j43]Luis Fanjul-Peyro
Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. Eur. J. Oper. Res. 260(2): 482-493 (2017) - [j42]Diana L. Huerta-Muñoz, Roger Z. Ríos-Mercado
An iterated greedy heuristic for a market segmentation problem with multiple attributes. Eur. J. Oper. Res. 261(1): 75-87 (2017) - [j41]Zhicheng Cai
A delay-based dynamic scheduling algorithm for bag-of-task workflows with stochastic task execution times in clouds. Future Gener. Comput. Syst. 71: 57-72 (2017) - [j40]Yamin Wang, Xiaoping Li
An Exact Algorithm for the Shortest Path Problem With Position-Based Learning Effects. IEEE Trans. Syst. Man Cybern. Syst. 47(11): 3037-3049 (2017) - [c10]Wei Hu, Xiaoping Li
A Trust Constrained Workflow Scheduling Method in Cloud Computing. ChineseCSCW 2017: 197-200 - [c9]Long Chen, Xiaoping Li
Cloud workflow scheduling with on-demand and spot block instances. CSCWD 2017: 451-456 - [c8]Xiaoping Li
Trust constrained workflow scheduling in cloud computing. SMC 2017: 164-169 - 2016
- [j39]Xiaoping Li
Heuristics for periodical batch job scheduling in a MapReduce computing framework. Inf. Sci. 326: 119-133 (2016) - [c7]Long Chen, Yucheng Guo, Xiaoping Li
Hybrid Resource Provisioning for Workflow Scheduling in Cloud Computing. HCC 2016: 34-46 - [c6]Jie Zhu, Xiaoping Li
Scheduling Stochastic Multi-stage Jobs on Elastic Computing Services in Hybrid Clouds. ICWS 2016: 678-681 - 2015
- [j38]Eva Vallada
New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240(3): 666-677 (2015) - 2014
- [j37]Bahman Naderi, Rubén Ruiz
A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur. J. Oper. Res. 239(2): 323-334 (2014) - [c5]Sara Hatami
Simple constructive heuristics for the Distributed Assembly Permutation Flowshop Scheduling Problem with sequence dependent setup times. CoDIT 2014: 19-23 - 2013
- [j36]Quan-Ke Pan
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime. Comput. Oper. Res. 40(1): 117-128 (2013) - [j35]Michele Ciavotta
Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study. Eur. J. Oper. Res. 227(2): 301-313 (2013) - 2012
- [j34]Babak Farhang Moghaddam
Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm. Comput. Ind. Eng. 62(1): 306-317 (2012) - [j33]Alejandro Rodríguez, Rubén Ruiz
The effect of the asymmetry of road transportation networks on the traveling salesman problem. Comput. Oper. Res. 39(7): 1566-1576 (2012) - [j32]Luis Fanjul-Peyro
Scheduling unrelated parallel machines with optional machines and jobs selection. Comput. Oper. Res. 39(7): 1745-1753 (2012) - [j31]Alejandro Rodríguez, Rubén Ruiz
A study on the effect of the asymmetry on real capacitated vehicle routing problems. Comput. Oper. Res. 39(9): 2142-2151 (2012) - [j30]Quan-Ke Pan
Local search methods for the flowshop scheduling problem with flowtime minimization. Eur. J. Oper. Res. 222(1): 31-43 (2012) - [c4]Kostanca Katragjini, Federico Perea, Rubén Ruiz:
Efficient Waste Collection by Means of Assignment Problems. ICORES 2012: 283-292 - 2011
- [j29]Luis Fanjul-Peyro
Size-reduction heuristics for the unrelated parallel machines scheduling problem. Comput. Oper. Res. 38(1): 301-309 (2011) - [j28]Gerardo Minella
Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems. Comput. Oper. Res. 38(11): 1521-1533 (2011) - [j27]Eva Vallada
A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 211(3): 612-622 (2011) - [j26]Rubén Ruiz:
Review of "Experimental Methods for the Analysis of Optimization Algorithms", Thomas Bartz-Beielstein, Marco Chiarandini, Luı's Paquete, Mike Preuss. Springer, 2010. Eur. J. Oper. Res. 214(2): 453-456 (2011) - 2010
- [j25]Angel A. Juan
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem. Appl. Soft Comput. 10(1): 215-224 (2010) - [j24]B. Naderi, Rubén Ruiz
Algorithms for a realistic variant of flowshop scheduling. Comput. Oper. Res. 37(2): 236-246 (2010) - [j23]B. Naderi, Rubén Ruiz
The distributed permutation flowshop scheduling problem. Comput. Oper. Res. 37(4): 754-768 (2010) - [j22]Rubén Ruiz
The hybrid flow shop scheduling problem. Eur. J. Oper. Res. 205(1): 1-18 (2010) - [j21]Jose M. Framiñan
Architecture of manufacturing scheduling systems: Literature review and an integrated proposal. Eur. J. Oper. Res. 205(2): 237-246 (2010) - [j20]Luis Fanjul-Peyro
Iterated greedy local search methods for unrelated parallel machine scheduling. Eur. J. Oper. Res. 207(1): 55-69 (2010) - [j19]Thijs Urlings, Rubén Ruiz
Shifting representation search for hybrid flexible flowline problems. Eur. J. Oper. Res. 207(2): 1086-1095 (2010) - [j18]Thijs Urlings, Rubén Ruiz, Funda Sivrikaya-Serifoglu:
Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems. Int. J. Metaheuristics 1(1): 30-54 (2010) - [c3]Stephen R. Foster, Rubén Ruiz:
Constructivist Pedagogy Meets Agile Development . ITNG 2010: 1092-1096
2000 – 2009
- 2009
- [j17]Rubén Ruiz
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness. Comput. Oper. Res. 36(4): 1268-1283 (2009) - [j16]Eva Vallada
Cooperative metaheuristics for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 193(2): 365-376 (2009) - 2008
- [j15]Marcelo Seido Nagano, Rubén Ruiz
A Constructive Genetic Algorithm for permutation flowshop scheduling. Comput. Ind. Eng. 55(1): 195-207 (2008) - [j14]Rubén Ruiz
Modeling realistic hybrid flexible flowshop scheduling problems. Comput. Oper. Res. 35(4): 1151-1175 (2008) - [j13]Eva Vallada
Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics. Comput. Oper. Res. 35(4): 1350-1373 (2008) - [j12]Rubén Ruiz
An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187(3): 1143-1159 (2008) - [j11]Rubén Ruiz
The Youngest OR in Europe. Eur. J. Oper. Res. 189(3): 579-582 (2008) - [j10]Gerardo Minella
A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem. INFORMS J. Comput. 20(3): 451-471 (2008) - [c2]Javier Faulin
SR-1: A simulation-based algorithm for the Capacitated Vehicle Routing Problem. WSC 2008: 2708-2716 - 2007
- [j9]Rubén Ruiz
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time. Ann. Oper. Res. 156(1): 143-171 (2007) - [j8]Rubén Ruiz
Considering scheduling and preventive maintenance in the flowshop sequencing problem. Comput. Oper. Res. 34(11): 3314-3330 (2007) - [j7]Rubén Ruiz
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3): 2033-2049 (2007) - [c1]Thijs Urlings, Rubén Ruiz:
Local Search in Complex Scheduling Problems. SLS 2007: 202-206 - 2006
- [j6]Rubén Ruiz
A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur. J. Oper. Res. 169(3): 781-800 (2006) - [j5]Rubén Ruiz, Marco Pranzo:
Holger H. Hoos and Thomas Stützle, Stochastic Local Search: Foundations and Applications, Morgan Kaufmann Publishers (2005). Eur. J. Oper. Res. 172(2): 716-718 (2006) - 2005
- [j4]Rubén Ruiz
Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur. J. Oper. Res. 165(1): 34-54 (2005) - [j3]Rubén Ruiz
A comprehensive review and evaluation of permutation flowshop heuristics. Eur. J. Oper. Res. 165(2): 479-494 (2005) - 2004
- [j2]Rubén Ruiz
A decision support system for a real vehicle routing problem. Eur. J. Oper. Res. 153(3): 593-606 (2004) - 2003
- [j1]Javier Alcaraz
Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms. J. Oper. Res. Soc. 54(6): 614-626 (2003)
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-12-10 20:47 CET 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: