Exploració per autor "Companys Pascual, Ramón"
Ara es mostren els items 8-27 de 87
-
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 obertThis 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)
Article
Accés obertIn 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. -
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 obertWhen 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 obertWhen 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 obertThis 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 obertThis 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'editorialThis 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)
Article
Accés obertThis 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 ... -
An iterated greedy algorithm for the parallel blocking flow shop scheduling problem and sequence-dependent setup times
Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (2021-07-08)
Article
Accés obertThis paper deals with the problem of scheduling jobs in a parallel flow shop configuration under the blocking constraint, in which the setup time of machines depends not only on the job to be processed but also on the ... -
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 obertLas 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 obertLas 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 obertIn 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 ... -
Aportaciones a la modelización y resolución del problema de reparto proporcional con aplicaciones a la organización
Bautista Valhondo, Joaquín; Companys Pascual, Ramón; Corominas Subias, Albert (Centre de Publicacions d'Abast (CPDA - ETSEIB), 1999-09-16)
Capítol de llibre
Accés obertEl problema del reparto proporcional ha sido estudiado principalmente en relación con el reparto de escaños en una cámara de representantes, pero tiene muchas otras aplicaciones, una de las cuales es la resolución del ... -
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 obertThe 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 obertA 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 obertwe 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 -
Comparing three-step heuristics for the permutation flow shop problem
Ribas Vila, Immaculada; Companys Pascual, Ramón; Tort-Martorell Llabrés, Xavier (2010-03-03)
Article
Accés restringit per política de l'editorialIn 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 ...