On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. - Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Oper. Res., 2014)

A Decision Support System for Operating Room scheduling. - Manuel Dios; Jose M. Molina-Pariente; Victor Fernandez-Viagas; José Luis Andrade-Pineda; Jose M. Framiñan (Comput. Ind. Eng., 2015)

Integrated operating room planning and scheduling problem with assistant surgeon dependent surgery durations. - Jose M. Molina-Pariente; Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Ind. Eng., 2015)

NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. - Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Oper. Res., 2015)

Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness. - Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Oper. Res., 2015)

A new set of high-performing heuristics to minimise flowtime in permutation flowshops. - Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Oper. Res., 2015)

Combining simulation with metaheuristics in distributed scheduling problems with stochastic processing times. - Laura Calvet; Angel A. Juan; Victor Fernandez-Viagas; Jose M. Framiñan (WSC, 2016)

Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness. - Victor Fernandez-Viagas; Manuel Dios; Jose M. Framiñan (Comput. Oper. Res., 2016)

A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime. - Victor Fernandez-Viagas; Rainer Leisten; Jose M. Framiñan (Expert Syst. Appl., 2016)

The value of real-time data in stochastic flowshop scheduling: A simulation study for makespan. - Jose M. Framiñan; Paz Perez-Gonzalez; Victor Fernandez-Viagas Escudero (WSC, 2017)

Reduction of permutation flowshop problems to single machine problems using machine dominance relations. - Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Oper. Res., 2017)

A beam-search-based constructive heuristic for the PFSP to minimise total flowtime. - Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Oper. Res., 2017)

A new vision of approximate methods for the permutation flowshop to minimise makespan: State-of-the-art and computational evaluation. - Victor Fernandez-Viagas; Rubén Ruiz; Jose M. Framiñan (Eur. J. Oper. Res., 2017)

Efficient heuristics for the hybrid flow shop scheduling problem with missing operations. - Manuel Dios; Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Ind. Eng., 2018)

The distributed permutation flow shop to minimise the total flowtime. - Victor Fernandez-Viagas; Paz Perez-Gonzalez; Jose M. Framiñan (Comput. Ind. Eng., 2018)

Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness. - Victor Fernandez-Viagas; Jorge M. S. Valente; Jose M. Framiñan (Expert Syst. Appl., 2018)

New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics. - Victor Fernandez-Viagas; Jose M. Molina-Pariente; Jose M. Framiñan (Expert Syst. Appl., 2018)

A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem. - Sara Hatami; Laura Calvet; Victor Fernandez-Viagas; Jose M. Framiñan; Angel A. Juan (Simul. Model. Pract. Theory, 2018)

Using real-time information to reschedule jobs in a flowshop with variable processing times. - Jose M. Framiñan; Victor Fernandez-Viagas; Paz Perez-Gonzalez (Comput. Ind. Eng., 2019)

Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times. - Paz Perez-Gonzalez; Victor Fernandez-Viagas; Miguel Zamora García; Jose M. Framiñan (Comput. Ind. Eng., 2019)

Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. - Victor Fernandez-Viagas; Paz Perez-Gonzalez; Jose M. Framiñan (Comput. Oper. Res., 2019)

A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective. - Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Oper. Res., 2019)

Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. - Jose M. Framiñan; Paz Perez-Gonzalez; Victor Fernandez-Viagas (Eur. J. Oper. Res., 2019)

Solving the hybrid flow shop scheduling problem with limited human resource constraint. - Antonio Costa 001; Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Ind. Eng., 2020)

Design of a testbed for hybrid flow shop scheduling with identical machines. - Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Ind. Eng., 2020)

Permutation flowshop scheduling with periodic maintenance and makespan objective. - Paz Perez-Gonzalez; Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Ind. Eng., 2020)

New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem. - Carla Talens; Victor Fernandez-Viagas; Paz Perez-Gonzalez; Jose M. Framiñan (Comput. Ind. Eng., 2020)

Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling. - Victor Fernandez-Viagas; Jose M. Molina-Pariente; Jose M. Framiñan (Eur. J. Oper. Res., 2020)

Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics. - Victor Fernandez-Viagas; Antonio Costa 001; Jose M. Framiñan (Expert Syst. Appl., 2020)

New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation. - Carla Talens; Paz Perez-Gonzalez; Victor Fernandez-Viagas; Jose M. Framiñan (Comput. Ind. Eng., 2021)

Two novel population based algorithms for the single machine scheduling problem with sequence dependent setup times and release times. - Victor Fernandez-Viagas; Antonio Costa 001 (Swarm Evol. Comput., 2021)

A critical-path based iterated local search for the green permutation flowshop problem. - Victor Fernandez-Viagas; Bruno de Athayde Prata; Jose M. Framiñan (Comput. Ind. Eng., 2022)

Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. - Bruno de Athayde Prata; Victor Fernandez-Viagas; Jose M. Framiñan; Carlos Diego Rodrigues (Comput. Oper. Res., 2022)

Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation. - Victor Fernandez-Viagas; Carla Talens; Jose M. Framiñan (Eur. J. Oper. Res., 2022)

A modified harmony search for the T-single machine scheduling problem with variable and flexible maintenance. - Antonio Costa 001; Victor Fernandez-Viagas (Expert Syst. Appl., 2022)

A speed-up procedure for the hybrid flow shop scheduling problem. - Victor Fernandez-Viagas (Expert Syst. Appl., 2022)

Constructive and composite heuristics for the 2-stage assembly scheduling problem with periodic maintenance and makespan objective. - Carla Talens; Victor Fernandez-Viagas; Paz Perez-Gonzalez; Antonio Costa 001 (Expert Syst. Appl., 2022)

Exploring the benefits of scheduling with advanced and real-time information integration in Industry 4.0: A computational study. - Victor Fernandez-Viagas; Jose M. Framiñan (J. Ind. Inf. Integr., 2022)

An overview on the use of operations research in additive manufacturing. - Jose M. Framiñan; Paz Perez-Gonzalez; Victor Fernandez-Viagas (Ann. Oper. Res., 2023)

New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation. - Carla Talens; Jorge M. S. Valente; Victor Fernandez-Viagas (Comput. Oper. Res., 2024)

Assessing the level of centralisation in scheduling decisions: The role of hybrid approaches. - Jose M. Framiñan; Paz Perez-Gonzalez; Victor Fernandez-Viagas (J. Ind. Inf. Integr., 2024)

A new composite heuristic to minimize the total tardiness for the single machine scheduling problem with variable and flexible maintenance. - Antonio Costa 001; Roberto Rosario Corsini; Daniele Pagano; Victor Fernandez-Viagas (Comput. Oper. Res., 2025)

A systematic review of permutation flow shop scheduling with due-date-related objectives. - Bruno de Athayde Prata; Levi Ribeiro de Abreu; Victor Fernandez-Viagas (Comput. Oper. Res., 2025)

Transportation and delivery in flow-shop scheduling problems: A systematic review. - Victor Fernandez-Viagas (Eur. J. Oper. Res., 2025)

A speed-up procedure and new heuristics for the classical job shop scheduling problem: A computational evaluation. - Victor Fernandez-Viagas; Carla Talens; Bruno de Athayde Prata (Eur. J. Oper. Res., 2025)