Ver Financiación - Prisma - Unidad de Bibliometría

Production Management Under Imperfect and Scarce Data

Referencia: DPI2016-80750-P

Tipo: Proyecto de investigación
Programa financiador: Plan Estatal 2013-2016 Excelencia - Proyectos I+D
Entidad financiadora: Ministerio de Economía y Competitividad
Ámbito: Nacional
Convocatoria competitiva:
Fecha de inicio: 30/12/2016
Fecha de fin: 31/12/2020
Participantes en la financiación
Nombre Rol
Framiñán Torres, José Manuel Responsable
Pérez González, Paz Investigador/a
Cannella, Salvatore Investigador/a
Molina Pariente, José Manuel Investigador/a
Leisten, Rainer Investigador/a
Domínguez Cañizares, Roberto Investigador/a
Povoa, Ana Investigador/a
Zamora García, Miguel Investigador/a
Bruccoleri, Manfredi Investigador/a
Fernández-Viagas Escudero, Víctor Investigador/a
Dios Rubio, Manuel Alejandro Investigador/a
Talens Fayos, Carla Contratado
Navarro Carmona, Belén Contratado
Tobajas Machin, Laura Contratado
Navarro García, Belén Contratado
Ramírez Rojas, María de los Ángeles Contratado
Ybarra Gayán, Alberto Contratado
Publicaciones relacionadas
Tipo Año Título Fuente
Artículo 2020 A genetic algorithm for scheduling open shops with sequence-dependent setup times COMPUTERS & OPERATIONS RESEARCH
Artículo 2020 Design of a testbed for hybrid flow shop scheduling with identical machines COMPUTERS & INDUSTRIAL ENGINEERING
Artículo 2020 Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Artículo 2020 Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics EXPERT SYSTEMS WITH APPLICATIONS
Artículo 2020 New efficient constructive heuristics for the two-stage multi-machine assembly scheduling problem COMPUTERS & INDUSTRIAL ENGINEERING
Artículo 2020 Permutation flowshop scheduling with periodic maintenance and makespan objective COMPUTERS & INDUSTRIAL ENGINEERING
Artículo 2020 Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling COMPUTERS & OPERATIONS RESEARCH
Artículo 2020 Solving the hybrid flow shop scheduling problem with limited human resource constraint COMPUTERS & INDUSTRIAL ENGINEERING
Artículo 2019 A best-of-breed iterated greedy for the permutation flowshop scheduling problem with makespan objective COMPUTERS & OPERATIONS RESEARCH
Artículo 2019 Constructive heuristics for the unrelated parallel machines scheduling problem with machine eligibility and setup times COMPUTERS & INDUSTRIAL ENGINEERING
Revisión 2019 Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Artículo 2019 Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective COMPUTERS & OPERATIONS RESEARCH
Artículo 2019 Using real-time information to reschedule jobs in a flowshop with variable processing times COMPUTERS & INDUSTRIAL ENGINEERING
Artículo 2018 A simheuristic algorithm to set up starting times in the stochastic parallel flowshop problem SIMULATION MODELLING PRACTICE AND THEORY
Artículo 2018 Efficient heuristics for the hybrid flow shop scheduling problem with missing operations COMPUTERS & INDUSTRIAL ENGINEERING
Artículo 2018 Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness EXPERT SYSTEMS WITH APPLICATIONS
Artículo 2018 New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics EXPERT SYSTEMS WITH APPLICATIONS
Artículo 2018 Order scheduling with tardiness objective: Improved approximate solutions EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Artículo 2018 Single machine scheduling with periodic machine availability COMPUTERS & INDUSTRIAL ENGINEERING
Artículo 2018 The distributed permutation flow shop to minimise the total flowtime COMPUTERS & INDUSTRIAL ENGINEERING
Artículo 2017 A beam-search-based constructive heuristic for the PFSP to minimise total flowtime COMPUTERS & OPERATIONS RESEARCH
Artículo 2017 The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic COMPUTERS & OPERATIONS RESEARCH
Nota: la fuente de financiación de las publicaciones se ha obtenido de WOS