Rubén Ruiz
Orcid: 0000-0003-3295-3888
According to our database1,
Rubén Ruiz
authored at least 115 papers
between 2003 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Solving the yard crane scheduling problem with dynamic assignment of input/output points.
Comput. Oper. Res., 2025
2024
The container premarshalling problem under limited crane time: A constraint programming approach.
Comput. Oper. Res., 2024
2023
A collaborative iterated greedy algorithm with reinforcement learning for energy-aware distributed blocking flow-shop scheduling.
Swarm Evol. Comput., December, 2023
IEEE Trans. Cybern., 2023
Int. Trans. Oper. Res., 2023
An incremental learning evolutionary algorithm for many-objective optimization with irregular Pareto fronts.
Inf. Sci., 2023
Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook.
INFORMS J. Comput., 2023
Eur. J. Oper. Res., 2023
Introduction to the special issue on the role of operational research in future epidemics/ pandemics.
Eur. J. Oper. Res., 2023
Smart Offloading Computation-intensive & Delay-intensive Tasks of Real-time Workflows in Mobile Edge Computing.
Proceedings of the IEEE International Conference on Web Services, 2023
2022
IEEE Trans. Serv. Comput., 2022
IEEE Trans. Serv. Comput., 2022
IEEE Trans. Serv. Comput., 2022
IEEE Trans. Serv. Comput., 2022
Swarm Intell., 2022
A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion.
Knowl. Based Syst., 2022
IEEE Internet Things J., 2022
A parameter-Less iterated greedy method for the hybrid flowshop scheduling problem with setup times and due date windows.
Eur. J. Oper. Res., 2022
Sci. China Inf. Sci., 2022
Automatic generation of iterated greedy algorithms for the non-permutation flow shop scheduling problem with total completion time minimization.
Comput. Ind. Eng., 2022
2021
IEEE Trans. Syst. Man Cybern. Syst., 2021
IEEE Trans. Parallel Distributed Syst., 2021
IEEE Trans. Cloud Comput., 2021
Eur. J. Oper. Res., 2021
Solving the generalized multi-port container stowage planning problem by a matheuristic algorithm.
Comput. Oper. Res., 2021
Proceedings of the 24th IEEE International Conference on Computer Supported Cooperative Work in Design, 2021
2020
IEEE Trans. Serv. Comput., 2020
IEEE Trans. Parallel Distributed Syst., 2020
IEEE Trans. Computers, 2020
Allocating MapReduce workflows with deadlines to heterogeneous servers in a cloud data center.
Serv. Oriented Comput. Appl., 2020
J. Sched., 2020
Mass casualty management in disaster scene: A systematic review of OR&MS research in humanitarian operations.
Eur. J. Oper. Res., 2020
Eur. J. Oper. Res., 2020
Ergonomic risk and cycle time minimization for the U-shaped worker assignment assembly line balancing problem: A multi-objective approach.
Comput. Oper. Res., 2020
Proceedings of the 13th International Joint Conference on Biomedical Engineering Systems and Technologies (BIOSTEC 2020), 2020
2019
IEEE Trans. Cybern., 2019
Resource Provisioning for Task-Batch Based Workflows with Deadlines in Public Clouds.
IEEE Trans. Cloud Comput., 2019
A Microwave Polarimeter Demonstrator for Astronomy with Near-Infra-Red Up-Conversion for Optical Correlation and Detection.
Sensors, 2019
Eur. J. Oper. Res., 2019
OR models in urban service facility location: A critical review of applications and future developments.
Eur. J. Oper. Res., 2019
Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times.
Comput. Oper. Res., 2019
Proceedings of the HCI for Cybersecurity, Privacy and Trust, 2019
Feature Selection via Adaptive Spectral Clustering based on Joint Mutual Information.
Proceedings of the 23rd IEEE International Conference on Computer Supported Cooperative Work in Design, 2019
Proceedings of the 23rd IEEE International Conference on Computer Supported Cooperative Work in Design, 2019
2018
Methods for Scheduling Problems Considering Experience, Learning, and Forgetting Effects.
IEEE Trans. Syst. Man Cybern. Syst., 2018
IEEE Trans. Serv. Comput., 2018
IEEE Trans. Parallel Distributed Syst., 2018
IEEE Trans. Cybern., 2018
An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects.
Inf. Sci., 2018
Idle block based methods for cloud workflow scheduling with preemptive and non-preemptive tasks.
Future Gener. Comput. Syst., 2018
Future Gener. Comput. Syst., 2018
Proceedings of the 22nd IEEE International Conference on Computer Supported Cooperative Work in Design, 2018
2017
An Exact Algorithm for the Shortest Path Problem With Position-Based Learning Effects.
IEEE Trans. Syst. Man Cybern. Syst., 2017
A delay-based dynamic scheduling algorithm for bag-of-task workflows with stochastic task execution times in clouds.
Future Gener. Comput. Syst., 2017
Eur. J. Oper. Res., 2017
Eur. J. Oper. Res., 2017
An iterated greedy heuristic for a market segmentation problem with multiple attributes.
Eur. J. Oper. Res., 2017
A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation.
Eur. J. Oper. Res., 2017
Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources.
Eur. J. Oper. Res., 2017
Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows.
Comput. Oper. Res., 2017
Proceedings of the 2017 IEEE International Conference on Systems, Man, and Cybernetics, 2017
Proceedings of the 21st IEEE International Conference on Computer Supported Cooperative Work in Design, 2017
Proceedings of the 12th Chinese Conference on Computer Supported Cooperative Work and Social Computing, 2017
2016
Inf. Sci., 2016
Scheduling Stochastic Multi-stage Jobs on Elastic Computing Services in Hybrid Clouds.
Proceedings of the IEEE International Conference on Web Services, 2016
Proceedings of the Human Centered Computing - Second International Conference, 2016
2015
Eur. J. Oper. Res., 2015
2014
A scatter search algorithm for the distributed permutation flowshop scheduling problem.
Eur. J. Oper. Res., 2014
Simple constructive heuristics for the Distributed Assembly Permutation Flowshop Scheduling Problem with sequence dependent setup times.
Proceedings of the International Conference on Control, 2014
2013
Multi-objective sequence dependent setup times permutation flowshop: A new algorithm and a comprehensive study.
Eur. J. Oper. Res., 2013
A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime.
Comput. Oper. Res., 2013
2012
Eur. J. Oper. Res., 2012
Comput. Oper. Res., 2012
The effect of the asymmetry of road transportation networks on the traveling salesman problem.
Comput. Oper. Res., 2012
Comput. Oper. Res., 2012
Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm.
Comput. Ind. Eng., 2012
Efficient Waste Collection by Means of Assignment Problems.
Proceedings of the ICORES 2012, 2012
2011
A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times.
Eur. J. Oper. Res., 2011
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., 2011
Restarted Iterated Pareto Greedy algorithm for multi-objective flowshop scheduling problems.
Comput. Oper. Res., 2011
Comput. Oper. Res., 2011
2010
Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems.
Int. J. Metaheuristics, 2010
Eur. J. Oper. Res., 2010
Architecture of manufacturing scheduling systems: Literature review and an integrated proposal.
Eur. J. Oper. Res., 2010
Eur. J. Oper. Res., 2010
Appl. Soft Comput., 2010
Proceedings of the Seventh International Conference on Information Technology: New Generations, 2010
2009
Eur. J. Oper. Res., 2009
Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness.
Comput. Oper. Res., 2009
2008
A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem.
INFORMS J. Comput., 2008
An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives.
Eur. J. Oper. Res., 2008
Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics.
Comput. Oper. Res., 2008
Comput. Oper. Res., 2008
Comput. Ind. Eng., 2008
Proceedings of the 2008 Winter Simulation Conference, Global Gateway to Discovery, 2008
2007
A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem.
Eur. J. Oper. Res., 2007
Considering scheduling and preventive maintenance in the flowshop sequencing problem.
Comput. Oper. Res., 2007
Some effective heuristics for no-wait flowshops with setup times to minimize total completion time.
Ann. Oper. Res., 2007
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
2006
Holger H. Hoos and Thomas Stützle, Stochastic Local Search: Foundations and Applications, Morgan Kaufmann Publishers (2005).
Eur. J. Oper. Res., 2006
A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility.
Eur. J. Oper. Res., 2006
2005
Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics.
Eur. J. Oper. Res., 2005
Eur. J. Oper. Res., 2005
2004
Eur. J. Oper. Res., 2004
2003
Solving the Multi-Mode Resource-Constrained Project Scheduling Problem with genetic algorithms.
J. Oper. Res. Soc., 2003