Jose M. Framiñan
Orcid: 0000-0003-0619-8508Affiliations:
- University of Seville, School of Engineering, Spain
According to our database1,
Jose M. Framiñan
authored at least 93 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Eur. J. Oper. Res., January, 2024
2023
A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization.
Comput. Oper. Res., December, 2023
Analysing the impact of production control policies on the dynamics of a two-product supply chain with capacity constraints.
Int. J. Prod. Res., March, 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
Exploring a two-product unreliable manufacturing system as a capacity constraint for a two-echelon supply chain dynamic problem.
Int. J. Prod. Res., 2022
A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times.
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
Comput. Oper. Res., 2022
A critical-path based iterated local search for the green permutation flowshop problem.
Comput. Ind. Eng., 2022
2021
Proportional order-up-to policies for closed-loop supply chains: the dynamic effects of inventory controllers.
Int. J. Prod. Res., 2021
New hard benchmark for the 2-stage multi-machine assembly scheduling problem: Design and computational evaluation.
Comput. Ind. Eng., 2021
Customer order scheduling problem to minimize makespan with sequence-dependent setup times.
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
Comput. 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
Comput. Ind. Eng., 2019
Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem.
Appl. Soft Comput., 2019
Algorithms, 2019
2018
A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem.
Simul. Model. Pract. Theory, 2018
J. Intell. Manuf., 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
Eur. J. Oper. Res., 2018
Evolving Trends in Supply Chain Management: Complexity, New Technologies, and Innovative Methodological Approaches.
Complex., 2018
Comput. Ind. Eng., 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
The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic.
Comput. Oper. Res., 2017
New approximate algorithms for the customer order scheduling problem with total completion time objective.
Comput. 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
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
Comput. Ind. Eng., 2016
Available-To-Promise systems in the semiconductor industry: A review of contributions and a preliminary experiment.
Proceedings of the Winter Simulation Conference, 2016
Combining simulation with metaheuristics in distributed scheduling problems with stochastic processing times.
Proceedings of the Winter Simulation Conference, 2016
2015
Eur. J. Oper. Res., 2015
Eur. J. Oper. Res., 2015
Eur. J. Oper. Res., 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
Proceedings of the IEEE EUROCON 2015, 2015
2014
A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems.
Eur. J. Oper. Res., 2014
On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem.
Comput. Oper. Res., 2014
Comput. Ind. Eng., 2014
Springer, ISBN: 978-1-4471-6271-1, 2014
2013
Interfaces, 2013
2012
J. Intell. Manuf., 2012
Special issue on pull strategies in manufacturing systems and supply chains: recent advances.
J. Intell. Manuf., 2012
Eur. J. Oper. Res., 2012
Development of a Multi-agent Platform for Supply Chain-wide Order Fulfilment.
Proceedings of the ICAART 2012 - Proceedings of the 4th International Conference on Agents and Artificial Intelligence, Volume 2, 2012
2011
A response surface methodology for parameter setting in a dynamic Conwip production control system.
Int. J. Manuf. Technol. Manag., 2011
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., 2011
2010
A multi-objective comparison of dispatching rules in a drum-buffer-rope production control system.
Int. J. Comput. Integr. Manuf., 2010
Architecture of manufacturing scheduling systems: Literature review and an integrated proposal.
Eur. J. Oper. Res., 2010
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective.
Comput. Oper. Res., 2010
Setting a common due date in a constrained flowshop: A variable neighbourhood search approach.
Comput. Oper. Res., 2010
2009
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics.
Comput. Oper. Res., 2009
2008
A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria.
OR Spectr., 2008
Int. J. Syst. Sci., 2008
J. Heuristics, 2008
Application of Business Process Management to drive the deployment of a speech recognition system in a healthcare organization.
Proceedings of the eHealth Beyond the Horizon, 2008
2007
Comput. Ind. Eng., 2007
2006
An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach.
Comput. Oper. Res., 2006
2005
A review and classification of heuristics for permutation flow-stop scheduling with makespan objective.
J. Oper. Res. Soc., 2005
Comput. Oper. Res., 2005
Proceedings of the Collaborative Networks and Their Breeding Environments, 2005
Proceedings of the Encyclopedia of Information Science and Technology (5 Volumes), 2005
2004
A review and classification of heuristics for permutation flow-shop scheduling with makespan objective.
J. Oper. Res. Soc., 2004
2003
2002
Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation.
Eur. J. Oper. Res., 2002