• A bounded dynamic programming algorithm for the blocking flow shop problem 

      Bautista Valhondo, Joaquín; Cano Pérez, Alberto; Companys Pascual, Ramón; Ribas Vila, Immaculada (IEEE Computer Society Conference Publishing Services (CPS), 2011-04-11)
      Capítulo de libro
      Acceso restringido por política de la editorial
      We present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best-known ...
    • A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem 

      Bautista Valhondo, Joaquín; Cano Pérez, Alberto; Companys Pascual, Ramón; Ribas Vila, Immaculada (2011)
      Texto en actas de congreso
      Acceso restringido por política de la editorial
      We present some results attained with two variants of bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best known ...
    • A competitive variable neighbourhood search algorithm for the blocking flow shop problem 

      Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (2013-12-23)
      Artículo
      Acceso restringido por política de la editorial
    • A computational evaluation of constructive heuristics for the parallel blocking flow shop problem with sequence-dependent setup times 

      Ribas Vila, Immaculada; Companys Pascual, Ramón (2021-01-22)
      Artículo
      Acceso abierto
      This paper deals with the problem of scheduling jobs in a parallel flow shop environment without buffers between machines and with sequence-dependent setup times in order to minimize the maximum completion time of jobs. ...
    • A critical sight to the NEH heuristic 

      Companys Pascual, Ramón; Ribas Vila, Immaculada (Springer, 2017-04-03)
      Capítulo de libro
      Acceso restringido por política de la editorial
    • A framework for designing a supply chain distribution network 

      Ribas Vila, Immaculada; Lusa García, Amaia; Corominas Subias, Albert (Taylor & Francis, 2018-10-08)
      Artículo
      Acceso abierto
      Based on the analysis of the pertinent literature, we propose a framework to serve as a guide in designing a distribution network as a component of a supply chain (SC). It consists of three steps that are common to goods ...
    • A hybrid flow shop model for an ice cream production scheduling problem 

      Ribas Vila, Immaculada; Companys Pascual, Ramón (School of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC), 2009-06)
      Artículo
      Acceso abierto
      In this paper we address the scheduling problem that comes from an ice cream manufacturing company. This production system can be modelled as a three stage nowait hybrid flow shop with batch dependent setup costs. To ...
    • A Model to Align Organizational Culture to Lean Culture 

      Taherimashhadi, Mehrsa; Ribas Vila, Immaculada (OmniaScience, 2018-04)
      Artículo
      Acceso abierto
      Purpose: Since the emergence of Lean Manufacturing many organizations strived to implement it. Nonetheless, sustainable Lean transformation is not as easy as to be simply achieved. Several aspects need to be taken into ...
    • A model to align organizational culture to lean culture 

      Taherimashhadi, Mehrsa; Ribas Vila, Immaculada (Universitat Politècnica de Catalunya. Departament d'Organització d'Empreses (OE), 2018-01-01)
      Artículo
      Acceso abierto
      Purpose: Since the emergence of Lean Manufacturing many organizations strived to implement it. Nonetheless, sustainable Lean transformation is not as easy as to be simply achieved. Several aspects need to be taken into ...
    • A New Constructive Heuristic for the Fm|block|ST 

      Companys Pascual, Ramón; Ribas Vila, Immaculada (2014-08-31)
      Capítulo de libro
      Acceso abierto
      This paper deals with the blocking flow shop problem and proposes new constructive procedures for the total tardiness minimization of jobs. The heuristic has three-phases to build the sequence; the first phase selects the ...
    • A new constructive heuristic for the Fm|block|¿T 

      Companys Pascual, Ramón; Ribas Vila, Immaculada (2013)
      Texto en actas de congreso
      Acceso abierto
      This paper deals with the blocking flow shop problem and proposes new constructive procedure s for the total tardiness minimization of jobs. The heuristic has three - phases to build the sequence; the first phase ...
    • A note on the paper ‘Demonstrating Johnson’s algorithm via resource constrained scheduling’ 

      Companys Pascual, Ramón; Ribas Vila, Immaculada (Taylor & Francis, 2017-11-13)
      Artículo
      Acceso abierto
      In this paper we demonstrate that the relation between two jobs defined by min{ai, bj}=min{bi, aj}, used in Johnson’s theorem, is not transitive. However, both the theorem and Johnson’s algorithm are correct.
    • An efficient discrete artificial bee colony algorithm for the blocking flow shop problem with total flowtime minimization 

      Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (2015-09-01)
      Artículo
      Acceso abierto
      This paper presents a high performing Discrete Artificial Bee Colony algorithm for the blocking flow shop problem with flow time criterion. To develop the proposed algorithm, we considered four strategies for the food ...
    • 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)
      Report de recerca
      Acceso abierto
      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 ...
    • An efficient iterated local search algorithm for the total tardiness blocking flow shop problem 

      Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (Taylor & Francis, 2013-04-27)
      Artículo
      Acceso restringido por política de la editorial
      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 minimisation. The proposed ILS makes ...
    • An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem 

      Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort Martorell, X. (2019-05-01)
      Artículo
      Acceso abierto
      This paper proposes an iterated greedy algorithm for scheduling jobs in F parallel flow shops (lines), each consisting of a series of m machines without storage capacity between machines. This constraint can provoke the ...
    • Analysis of mobility patterns and intended use of shared mobility services in the Barcelona region 

      Gilibert Junyent, Mireia; Ribas Vila, Immaculada; Rodríguez Donaire, Silvia (2019)
      Texto en actas de congreso
      Acceso abierto
      Social and economic trends have strongly changed in the last years due to the economic crisis and the evolution of technology. These factors have influenced a sharing revolution, also in the mobility sector motivated for ...
    • 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)
      Report de recerca
      Acceso abierto
      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 ...
    • Best solutions of Ronconi, Imma-B and ImmA-C instances for the Fm|block| 

      Companys Pascual, Ramón; Ribas Vila, Immaculada (2012-09-04)
      Report de recerca
      Acceso abierto
      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.
    • 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)
      Report de recerca
      Acceso abierto
      we summarize the new best solutions, most of them found during in our research, for the Taillard instances.