Recent Submissions

  • Best known solutions for Taillard’s instances adapted to the distributed blocking flow shop scheduling problem 

    Ribas Vila, Immaculada; Companys Pascual, Ramón (2016-04-11)
    External research report
    Open Access
    The distributed blocking flow shop scheduling problem (DBFSP) allows modeling the scheduling process in companies with more than one factory. It configures production systems as flow shop lines where the blocking constraint ...
  • Principales tendencias en el ámbito universitario a nivel internacional en el año 2.015 

    Olivella Nadal, Jordi; Calleja Sanz, Gema (2016-04-22)
    External research report
    Open Access
    Este documento de trabajo trata sobre las grandes tendencias que se advierten en a nivel internacional en relación a las universidades, a partir de las noticias más relevantes aparecidas en el año 2.015. Se consideran los ...
  • Analysis of urban freight distribution measures 

    Sanz, Guillem; Pastor Moreno, Rafael; Benedito Benet, Ernest; Domenech, Bruno (2015-10-29)
    External research report
    Open Access
    Urban Freight Distribution (UFD) represents a very important activity in terms of cities economy, but can also be a problem for the daily life of citizens, due to traffic, noise and environmental contamination. ...
  • A novel algorithm for isolated electrification projects 

    Ranaboldo, Matteo; García Villoria, Alberto; Ferrer Martí, Laia; Pastor Moreno, Rafael (2015-05-04)
    External research report
    Open Access
    In this report it is proposed a metaheuristic procedure to support the design of stand - alone commun ity electrification projects. In particular, the solution returned by the procedure ...
  • Best solutions of taillard's instances for the flow shopwith blockin to minimize flow time 

    Companys Pascual, Ramón; Ribas Vila, Immaculada (2013-11-08)
    External research report
    Open Access
    we summarize the new best solutions, most of them found during in our research, for the Taillard instances.
  • Best solutions of Ronconi, Imma-B and ImmA-C instances for the Fm|block| 

    Companys Pascual, Ramón; Ribas Vila, Immaculada (2012-09-04)
    External research report
    Open Access
    A continuación se presentan las mejores soluciones obtenidas para los ejemplares de Ronconi, Imma-B y Imma-C instances utilizados en el problema Fm|block|ΣT. Los valores han sido obtenidos con la hyperheuristica CERCOP0T.
  • An efficient hybrid iterated local search algorithm for the total tardiness blocking flow shop problem 

    Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (2012-09-04)
    External research report
    Open Access
    This paper deals with the blocking flow shop problem and proposes an Iterated Local Search (ILS) procedure combined with a variable neighbourhood search (VNS) for the total tardiness minimization. The proposed ILS makes ...
  • Hybrid metaheuristics for the tardines blocking flow shop problem 

    Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (2012-09-04)
    External research report
    Open Access
    This 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, ...
  • ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem 

    Juan, Angel A.; Ramalhinho-Lourenço, Helena; Mateo Doll, Manuel; Castellà, Quim; Barrios, Barry B. (2012-02-29)
    External research report
    Open Access
    From a managerial point of view, the more e cient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm ...
  • n-Cyclic Hoist Scheduling Problem to manufacture more than 2 products 

    Mateo Doll, Manuel; Companys Pascual, Ramón (2012-07-27)
    External research report
    Open Access
    Jobs of more than two products (n>2) must be manufactured in a production line of tanks. A hoist transports the jobs between tanks. If the size of both batches is equal and the number of jobs is high, a cyclic scheduling ...

View more