Arnau, Quim; Barrena, Eva; Panadero, Javier; Torre-Martínez, María Rocío de la; Juan, Angel A.(Elsevier, 2022-10-01)
[EN]
Modern transport systems are not only large-scale but also highly dynamic, which makes it difficult to optimize by just employing classical methods. This paper analyzes a realistic and novel problem within the Physical ...
[EN] In recent years, a large number of heuristics have been proposed for the minimization of the total or mean flowtime/completion time of the well-known permutation flowshop scheduling problem. Although some literature ...
[EN] A wide variety of methods and techniques with multiple characteristics are used in solving replenishment, production and distribution planning problems. Selecting a solution method (either a solver or an algorithm) ...
[EN] Automated Storage and Retrieval Systems (AS/RS) have become vital in today¿s distribution and production
environments, however it remains necessary to equip them with more efficient operational control
policies. ...
[EN] The permutation flowshop problem is a classic machine scheduling problem where n jobs must be processed on a set of m machines disposed in series and where each job must visit all machines in the same order. Many ...
[EN] This paper examines the economic optimization of reinforced concrete road frame bridges by threshold acceptance. The formulation of the problem includes 50 discrete variables: three geometrical ones, three types of ...
Vega, Jorgelina(Universitat Politècnica de València, 2024-11-01)
[ES] Este proyecto explora en el campo de la heurística aplicada al arte, desarrollando estructuras teóricas que pretenden delinear ciertos condicionamientos heurísticos que inciden en la creación artística. Se examina ...
Conejero, J. Alberto; Jordan-Lluch, Cristina; Sanabria-Codesal, Esther(Springer Verlag (Germany), 2016-04)
[EN] The solution of fleet assignment problems is one of the core points in the management of a car-rental company. These problems arise from the restrictions imposed by the acceptance of reservations of the customers and ...
In the no-idle flowshop, machines cannot be idle after finishing one job and before starting the next one.
Therefore, start times of jobs must be delayed to guarantee this constraint. In practice machines show
this ...
Wang, Yamin; Li, Xiaoping; Ruiz García, Rubén; Sui, S.(Institute of Electrical and Electronics Engineers, 2018-05)
[EN] The mixed no-wait flowshop problem with both wait and no-wait constraints has many potential real-life applications. The problem can be regarded as a generalization of the traditional permutation flowshop and the ...
Hernández Vicente, Daniel(Universitat Politècnica de València, 2023-03-27)
[ES] Edge Computing es un modelo de computación emergente basado en acercar el procesamiento a los dispositivos de captura de datos en las infraestructuras Internet of things (IoT). Edge computing mejora, entre otras cosas, ...
Castillo Moreno, Elena(Universitat Politècnica de València, 2021-10-01)
[ES] El aumento del número de páginas webs y la importancia que estas han ido adquiriendo debido
a la pandemia del COVID, ha permitido a los usuarios satisfacer muchas de las necesidades del
día a día. Por este motivo, ...
García Lozano, Carlos(Universitat Politècnica de València, 2021-10-15)
[ES] El Block Relocation Problem es un problema de gran interés en la logística actual. Este problema consiste en minimizar el número de recolocaciones necesarias para extraer un conjunto de bloques apilados en un orden ...
Araujo, Felipe F. B.; Costa, Alysson M.; Miralles Insa, Cristóbal Javier(Inderscience Enterprises Ltd., 2015)
[EN] In this paper, we study an assembly line balancing problem that occurs in sheltered worker centres for the disabled, where workers with very different characteristics are present. We are interested in the situation ...
Tordecilla, Rafael D.; Copado-Méndez, Pedro J.; Panadero, Javier; Quintero-Araujo, Carlos L.; Montoya-Torres, Jairo R.; Juan, Angel A.(MDPI AG, 2021-02)
[EN] The location routing problem integrates both a facility location and a vehicle routing problem. Each of these problems are NP-hard in nature, which justifies the use of heuristic-based algorithms when dealing with ...
Del Río Ortuño, Ramón(Universitat Politècnica de València, 2024-09-04)
[ES] Este Trabajo Fin de Grado (TFG) se centra en el desarrollo e implementación de herramientas heurísticas para la programación del calendario de exámenes de la Escuela Técnica Superior de Ingeniería Industrial (ETSII) ...
Dasí Gil, Manuel(Universitat Politècnica de València, 2014-11-24)
[EN] The pedestrian walkways are a structural element widely used in urban areas for safe crossing
transport infrastructure (roads, highways, railways) by pedestrians. Specifically mixed pedestrian
walkways and are ...
Onaindia de la Rivaherrera, Eva; Garrido Tejero, Antonio(Universitat Politècnica de València, 2012-12-14)
Many planning domains have to deal with temporal features that can be expressed
using durations that are associated to actions. Unfortunately, the conservative model of
actions used in many existing temporal planners is ...
Carrasco Gómez, Pascual Andrés(Universitat Politècnica de València, 2016-09-13)
[ES] En la actualidad existen grandes volúmenes de imágenes que representan textos
manuscritos digitalizados, estas imágenes han sido tomadas con dispositivos
completamente diferentes a causa del avance tecnológico a lo ...
Blanco Castro, Fabián Camilo(Universitat Politècnica de València, 2018-05-02)
[ES] El crecimiento de las webs permite que los usuarios tengan una mayor elección a la hora de decidir
donde navegar por internet. La importancia de disponer de un sitio web con un nivel adecuado de
usabilidad y ...