default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor Fernandez-Viagas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j40]Antonio Costa, Roberto Rosario Corsini, Daniele Pagano, Victor Fernandez-Viagas:
A new composite heuristic to minimize the total tardiness for the single machine scheduling problem with variable and flexible maintenance. Comput. Oper. Res. 173: 106849 (2025)- 2024
- [j39]Carla Talens
, Jorge M. S. Valente, Victor Fernandez-Viagas:
New heuristics for the 2-stage assembly scheduling problem with total earliness and tardiness minimisation: A computational evaluation. Comput. Oper. Res. 172: 106824 (2024) - [j38]Jose M. Framiñan, Paz Perez-Gonzalez, Victor Fernandez-Viagas:
Assessing the level of centralisation in scheduling decisions: The role of hybrid approaches. J. Ind. Inf. Integr. 41: 100682 (2024) - 2023
- [j37]Jose M. Framiñan, Paz Perez-Gonzalez, Victor Fernandez-Viagas:
An overview on the use of operations research in additive manufacturing. Ann. Oper. Res. 322(1): 5-40 (2023) - 2022
- [j36]Victor Fernandez-Viagas, Bruno de Athayde Prata, Jose M. Framiñan:
A critical-path based iterated local search for the green permutation flowshop problem. Comput. Ind. Eng. 169: 108276 (2022) - [j35]Bruno de Athayde Prata, Victor Fernandez-Viagas, Jose M. Framiñan, Carlos Diego Rodrigues:
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. Comput. Oper. Res. 145: 105880 (2022) - [j34]Victor Fernandez-Viagas, Carla Talens, Jose M. Framiñan:
Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation. Eur. J. Oper. Res. 299(3): 869-882 (2022) - [j33]Victor Fernandez-Viagas:
A speed-up procedure for the hybrid flow shop scheduling problem. Expert Syst. Appl. 187: 115903 (2022) - [j32]Antonio Costa, Victor Fernandez-Viagas:
A modified harmony search for the T-single machine scheduling problem with variable and flexible maintenance. Expert Syst. Appl. 198: 116897 (2022) - [j31]Carla Talens, Victor Fernandez-Viagas, Paz Perez-Gonzalez, Antonio Costa:
Constructive and composite heuristics for the 2-stage assembly scheduling problem with periodic maintenance and makespan objective. Expert Syst. Appl. 206: 117824 (2022) - [j30]Victor Fernandez-Viagas, Jose M. Framiñan:
Exploring the benefits of scheduling with advanced and real-time information integration in Industry 4.0: A computational study. J. Ind. Inf. Integr. 27: 100281 (2022) - 2021
- [j29]Carla Talens, Paz Perez-Gonzalez, Victor Fernandez-Viagas, Jose M. Framiñan:
New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation. Comput. Ind. Eng. 158: 107364 (2021) - [j28]Victor Fernandez-Viagas, Antonio Costa:
Two novel population based algorithms for the single machine scheduling problem with sequence dependent setup times and release times. Swarm Evol. Comput. 63: 100869 (2021) - 2020
- [j27]Carla Talens, Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framiñan:
New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem. Comput. Ind. Eng. 140: 106223 (2020) - [j26]Victor Fernandez-Viagas, Jose M. Framiñan:
Design of a testbed for hybrid flow shop scheduling with identical machines. Comput. Ind. Eng. 141: 106288 (2020) - [j25]Paz Perez-Gonzalez, Victor Fernandez-Viagas, Jose M. Framiñan:
Permutation flowshop scheduling with periodic maintenance and makespan objective. Comput. Ind. Eng. 143: 106369 (2020) - [j24]Antonio Costa, Victor Fernandez-Viagas, Jose M. Framiñan:
Solving the hybrid flow shop scheduling problem with limited human resource constraint. Comput. Ind. Eng. 146: 106545 (2020) - [j23]Victor Fernandez-Viagas, Jose M. Molina-Pariente, Jose M. Framiñan:
Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling. Eur. J. Oper. Res. 282(3): 858-872 (2020) - [j22]Victor Fernandez-Viagas, Antonio Costa, Jose M. Framiñan:
Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics. Expert Syst. Appl. 153: 113462 (2020) - 2019
- [j21]Jose M. Framiñan, Victor Fernandez-Viagas, Paz Perez-Gonzalez:
Using real-time information to reschedule jobs in a flowshop with variable processing times. Comput. Ind. Eng. 129: 113-125 (2019) - [j20]Paz Perez-Gonzalez, Victor Fernandez-Viagas, Miguel Zamora García, Jose M. Framiñan:
Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times. Comput. Ind. Eng. 131: 131-145 (2019) - [j19]Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framiñan:
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. Comput. Oper. Res. 109: 77-88 (2019) - [j18]Victor Fernandez-Viagas, Jose M. Framiñan:
A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective. Comput. Oper. Res. 112 (2019) - [j17]Jose M. Framiñan, Paz Perez-Gonzalez, Victor Fernandez-Viagas:
Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures. Eur. J. Oper. Res. 273(2): 401-417 (2019) - 2018
- [j16]Manuel Dios, Victor Fernandez-Viagas, Jose M. Framiñan:
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations. Comput. Ind. Eng. 115: 88-99 (2018) - [j15]Victor Fernandez-Viagas, Paz Perez-Gonzalez, Jose M. Framiñan:
The distributed permutation flow shop to minimise the total flowtime. Comput. Ind. Eng. 118: 464-477 (2018) - [j14]Victor Fernandez-Viagas, Jorge M. S. Valente, Jose M. Framiñan:
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness. Expert Syst. Appl. 94: 58-69 (2018) - [j13]Victor Fernandez-Viagas, Jose M. Molina-Pariente, Jose M. Framiñan:
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics. Expert Syst. Appl. 114: 345-356 (2018) - [j12]Sara Hatami, Laura Calvet, Victor Fernandez-Viagas, Jose M. Framiñan, Angel A. Juan:
A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem. Simul. Model. Pract. Theory 86: 55-71 (2018) - 2017
- [j11]Victor Fernandez-Viagas, Jose M. Framiñan:
Reduction of permutation flowshop problems to single machine problems using machine dominance relations. Comput. Oper. Res. 77: 96-110 (2017) - [j10]Victor Fernandez-Viagas, Jose M. Framiñan:
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime. Comput. Oper. Res. 81: 167-177 (2017) - [j9]Victor Fernandez-Viagas, Rubén Ruiz, Jose M. Framiñan:
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) - 2016
- [j8]Victor Fernandez-Viagas, Manuel Dios, Jose M. Framiñan:
Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness. Comput. Oper. Res. 75: 38-48 (2016) - [j7]Victor Fernandez-Viagas, Rainer Leisten, Jose M. Framiñan:
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime. Expert Syst. Appl. 61: 290-301 (2016) - 2015
- [j6]Jose M. Molina-Pariente, Victor Fernandez-Viagas, Jose M. Framiñan:
Integrated operating room planning and scheduling problem with assistant surgeon dependent surgery durations. Comput. Ind. Eng. 82: 8-20 (2015) - [j5]Manuel Dios, Jose M. Molina-Pariente, Victor Fernandez-Viagas, José Luis Andrade-Pineda, Jose M. Framiñan:
A Decision Support System for Operating Room scheduling. Comput. Ind. Eng. 88: 430-443 (2015) - [j4]Victor Fernandez-Viagas, Jose M. Framiñan:
A new set of high-performing heuristics to minimise flowtime in permutation flowshops. Comput. Oper. Res. 53: 68-80 (2015) - [j3]Victor Fernandez-Viagas, Jose M. Framiñan:
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput. Oper. Res. 60: 27-36 (2015) - [j2]Victor Fernandez-Viagas, Jose M. Framiñan:
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness. Comput. Oper. Res. 64: 86-96 (2015) - 2014
- [j1]Victor Fernandez-Viagas, Jose M. Framiñan:
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Comput. Oper. Res. 45: 60-67 (2014)
Conference and Workshop Papers
- 2017
- [c2]Jose M. Framiñan, Paz Perez-Gonzalez, Victor Fernandez-Viagas Escudero:
The value of real-time data in stochastic flowshop scheduling: A simulation study for makespan. WSC 2017: 3299-3310 - 2016
- [c1]Laura Calvet, Angel A. Juan, Victor Fernandez-Viagas, Jose M. Framiñan:
Combining simulation with metaheuristics in distributed scheduling problems with stochastic processing times. WSC 2016: 2347-2357
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 21:46 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:
