default search action
Jose M. Framiñan
José Manuel Framiñán Torres
Person information
- affiliation: University of Seville, School of Engineering, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j88]Rebecca Fussone
, Salvatore Cannella
Exploring symbiotic supply chains dynamics. Comput. Ind. Eng. 187: 109833 (2024) - [j87]Roberto Rosario Corsini, Antonio Costa
Digital twin model with machine learning and optimization for resilient production-distribution systems under disruptions. Comput. Ind. Eng. 191: 110145 (2024) - [j86]Jose M. Framiñan
Matching inventory and demand in a Fast Moving Consumer Goods company: A Decision Support System. Comput. Ind. Eng. 194: 110377 (2024) - [j85]Pengqi Du, Jose M. Framiñan
Understanding after-market service channel selection for complex product-services supply chains: A game-theoretical approach. Comput. Ind. Eng. 197: 110630 (2024) - [j84]Paz Perez-Gonzalez
A review and classification on distributed permutation flowshop scheduling problems. Eur. J. Oper. Res. 312(1): 1-21 (2024) - [j83]Qiu-Ying Li, Quan-Ke Pan
Self-Adaptive Population-Based Iterated Greedy Algorithm for Distributed Permutation Flowshop Scheduling Problem with Part of Jobs Subject to a Common Deadline Constraint. Expert Syst. Appl. 248: 123278 (2024) - [j82]Jose M. Framiñan
Assessing the level of centralisation in scheduling decisions: The role of hybrid approaches. J. Ind. Inf. Integr. 41: 100682 (2024) - 2023
- [j81]Jose M. Framiñan
An overview on the use of operations research in additive manufacturing. Ann. Oper. Res. 322(1): 5-40 (2023) - [j80]Levi Ribeiro de Abreu
A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization. Comput. Oper. Res. 160: 106386 (2023) - [j79]Roberto Rosario Corsini
Analysing the impact of production control policies on the dynamics of a two-product supply chain with capacity constraints. Int. J. Prod. Res. 61(6): 1913-1937 (2023) - 2022
- [j78]Victor Fernandez-Viagas, Bruno de Athayde Prata
A critical-path based iterated local search for the green permutation flowshop problem. Comput. Ind. Eng. 169: 108276 (2022) - [j77]Levi Ribeiro de Abreu
New efficient heuristics for scheduling open shops with makespan minimization. Comput. Oper. Res. 142: 105744 (2022) - [j76]Bruno de Athayde Prata
Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness. Comput. Oper. Res. 145: 105880 (2022) - [j75]Victor Fernandez-Viagas
Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation. Eur. J. Oper. Res. 299(3): 869-882 (2022) - [j74]Bruno de Athayde Prata
A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times. Expert Syst. Appl. 189: 116097 (2022) - [j73]Antonio Costa
Exploring a two-product unreliable manufacturing system as a capacity constraint for a two-echelon supply chain dynamic problem. Int. J. Prod. Res. 60(3): 1105-1133 (2022) - [j72]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
- [j71]Bruno de Athayde Prata
Customer order scheduling problem to minimize makespan with sequence-dependent setup times. Comput. Ind. Eng. 151: 106962 (2021) - [j70]Carla Talens
New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation. Comput. Ind. Eng. 158: 107364 (2021) - [j69]Salvatore Cannella
Proportional order-up-to policies for closed-loop supply chains: the dynamic effects of inventory controllers. Int. J. Prod. Res. 59(11): 3323-3337 (2021) - 2020
- [j68]Carla Talens
New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem. Comput. Ind. Eng. 140: 106223 (2020) - [j67]Victor Fernandez-Viagas
Design of a testbed for hybrid flow shop scheduling with identical machines. Comput. Ind. Eng. 141: 106288 (2020) - [j66]Paz Perez-Gonzalez
Permutation flowshop scheduling with periodic maintenance and makespan objective. Comput. Ind. Eng. 143: 106369 (2020) - [j65]Antonio Costa
Solving the hybrid flow shop scheduling problem with limited human resource constraint. Comput. Ind. Eng. 146: 106545 (2020) - [j64]Levi Ribeiro de Abreu
A genetic algorithm for scheduling open shops with sequence-dependent setup times. Comput. Oper. Res. 113 (2020) - [j63]Victor Fernandez-Viagas
Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling. Eur. J. Oper. Res. 282(3): 858-872 (2020) - [j62]Victor Fernandez-Viagas
Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics. Expert Syst. Appl. 153: 113462 (2020)
2010 – 2019
- 2019
- [j61]Jose M. Framiñan
Linking Scheduling Criteria to Shop Floor Performance in Permutation Flowshops. Algorithms 12(12): 263 (2019) - [j60]Quan-Ke Pan
Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem. Appl. Soft Comput. 81 (2019) - [j59]Roberto Domínguez
On the dynamics of closed-loop supply chains with capacity constraints. Comput. Ind. Eng. 128: 91-103 (2019) - [j58]Jose M. Framiñan, Victor Fernandez-Viagas
Using real-time information to reschedule jobs in a flowshop with variable processing times. Comput. Ind. Eng. 129: 113-125 (2019) - [j57]Paz Perez-Gonzalez
Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times. Comput. Ind. Eng. 131: 131-145 (2019) - [j56]Victor Fernandez-Viagas
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective. Comput. Oper. Res. 109: 77-88 (2019) - [j55]Victor Fernandez-Viagas
A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective. Comput. Oper. Res. 112 (2019) - [j54]Jose M. Framiñan
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
- [j53]Manuel Dios, Victor Fernandez-Viagas
Efficient heuristics for the hybrid flow shop scheduling problem with missing operations. Comput. Ind. Eng. 115: 88-99 (2018) - [j52]Victor Fernandez-Viagas
The distributed permutation flow shop to minimise the total flowtime. Comput. Ind. Eng. 118: 464-477 (2018) - [j51]Paz Perez-Gonzalez
Single machine scheduling with periodic machine availability. Comput. Ind. Eng. 123: 180-188 (2018) - [j50]Salvatore Cannella
Demand Sharing Inaccuracies in Supply Chains: A Simulation Study. Complex. 2018: 1092716:1-1092716:13 (2018) - [j49]Salvatore Cannella
Evolving Trends in Supply Chain Management: Complexity, New Technologies, and Innovative Methodological Approaches. Complex. 2018: 7916849:1-7916849:3 (2018) - [j48]Jose M. Framiñan
Order scheduling with tardiness objective: Improved approximate solutions. Eur. J. Oper. Res. 266(3): 840-850 (2018) - [j47]Victor Fernandez-Viagas
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness. Expert Syst. Appl. 94: 58-69 (2018) - [j46]Victor Fernandez-Viagas
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics. Expert Syst. Appl. 114: 345-356 (2018) - [j45]Paz Perez-Gonzalez
Single machine interfering jobs problem with flowtime objective. J. Intell. Manuf. 29(5): 953-972 (2018) - [j44]Sara Hatami
A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem. Simul. Model. Pract. Theory 86: 55-71 (2018) - 2017
- [j43]Victor Fernandez-Viagas
Reduction of permutation flowshop problems to single machine problems using machine dominance relations. Comput. Oper. Res. 77: 96-110 (2017) - [j42]Jose M. Framiñan
New approximate algorithms for the customer order scheduling problem with total completion time objective. Comput. Oper. Res. 78: 181-192 (2017) - [j41]Victor Fernandez-Viagas
A beam-search-based constructive heuristic for the PFSP to minimise total flowtime. Comput. Oper. Res. 81: 167-177 (2017) - [j40]Jose M. Framiñan
The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic. Comput. Oper. Res. 88: 237-246 (2017) - [j39]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) - [c8]Jose M. Framiñan
The value of real-time data in stochastic flowshop scheduling: A simulation study for makespan. WSC 2017: 3299-3310 - [c7]Jose Francisco Dorado, Paz Perez-Gonzalez
Simulation results of optimal solution for a multiechelon inventory system. WSC 2017: 4548-4549 - 2016
- [j38]Manuel Dios, Jose M. Framiñan
A review and classification of computer-based manufacturing scheduling tools. Comput. Ind. Eng. 99: 229-249 (2016) - [j37]Victor Fernandez-Viagas
Efficient constructive and composite heuristics for the Permutation Flowshop to minimise total earliness and tardiness. Comput. Oper. Res. 75: 38-48 (2016) - [j36]Victor Fernandez-Viagas
A computational evaluation of constructive and improvement heuristics for the blocking flow shop to minimise total flowtime. Expert Syst. Appl. 61: 290-301 (2016) - [c6]Laura Calvet
Combining simulation with metaheuristics in distributed scheduling problems with stochastic processing times. WSC 2016: 2347-2357 - [c5]Jose M. Framiñan
Available-To-Promise systems in the semiconductor industry: A review of contributions and a preliminary experiment. WSC 2016: 2652-2663 - 2015
- [j35]Jose M. Molina-Pariente
Integrated operating room planning and scheduling problem with assistant surgeon dependent surgery durations. Comput. Ind. Eng. 82: 8-20 (2015) - [j34]Manuel Dios, Jose M. Molina-Pariente
A Decision Support System for Operating Room scheduling. Comput. Ind. Eng. 88: 430-443 (2015) - [j33]Jose M. Molina-Pariente
New heuristics for planning operating rooms. Comput. Ind. Eng. 90: 429-443 (2015) - [j32]Victor Fernandez-Viagas
A new set of high-performing heuristics to minimise flowtime in permutation flowshops. Comput. Oper. Res. 53: 68-80 (2015) - [j31]Victor Fernandez-Viagas
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness. Comput. Oper. Res. 60: 27-36 (2015) - [j30]Victor Fernandez-Viagas
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) - [j29]Eva Vallada
New hard benchmark for flowshop scheduling problems minimising makespan. Eur. J. Oper. Res. 240(3): 666-677 (2015) - [j28]Salvatore Cannella
The effect of Inventory Record Inaccuracy in Information Exchange Supply Chains. Eur. J. Oper. Res. 243(1): 120-129 (2015) - [j27]Jose M. Framiñan
On heuristic solutions for the stochastic flowshop scheduling problem. Eur. J. Oper. Res. 246(2): 413-420 (2015) - [c4]Roberto Domínguez
SCOPE: A Multi-Agent system tool for supply chain network analysis. EUROCON 2015: 1-5 - 2014
- [b1]Jose M. Framiñan
Manufacturing Scheduling Systems - An Integrated View on Models, Methods and Tools. Springer 2014, ISBN 978-1-4471-6271-1, pp. I-XVIII, 1-400 - [j26]Roberto Domínguez
On bullwhip-limiting strategies in divergent supply chain networks. Comput. Ind. Eng. 73: 85-95 (2014) - [j25]Victor Fernandez-Viagas
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem. Comput. Oper. Res. 45: 60-67 (2014) - [j24]Paz Perez-Gonzalez
A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems. Eur. J. Oper. Res. 235(1): 1-16 (2014) - [j23]Salvatore Cannella
An IT-enabled supply chain model: a simulation study. Int. J. Syst. Sci. 45(11): 2327-2341 (2014) - 2013
- [j22]José Luis Andrade-Pineda
A Decision-Making Tool for a Regional Network of Clinical Laboratories. Interfaces 43(4): 360-372 (2013) - [j21]Salvatore Cannella
Metrics for bullwhip effect analysis. J. Oper. Res. Soc. 64(1): 1-16 (2013) - 2012
- [j20]Elena Ciancimino, Salvatore Cannella
On the Bullwhip Avoidance Phase: The Synchronised Supply Chain. Eur. J. Oper. Res. 221(1): 49-63 (2012) - [j19]Jose M. Framiñan
Special issue on pull strategies in manufacturing systems and supply chains: recent advances. J. Intell. Manuf. 23(1): 1-3 (2012) - [j18]Pedro L. Gonzalez-R
Token-based pull production control systems: an introductory overview. J. Intell. Manuf. 23(1): 5-22 (2012) - [c3]Roberto Domínguez, Jose M. Framiñan:
Development of a Multi-agent Platform for Supply Chain-wide Order Fulfilment. ICAART (2) 2012: 203-208 - 2011
- [j17]Salvatore Cannella, Elena Ciancimino, Jose M. Framiñan:
On Replenishment Rules. Forecasting and the Bullwhip Effect in Supply Chains, Stephen M., Disney., Marc R. Lambrecht (Eds.). Foundations and trends® in technology. Information and Operations Management (2008). Boston-Delft, € 70.00, Book Version (ISBN: 978-1-60198-132-5); € 100, E-book Version (ISBN: 978-1-60198-133-2), pp. xii and 83. Eur. J. Oper. Res. 212(3): 609 (2011) - [j16]Pedro L. Gonzalez-R
A response surface methodology for parameter setting in a dynamic Conwip production control system. Int. J. Manuf. Technol. Manag. 23(1/2): 16-33 (2011) - 2010
- [j15]Imma Ribas
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective. Comput. Oper. Res. 37(8): 1439-1454 (2010) - [j14]Paz Perez-Gonzalez
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach. Comput. Oper. Res. 37(10): 1740-1748 (2010) - [j13]Jose M. Framiñan
Architecture of manufacturing scheduling systems: Literature review and an integrated proposal. Eur. J. Oper. Res. 205(2): 237-246 (2010) - [j12]Pedro L. Gonzalez-R
A multi-objective comparison of dispatching rules in a drum-buffer-rope production control system. Int. J. Comput. Integr. Manuf. 23(2): 155-167 (2010)
2000 – 2009
- 2009
- [j11]Paz Perez-Gonzalez
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics. Comput. Oper. Res. 36(10): 2866-2876 (2009) - 2008
- [j10]Jose M. Framiñan
A proposal for a hybrid meta-strategy for combinatorial optimization problems. J. Heuristics 14(4): 375-390 (2008) - [j9]Andreas Reichhart, Jose M. Framiñan
On the link between inventory and responsiveness in multi-product supply chains. Int. J. Syst. Sci. 39(7): 677-688 (2008) - [j8]Jose M. Framiñan
A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria. OR Spectr. 30(4): 787-804 (2008) - [c2]María José González Sánchez, José Manuel Framiñán Torres, Carlos Luis Parra Calderón, Juan Antonio Del Río Ortega, Eduardo Vigil Martín, Jaime Nieto Cervera:
Application of Business Process Management to drive the deployment of a speech recognition system in a healthcare organization. MIE 2008: 511-516 - 2007
- [j7]Jose M. Framiñan
An adaptive branch and bound approach for transforming job shops into flow shops. Comput. Ind. Eng. 52(1): 1-10 (2007) - 2006
- [j6]Jose M. Framiñan
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach. Comput. Oper. Res. 33: 1200-1213 (2006) - 2005
- [j5]Jose M. Framiñan
Comparison of heuristics for flowtime minimisation in permutation flowshops. Comput. Oper. Res. 32: 1237-1254 (2005) - [j4]Jose M. Framiñan
A review and classification of heuristics for permutation flow-stop scheduling with makespan objective. J. Oper. Res. Soc. 56(3): 351 (2005) - [c1]José Manuel Framiñán Torres, Carlos Luis Parra Calderón, Margarita Montes, Paz Perez-Gonzalez:
Collaborative Healthcare Process Modelling: A Case Study. PRO-VE 2005: 395-402 - [r1]Jose M. Framiñan:
Enterprise Resource Planning for Intelligent Enterprises. Encyclopedia of Information Science and Technology (II) 2005: 1089-1094 - 2004
- [j3]Jose M. Framiñan
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective. J. Oper. Res. Soc. 55(12): 1243-1255 (2004) - 2003
- [j2]Christoph J. Schuster, Jose M. Framiñan
Approximative procedures for no-wait job shop scheduling. Oper. Res. Lett. 31(3): 308-318 (2003) - 2002
- [j1]Jose M. Framiñan
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation. Eur. J. Oper. Res. 141(3): 559-569 (2002)
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-11-11 21:28 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: