Victor Fernandez-Viagas
Orcid: 0000-0001-8498-8885
According to our database1,
Victor Fernandez-Viagas
authored at least 39 papers
between 2014 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2023
Ann. Oper. Res., March, 2023
2022
Exploring the benefits of scheduling with advanced and real-time information integration in Industry 4.0: A computational study.
J. Ind. Inf. Integr., 2022
Constructive and composite heuristics for the 2-stage assembly scheduling problem with periodic maintenance and makespan objective.
Expert Syst. Appl., 2022
Expert Syst. Appl., 2022
A modified harmony search for the T-single machine scheduling problem with variable and flexible maintenance.
Expert Syst. Appl., 2022
Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation.
Eur. J. Oper. Res., 2022
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness.
Comput. Oper. Res., 2022
A critical-path based iterated local search for the green permutation flowshop problem.
Comput. Ind. Eng., 2022
2021
Two novel population based algorithms for the single machine scheduling problem with sequence dependent setup times and release times.
Swarm Evol. Comput., 2021
New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation.
Comput. Ind. Eng., 2021
2020
Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics.
Expert Syst. Appl., 2020
Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling.
Eur. J. Oper. Res., 2020
New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem.
Comput. Ind. Eng., 2020
Comput. Ind. Eng., 2020
Comput. Ind. Eng., 2020
Solving the hybrid flow shop scheduling problem with limited human resource constraint.
Comput. Ind. Eng., 2020
2019
Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures.
Eur. J. Oper. Res., 2019
A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective.
Comput. Oper. Res., 2019
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective.
Comput. Oper. Res., 2019
Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times.
Comput. Ind. Eng., 2019
Using real-time information to reschedule jobs in a flowshop with variable processing times.
Comput. Ind. Eng., 2019
2018
A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem.
Simul. Model. Pract. Theory, 2018
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics.
Expert Syst. Appl., 2018
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness.
Expert Syst. Appl., 2018
Comput. Ind. Eng., 2018
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations.
Comput. Ind. Eng., 2018
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
Comput. Oper. Res., 2017
Reduction of permutation flowshop problems to single machine problems using machine dominance relations.
Comput. Oper. Res., 2017
The value of real-time data in stochastic flowshop scheduling: A simulation study for makespan.
Proceedings of the 2017 Winter Simulation Conference, 2017
2016
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime.
Expert Syst. Appl., 2016
Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness.
Comput. Oper. Res., 2016
Combining simulation with metaheuristics in distributed scheduling problems with stochastic processing times.
Proceedings of the Winter Simulation Conference, 2016
2015
A new set of high-performing heuristics to minimise flowtime in permutation flowshops.
Comput. Oper. Res., 2015
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness.
Comput. Oper. Res., 2015
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness.
Comput. Oper. Res., 2015
Integrated operating room planning and scheduling problem with assistant surgeon dependent surgery durations.
Comput. Ind. Eng., 2015
2014
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem.
Comput. Oper. Res., 2014