Browsing by Author "Ribas Vila, Immaculada"
Now showing items 21-40 of 66
-
Best solutions of taillard's instances for the flow shopwith blockin to minimize flow time
(2013-11-08)
Research report
Open Accesswe summarize the new best solutions, most of them found during in our research, for the Taillard instances. -
Boost I&E concept for urban mobility education
(Universitat Politècnica de Catalunya, 2022-09)
Conference report
Open AccessModern higher education needs to provide skills needed in working life, such as entrepreneurship, besides the more traditional technological competence. The Boost I&E Project2 was developed in 2020 and 2021 with the aim ... -
Comparing three-step heuristics for the permutation flow shop problem
(2010-03-03)
Article
Restricted access - publisher's policyIn this paper a three steps heuristic for the permutation flow shop problem is proposed. The objective is to minimize the maximum time for completing the jobs, or the makespan. The first two steps are inspired by the NEH ... -
Decisiones en el diseño de redes de logística inversa: propuesta de un modelo de decisión
(2013)
Conference report
Open AccessSe considera el problema del diseño de las redes de suministro inversa para la recuperación de productos usados, con el objetivo de establecer un modelo que permita configurar la red en función las características del ... -
Due dates for the Taillard’s Benchmark adapted to the parallel flow shop scheduling problem and best solutions
(2018-10-25)
Research report
Open Access -
Efficient constructive procedures for the distributed blocking flowshop scheduling problem
(2015)
Conference report
Open Accessthe distributed blocking flow shop scheduling problem (DBFSP) allows modeling of the scheduling process in companies with more than one factory, with productive systems configured as flow shop lines where the blocking ... -
Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization
(2015-05-01)
Article
Open AccessThis paper proposes two constructive heuristics, i.e. HPF1 and HPF2, for the blocking flow shop problem in order to minimize the total flow time. They differ mainly in the criterion used to select the first job in the ... -
Efficient heuristics for the parallel blocking flow shop scheduling problem
(2017-05-15)
Article
Open AccessWe consider the NP-hard problem of scheduling n jobs in F identical parallel flow shops, each consisting of a series of m machines, and doing so with a blocking constraint. The applied criterion is to minimize the makespan, ... -
El curioso comportamiento del procedimiento de inserción de la heurística NEH en el problema Fm|block|Cmax
(2013)
Conference report
Open AccessIn this paper it is shown that, in some cases, the insertion pro-cedure of NEH does not improve the solution quality. This fact is observed spe-cially in the NEH-based heuristics that have been proposed in the literature ... -
Estado del arte de la planificación colaborativa en la cadena de suministro: contexto determinista e incierto
(Intangible Capital, 2007-07)
Article
Open AccessLa globalización actual obliga a las empresas y la tecnología actual les permite tener centros de almacenaje y distribución, propios o subcontratados, que pueden estar dispersos geográficamente. La sincronización de los ... -
Estado del arte de la Planificación Colaborativa en la Cadena de Suministro: contexto determinista e incierto
(2006-03-01)
Research report
Open AccessEn la economía actual, el resultado de las empresas depende en gran medida del éxito con el que se gestione la colaboración en su Cadena de Suministro (CdS). La globalización actual ha permitido a las empresas tener ... -
Explotación de la reversibilidad del problema Fm|prmu|Cmax para mejorar las soluciones de las heurísticas
(2009-09-02)
Conference report
Open Access -
Heuristics for the distributed blocking Ffow shop scheduling problem
(2016)
Conference report
Open Access -
Hybrid metaheuristics for the tardines blocking flow shop problem
(2012-09-04)
Research report
Open AccessThis paper proposes an Iterated Local Search (ILS) procedure and an Iterated Greedy (IG) algorithm, which are both combined with a variable neighbourhood search (VNS), for dealing with the flow shop problem with blocking, ... -
Improvement tools for NEH based heuristics on permutation and blocking flow shop scheduling problems
(Springer, 2010-12-01)
Part of book or chapter of book
Restricted access - publisher's policyIn this paper, two tools to improve the performance of the NEH-based heuristics for the flow shop problem with and without buffer constraints are proposed. The first tool is the use of the reversibility property of the ... -
Improvement tools for NEH based heuristics on permutation and blocking flow-shop scheduling problems
(2009-09-19)
Conference report
Restricted access - confidentiality agreementIn this paper, two tools to improve the performance of the NEHbased heuristics for the flow shop problem with and without buffer constraints are proposed. The first tool is the use of the reversibility property of ... -
Is WD0433+270 an iron-core white dwarf?
(PoS - Proceedings of Science, 2007)
Conference report
Open AccessWe study a common proper motion pair formed by a white dwarf (WD0433+270) and a mainsequence star (BD+26 730) that apparently has been classified as a member of the Hyades open cluster. Previous studies of the white dwarf ... -
Johnson revisited, ten years later
(2009-09-02)
Conference report
Open Access -
Main design factors for shared ride-hailing services from a user perspective
(2019-08-14)
Article
Open AccessShared ride-hailing transportation is discreetly emerging in cities all over the world with the purpose of decongesting cities, offering a similar comfort and convenience of the private car, and this way, filling the gap ... -
Mapping of service deployment use cases and user requirements for an on-demand shared ride-hailing service: MOIA test service case study
(Elsevier Ltd, 2019-01-01)
Article
Open AccessDemand Responsive Transportation (DRT) is currently growing in our cities as shared ride-hailing services operated by private companies, providing a hybrid service between the bus and the taxi. Like DRT, these new on-demand ...
