Nuevos algoritmos para el problema de secuenciación en máquinas paralelas no relacionadas y generalizaciones

Para iniciar esta Tesis Doctoral se buscó un problema de producción sencillo pero de amplia aplicación práctica que permitiera adaptarlo para llegar a problemas más generales y de más amplia aplicación. Por este motivo, nos centramos en las máquinas paralelas, y dentro de ellas, en las no relacionadas dado que son una generalización de los casos de máquinas idénticas y de las uniformemente relacionadas. Escogimos el objetivo de minimizar el tiempo máximo de finalización o Cm ax, uno de los más comunes de la literatura. Este problema tiene la facultad de que, a pesar de su carácter teórico, tiene una amplia aplicación práctica, como el caso de secuenciar las tareas de los hornos de cocción cerámicos. Por otra parte se quería ampliar el problema para el caso en que no se usaran todas las máquinas o no se hicieran todos los trabajos necesariamente. Las metas perseguidas son el presentar unos algoritmos sencillos y potentes para la resolución del problema R//Cm ax, capaces de constituirse en el estado del arte. Dado que los modernos ordenadores montan casi en su totalidad varios núcleos en su CPU y los algoritmos se van adaptando a este hecho, también se ha buscado realizar una adaptación de los algoritmos para su uso en paralelo. Finalmente, se pone como meta el encontrar métodos eficaces y sencillos para la resolución de problemas de este tipo en donde no se emplearan todas las máquinas o no se realizaran todos los trabajos. En la presente Tesis Doctoral se realizó un amplio estudio de la literatura existente respecto al problema de máquinas paralelas no relacionadas y se extrajo el estado del arte, así como un estudio del posible tipo de instancias a emplear, dado que no existía una grupo de instancias tipo para este problema. Se presentan cuatro algoritmos iniciales sencillos que mejoran los resultados del estado del arte en algunos casos y dan mejores resultados de media en el conjunto total de instancias tratadas.Fanjul Peyró, L. (2011). Nuevos algoritmos para el problema de secuenciación en máquinas paralelas no relacionadas y generalizaciones [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/9312Palanci

Size-reduction heuristics for the unrelated parallel machines scheduling problem

[EN] In this paper we study the unrelated parallel machines problem where n independent jobs must be assigned to one out of m parallel machines and the processing time of each job differs from machine to machine. We deal with the objective of the minimisation of the maximum completion time of the jobs, usually referred to as makespan or Cmax. This is a type of assignment problem that has been frequently studied in the scienti¿c literature due to its many potential applications. We propose a set of metaheuristics based on a size-reduction of the original assignment problem that produce solutions of very good quality in a short amount of time. The underlying idea is to consider only a few of the best possible machine assignments for the jobs and not all of them. The results are simple, yet powerful methods. We test the proposed algorithms with a large benchmark of instances and compare them with current state-of-the-art methods. In most cases, the proposed size-reduction algorithms produce results that are statistically proven to be better by a signi¿cant margin. & 2010 Elsevier Ltd. All rights reservedThis work is partially funded by the Spanish Ministry of Science and Innovation, under the project ‘‘SMPA—Advanced Parallel Multiobjective Sequencing: Practical and Theoretical Advances’’ with references number DPI2008-03511/DPI. The authors should also thank the IMPIVA—Institute for the Small and Medium Valencian Enterprise, for the project OSC with reference IMIDIC/2008/137 and the Polytechnic University of Valencia, for the project PPAR with reference 3147.Fanjul Peyró, L.; Ruiz García, R. (2011). Size-reduction heuristics for the unrelated parallel machines scheduling problem. Computers and Operations Research. 38(1):301-309. https://doi.org/10.1016/j.cor.2010.05.005S30130938

Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources

[EN] In this paper we analyze a parallel machine scheduling problem in which the processing of jobs on the machines requires a number of units of a scarce resource. This number depends both on the job and on the machine. The availability of resources is limited and fixed throughout the production horizon. The ob- jective considered is the minimization of the makespan. We model this problem by means of two integer linear programming problems. One of them is based on a model previously proposed in the literature. The other one, which is based on the resemblance to strip packing problems, is an original contribution of this paper. As the models presented are incapable of solving medium-sized instances to optimality, we propose three matheuristic strategies for each of these two models. The algorithms proposed are tested over an extensive computational experience. Results show that the matheuristic strategies significantly outperform the mathematical models.The authors are supported by the Spanish Ministry of Economy and Competitiveness, under project "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R), partially financed with FEDER funds. Thanks are due to our colleagues Eva Vallada and Ful Villa, for their useful suggestions. Special thanks are due to three anonymous referees which have significantly contributed to the improvement of the manuscript. Apart from accompanying on-line materials, interested readers can download more contents from http://soa.iti.es/problem-instances, like the instances used, software for generating instances and all the binaries of the algorithms tested in this paper. We also provide complete solutions, full tables of results and the statistics software files to replicate all results and plots. Additional explanations are also provided in "how-to" text files.Perea Rojas Marcos, F.; Fanjul Peyró, L.; Ruiz García, R. (2017). Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources. European Journal of Operational Research. 260(2):482-493. https://doi.org/10.1016/j.ejor.2017.01.002S482493260

Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource

[EN] In this paper, we study the unrelated parallel machine scheduling problem with one scarce additional resource to minimise the maximum completion time of the jobs or makespan. Several heuristics are proposed following two strategies: the first one is based on the consideration of the resource constraint during the whole solution construction process. The second one starts from several assignment rules without considering the resource constraint, and repairs the non feasible assignments in order to obtain a feasible solution. Several computation experiments are carried out over an extensive benchmark. A comparative evaluation against previously proposed mathematical models and matheuristics (combination of mathematical models and heuristics) is carried out. From the results, we can conclude that our methods outperform the existing ones, and the second strategy performs better, especially for large instances. (C) 2017 Elsevier Ltd. All rights reserved.The authors are supported by the Spanish Ministry of Economy and Competitiveness, under the projects "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R) and "OPTEMAC - Optimizacion de Procesos en Terminales Maritimas de Contenedores" (No. DPI2014-53665-P), all of them partially financed with FEDER funds. The authors are also partially supported by the EU Horizon 2020 research and innovation programme under grant agreement no. 731932 "Transforming Transport: Big Data Value in Mobility and Logistics". Interested readers can download contents from http://soa.iti.es, like the instances used and a software for generating further instances. Source codes are available upon justified request from the authors.Villa Juliá, MF.; Vallada Regalado, E.; Fanjul Peyró, L. (2018). Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource. Expert Systems with Applications. 93:28-38. https://doi.org/10.1016/j.eswa.2017.09.054S28389

Métodos de innovación docente aplicados a los estudios de Ciencias de la Comunicación

Se analiza el fenómeno de la implantación del Espacio Europeo de Educación Superior (EEES) a los estudios de Ciencias de la Comunicación, desde el punto de vista del profesorado. En este sentido se analizan experiencias educativas como: cuadernos de visionado para la iniciación de los alumnos en el comentario fílmico; la utilización didáctica de recursos audiovisuales; el uso de películas como herramientas en la educación de estudiantes; el uso de la televisión informativa; y la aplicación de técnicas de aprendizaje colaborativo entre otras propuestas. Asimismo, se estudia el estado de implantación del EEES en España y se describen propuestas de aplicación del mismo a diferentes áreas de los estudios de Ciencias de la Comunicación. También se dedican estudios a la descripción de nuevas estrategias docentes en el marco del EEES y se proponen fórmulas de evaluación de los aprendizajes. Por último se presta atención a la aplicación de las Tecnologías de la Información y la Comunicación a los citados estudios y se definen nuevas herramientas para apoyar a los estudiantes en su labor.MadridBiblioteca de Educación del Ministerio de Educación, Cultura y Deporte; Calle San Agustín 5 -3 Planta; 28014 Madrid; Tel. +34917748000; [email protected]