Ara es mostren els items 1-20 de 65

  • 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)
    Text en actes de congrés
    Accés restringit per política de l'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 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ítol de llibre
    Accés restringit per política de l'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 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)
    Article
    Accés restringit per política de l'editorial
  • 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)
    Article
    Accés obert
    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 New Constructive Heuristic for the Fm|block|ST 

    Companys Pascual, Ramón; Ribas Vila, Immaculada (2014-08-31)
    Capítol de llibre
    Accés obert
    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)
    Text en actes de congrés
    Accés obert
    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 procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem 

    Mateo Doll, Manuel; Manier, Marie-Ange; Companys Pascual, Ramón (2015)
    Text en actes de congrés
    Accés obert
    When various kinds of products must receive the same treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing composed of a job from each batch can be ...
  • A procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem with n types of product 

    Mateo Doll, Manuel; Manier, Marie-Ange; Companys Pascual, Ramón (2015)
    Text en actes de congrés
    Accés obert
    When various kinds of products must receive the sam e treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing composed of a job from each batch can ...
  • A procedure to solve the CORV problem 

    Bautista Valhondo, Joaquín; Mateo Doll, Manuel; Companys Pascual, Ramón; Corominas Subias, Albert (IEEE Computer Society Conference Publishing Services (CPS), 1999-07-24)
    Capítol de llibre
    Accés restringit per política de l'editorial
  • 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)
    Article
    Accés restringit per política de l'editorial
    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
    Accés obert
    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)
    Article
    Accés restringit per política de l'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 ...
  • Aplicación de la CLP al problema de secuencia regulares con restricciones en una cadena de montaje de automóviles 

    Bautista Valhondo, Joaquín; Companys Pascual, Ramón; Vila, Albert; Pereira Gude, Jordi; Mateo Doll, Manuel (Ministerio de Defensa, 2000)
    Text en actes de congrés
    Accés obert
    Las líneas de montaje de automóviles presentan problemas de diseño y programación cada vez más complejos generados por la diversificación del producto mediante opciones ofertadas sobre un modelo base. El problema de ...
  • Aplicación de la CLP al problema de secuencias regulares con restricciones en una cadena de montaje de automóviles 

    Bautista Valhondo, Joaquín; Companys Pascual, Ramón; Vila, Albert; Pereira Gude, Jordi; Mateo Doll, Manuel (Ministerio de Defensa. Subdirección General de Publicaciones y Patrimonio Cultural, 2001-04-01)
    Text en actes de congrés
    Accés obert
    Las líneas de montaje de automóviles presentan problemas de diseño y programación cada vez más complejos generados por la diversificación del producto mediante opciones ofertadas sobre un modelo base. El problema de ...
  • Aplicación del algoritmo lompen a los problemas Fm | prmu | Cmac y Fm | block | Cmax 

    Companys Pascual, Ramón; Mateo Doll, Manuel; Alemán, A. (2005-03-01)
    Report de recerca
    Accés obert
    In this paper we face the permutation flow-shop scheduling problem with a makespan objective function in two variants, with and without storage space between machines. We use an improved branch and bound algorithm, suitable ...
  • 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
    Accés obert
    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
    Accés obert
    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
    Accés obert
    we summarize the new best solutions, most of them found during in our research, for the Taillard instances.
  • Col·lecció de problemes 

    Cuadras, C.M. (Carlos Maria); Oller Sala, Josep Maria; Companys Pascual, Ramón (Universitat Politècnica de Barcelona. Centre de Càlcul, 1986-12)
    Ressenya
    Accés obert
  • Col·lecció de problemes 

    Companys Pascual, Ramón; Corominas Subias, Albert (Universitat Politècnica de Barcelona. Centre de Càlcul, 1986-03)
    Ressenya
    Accés obert