Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 44 of 44 results
  • Access to the full text
    Decisiones en el diseño de redes de logística inversa: propuesta de un modelo de decisión  Open access

     Ribas Vila, Immaculada; Rubio, Sergio
    International Conference on Industrial Engineering and Industrial Management
    Presentation's date: 2013-07-11
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Se 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 producto a recup e- rar. El modelo propuesto es el resultado de una extensa revisión de la literatura y propone el diseño de la red en función del valor residual del producto, de su “d e- preciación” durante el periodo de recuperación y del proceso de recuperación económica requerida (reutilización, reciclaje, refabricación)

  • Access to the full text
    A new constructive heuristic for the Fm|block|¿T  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    International Conference on Industrial Engineering and Industrial Management
    Presentation's date: 2013-07-11
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    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 selects the first job to be scheduled, the second phase ar ranges the remaining jobs and the third phase uses the insertion procedure of NEH to improve the sequence. T he proposed proce- dures evaluate the tardiness associated to the sequence obtained before and after the third phase in order to keep the best of both because , we have observed , that the insertion phase can worsen the result . The c omputational evaluation of these procedures against the benchmark constructive procedures from the literature re- veals their good performance

  • An efficient iterated local search algorithm for the total tardiness blocking flow shop problem

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Tort-Martorell Llabres, Javier
    International Journal of Production Research
    Date of publication: 2013-04-27
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    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 use of a NEHbased procedure to generate the initial solution, and uses a local search to intensify the exploration that combines the insertion and swap neighbourhood and uses a perturbation mechanism consisting of three neighbourhood operators to diversify the search. The computational evaluation has shown the effectiveness of combining the insertion and swap neighbourhood during the search despite the insertion neighbourhood being more effective than the swap neighbourhood for this problem. Finally, the computation of this algorithm when evaluated against two other algorithms from the literature shows good performance.

    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 use of a NEH-based procedure to generate the initial solution, and uses a local search to intensify the exploration that combines the insertion and swap neighbourhood and uses a perturbation mechanism consisting of three neighbourhood operators to diversify the search. The computational evaluation has shown the effectiveness of combining the insertion and swap neighbourhood during the search despite the insertion neighbourhood being more effective than the swap neighbourhood for this problem. Finally, the computation of this algorithm when evaluated against two other algorithms from the literature shows good performance.

  • A competitive variable neighbourhood search algorithm for the blocking flow shop problem

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Tort-Martorell Llabres, Javier
    European journal of industrial engineering
    Date of publication: 2013-12-23
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    El curioso comportamiento del procedimiento de inserción de la heurística NEH en el problema Fm|block|Cmax  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    International Conference on Industrial Engineering and Industrial Management
    Presentation's date: 2012-07-18
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    In 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 of the blocking flow shop problem. As a result of this work, we recommend to evaluate the sequence before and after the insertion phase in order to retain the best one

  • Access to the full text
    Solving the Fm|block|Cmax problem using bounded dynamic programming  Open access

     Bautista Valhondo, Joaquin; Cano Perez, Alberto; Companys Pascual, Ramon; Ribas Vila, Immaculada
    Engineering applications of artificial intelligence
    Date of publication: 2012-09-25
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    We present some results attained with two variants of Bounded Dynamic Programming algorithm to solve the Fm|block|Cmax problem using as an experimental data the well-known Taillard instances. We have improved the best known solutions for 17 of Taillard's instances, including the 10 instances from set 12.

  • Access to the full text
    Planificación estratégica de la capacidad en una empresa del sector limentación  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada; Bautista Valhondo, Joaquin
    Dirección y organización
    Date of publication: 2012-10-11
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    En esta comunicación se describe el procedimiento propuesto a una empresa del sector de la alimentación para planificar la capacidad productiva de las diferentes plantas aprovechando el cambio de ubicación forzoso de una de ellas. El caso de estudio puede servir de referencia a otros profesionales que se enfrenten a una situación semejante.

  • Solving flow shop problems with bounded dynamic programming

     Bautista Valhondo, Joaquin; Cano Perez, Alberto; Companys Pascual, Ramon; Ribas Vila, Immaculada
    Date of publication: 2012-01-10
    Book chapter

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    An efficient hybrid iterated local search algorithm for the total tardiness blocking flow shop problem  Open access

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Tort-Martorell Llabres, Javier
    Date: 2012-09-04
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    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 use of a NEH-based procedure to generate the initial solution, uses a local search to intensify the exploration which combines the insertion and swap neighbourhood and uses a perturbation mechanism that applies, d times, three neighbourhood operators to the current solution to diversify the search. The computational evaluation has shown that the insertion neighbourhood is more effective than the swap one, but it also has shown that the combination of both is a good strategy to improve the obtained solutions. Finally, the comparison of the ILS with an Iterated greedy algorithm and with a greedy randomized adaptive search procedure has revealed its good performance.

  • New insights on the blocking flow shop problem best solutions updated. Vol.7

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    Date: 2012-04-30
    Report

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Best solutions of taillard instances viewed as Fm|Block|Cmax problem instances.

    This paper is the 6th updated version of “New insights on the blocking flow shop problem” (January 2010). Each release updates the solutions of precedent releases. The values of the 2nd release (February 2010) were reproduced and used in Ribas et al. (2011). The release of February 2011 improves 90 solutions from the 120 and the release of November 2011, 22. The present paper improves also 28 solutions using a variant of PF, bi-lateral profile fitting, for initial solutions and the new version of the hyperheuristic CERCOP with an improved neighborhood exploration and an inefficient chains broker.

  • Access to the full text
    Hybrid metaheuristics for the tardines blocking flow shop problem  Open access

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Tort-Martorell Llabres, Javier
    Date: 2012-09-04
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    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, in order to minimize the total tardiness of jobs. The structure of both algorithms is very similar, but they differ in the way that the search is diversified in the space of solutions. In the ILS algorithm, the diversification is performed by a perturbation mechanism that takes into account some characteristics of the problem; whereas the perturbation in the IG is performed through a deconstruction and construction phase proposed in the literature that has been proven to be very effective in dealing also with the makespan criterion. Moreover, the algorithms have been tested with three initial solution procedures. The computation of these algorithms when evaluated against an algorithm from the literature has shown their good performance.

  • Access to the full text
    Best solutions of Ronconi, Imma-B and ImmA-C instances for the Fm|block|  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    Date: 2012-09-04
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    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.

  • A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem

     Bautista Valhondo, Joaquin; Cano, Alberto; Companys Pascual, Ramon; Ribas Vila, Immaculada
    IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making
    Presentation's date: 2011-04-12
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    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 solutions for four of the Taillard’s instances.

    Postprint (author’s final draft)

  • Solving flow shop problems with bounded dynamic programming

     Bautista Valhondo, Joaquin; Cano Perez, Alberto; Ribas Vila, Immaculada; Companys Pascual, Ramon
    International Conference on Industrial Engineering and Industrial Management
    Presentation's date: 2011-09-07
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

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

     Bautista Valhondo, Joaquin; Cano Perez, Alberto; Ribas Vila, Immaculada; Companys Pascual, Ramon
    IEEE Workshop on Computational Intelligence in Productions and Logistics Systems
    Presentation's date: 2011-04-14
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Planificación de la capacidad a largo plazo y diseño de la red de suministro

     Coves Moreno, Anna Maria; Mateo Doll, Manuel; Benedito Benet, Ernest; Mas Machuca, Marta; Martinez Costa, M. Carmen; Corominas Subias, Albert; Ribas Vila, Immaculada; Lusa Garcia, Amaia
    Participation in a competitive project

     Share

  • Access to the full text
    New insights on the blocking flow shop problem best solutions updated. Vol.6  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    Date: 2011-11-11
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    This paper is the 5th updated version of “New insights on the blocking flow shop problem” (January 2010). Each release updates the solutions of precedent releases The values of the 2nd release (February 2010) were reproduced and used in Ribas et al. (2011). The release of February 2011 improves 90 solutions from the 120. The present paper improves only 22 solutions using a new version of CERCOP with an improved neighborhood exploration and a inefficient chains broker.

  • Access to the full text
  • Access to the full text
    New best solutions for the blocking flow shop problem  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    Date: 2011-01-03
    Report

    Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

  • An iterated greedy algorithm for the flowshop scheduling problem with blocking

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Tort-Martorell Llabres, Javier
    Omega: the international journal of management science
    Date of publication: 2011
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Comparing three-step heuristics for the permutation flow shop problem

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Tort-Martorell Llabres, Javier
    Computers & operations research
    Date of publication: 2010-03-03
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    In 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 heuristic, to which a new tie breaking strategy has been incorporated in the insertion phase. Furthermore, the reversibility property of the problem dealt with is taken as a tool for improving the obtained solution. The third step consists of an iterated local search procedure with an embedded local search which is a variant of the non exhaustive descent algorithm. The statistical analysis of the results shows the effectiveness of the proposed procedures.

  • Note on the behaviour of an improvement heuristic on permutation and blocking flow-shop scheduling

     Companys Pascual, Ramon; Ribas Vila, Immaculada; Mateo Doll, Manuel
    International journal of manufacturing technology and management
    Date of publication: 2010
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    This work deals with the permutation flow-shop scheduling problem with and without storage space between stages, where the performance criterion is the makespan. Many proposed procedures to solve these problems have an improvement phase based on the search in the pair-wise interchange neighbourhood. The authors have observed large plateaus in the solutions domain of these problems defined for this type of neighbourhood that make it difficult for the heuristics to search for a road to the optimum. An improvement heuristic is proposed, which uses two tools in order to evade these difficulties: a stochastic exploration of the neighbourhood (revolver) and a special consideration of ties. The improvement heuristic is applied, in conjunction with three adapted well-known heuristics in the literature, to the direct and inverse instances. The performance of the procedures was evaluated on nine generated sets of a thousand instances and on 90 instances from Taillard (1993). The obtained results recommend applying always the constructive heuristic procedures on the direct and inverse instance. The computational experience proves the effectiveness of the two tools implemented in the improvement phase.

  • Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

     Ribas Vila, Immaculada; Leisten, Rainer; Framiñan ., Jose Manuel
    Computers & operations research
    Date of publication: 2010-08
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    In this paper, an extensive review of recently published papers on hybrid flow shop (HFS) scheduling problems is presented. The papers are classified first according to the HFS characteristics and production limitations considered in the respective papers. This represents a new approach to the classification of papers in the HFS environment. Second, the papers have been classified according to the solution approach proposed. These two classification categories give a comprehensive overview on the state of the art of the problem and can guide the reader with respect to future research work.

  • Improvement tools for NEH based heuristics on permutation and blocking flow shop scheduling problems

     Ribas Vila, Immaculada; Mateo Doll, Manuel; Companys Pascual, Ramon
    Date of publication: 2010-12-01
    Book chapter

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    In 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 problems considered and the second one is a new tie-breaking strategy to be use in the insertion phase of the NEH heuristic. In addition, we have analyzed the behavior of five initial solution procedures for both problems. The test done confirms the effectiveness of the measures proposed and allows us to recommend the best ordering procedure for each problem.

  • La gestió de projectes TIC a les pimes de comarques no metropolitanes  Open access

     Giralt Mas, M. Rosa
    Defense's date: 2010-07-20
    Department of Business Administration, Universitat Politècnica de Catalunya
    Theses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    La innovació en les TIC és clau per a qualsevol empresa. Innovar implica fer projectes, però també gestionar-los. Una bona gestió del projecte acostuma a garantir el seu èxit. Algunes empreses gestionen els seus projectes però altres, principalment pimes, ho fan d'una manera molt bàsica, especialment quan els projectes no pertanyen al nucli del seu negoci, com és el cas dels projectes TIC en empreses d'un altre sector. Aquest efecte encara és més acusat quan les pimes estan allunyades de les àrees metropolitanes. Caldria realitzar una metodologia de gestió de projectes per aquest perfil d'empreses.Per comprovar aquestes premisses, s'han realitzat enquestes a una mostra de pimes de la comarca del Bages. Les enquestes es van fer presencialment amb preguntes obertes que permetien als enquestats aportar comentaris. Se'ls va preguntar sobre el grau de gestió en els seus projectes. Els resultats han confirmat la idea inicial: la majoria de les pimes planifiquen breument els seus projectes però posteriorment no en fan el seguiment, ni segueixen cap tipus de metodologia de gestió.La informació recollida en les enquestes ha estat important de cara a dissenyar la nova metodologia de gestió de projectes, però també se n'ha utilitzat d'altra, com l'experiència prèvia dels autors en la realització de projectes de l'àmbit TIC en diverses empreses. Alhora, per a la realització del treball també s'han estudiat alguns trets característics de les metodologies de gestió de projectes més utilitzades, de les pimes i dels projectes TIC.Amb aquestes dades, s'ha desenvolupat una metodologia de gestió de projectes per a les pimes allunyades de les àrees metropolitanes i que no pertanyen al sector TIC. Tenint en compte que les empreses d'aquest perfil disposen de poc personal dedicat a la gestió dels projectes, s'ha intentat que la metodologia fos senzilla i fàcil de seguir, però que a la vegada fos completa i marqués les pautes clares per a aquestes empreses.La metodologia dissenyada consta de 5 fases: Abans del projecte, planificació del projecte, realització del projecte, documentació del projecte i després del projecte. S'ha fet especial èmfasi en els aspectes que cal tractar abans i després del projecte, ja que són els més habitualment oblidats per les empreses.La primera fase, abans del projecte, és útil per conscienciar l'empresa de la necessitat de tenir molt clara l'estratègia de l'empresa i el que vol arribar a aconseguir pel que fa a les TIC. A vegades cal realitzar un pla director de les TIC per veure la línia de projectes a realitzar i prioritzar-los. Si l'empresa no disposa de prou recursos humans, haurà de contemplar la col·laboració amb altres empreses.La segona fase, planificació del projecte, és clau perquè aquest es pugui dur a terme amb èxit. Aquesta fase suposa una ajuda a la pime a l'hora de planificar el projecte i calcular-ne el pressupost, tot indicant que cal tenir en compte els recursos humans disponibles i la possible necessitat de col·laborar amb altres empreses.A la tercera fase, realització del projecte, s'indiquen tots els aspectes que cal tenir en compte mentre es realitza el projecte, per poder així dur a terme un correcte seguiment del projecte. Alguns d'aquests aspectes són l'equip de treball, la comunicació, el control del temps i del cost entre altres.La quarta fase, documentació del projecte, fa èmfasi en la necessitat de redactar una documentació tècnica detallada, però també la conveniència de mantenir actualitzada una bona documentació de gestió.La cinquena i última fase,després del projecte, fa adonar a la pime de la necessitat de continuar pensant en el projecte un cop aquest ha finalitzat. Bé sigui perquè el seguirà un nou projecte relacionat, o perquè cal fer l'operació i el manteniment, sempre cal tenir presents les accions a realitzar.S'ha definit doncs una metodologia de gestió de projectes TIC que és fàcil de seguir i específica per a pimes de comarques fora de les àrees metropolitanes.

    Innovation in ICT is essential for any company. Innovation means doing projects, but it also means managing them. Good project management tends to ensure its success. Some companies manage their projects properly but others, especially SMEs, only do a very basic management, especially when projects do not belong to the core of their business, as is the case of ICT projects in companies that are not in this sector. This effect is even more pronounced when SMEs are located far from major metropolitan areas. A project management methodology for these companies' profile should be developed.To check these assumptions, a sample of SMEs in the Bages region has been surveyed. The surveys were carried out in face to face interviews with open questions that allowed respondents to provide details and comments. They were asked about the level of management in their projects. The results have confirmed the initial idea: the majority of SMEs plan their projects briefly but, then, they are not controlled during implementation and no management methodologies are followed.The information collected in surveys has been important in designing the new project management methodology. However, other information has also been used as the authors' previous experience in carrying out projects in the field of ICT in various companies. Moreover, for carrying out the work, some of the features from the most commonly used project management methodologies have been studied, together with the main features of SMEs and ICT projects.With these data, a project management methodology particularly useful for SMEs located far from metropolitan areas and outside the ICT sector has been developed. Due to the fact that most companies belonging to this class have few staff dedicated to project management, we have put emphasis on developing a simple and easy to follow methodology which, at the same time, is complete and points out the most appropriate guidelines for these companies to follow.The methodology designed consists of five stages: Before the project, project planning, project implementation, project documentation and after the project. Special emphasis has been put on those aspects that must be treated before and after the project, since they are usually forgotten by most companies.The first phase, before the project, is useful for the company to become aware of the need for clear strategy and what the company wants to achieve with regard to ICT. Sometimes a master plan for ICTs has to been drawn to see the line of projects to be carried out and prioritize them. If the company does not have sufficient human resources the possibility of collaboration with other companies has to be considered.The second phase, project planning, it is very important for the project to be carried out successfully. This phase is an assistance to the SME when planning the project and calculating the budget, indicating that one must take into account the available human resources and the possible need to collaborate with other companies.In the third phase, project implementation, all aspects that should be taken into account while performing the project are indicated, allowing to correctly control the project. Some of these aspects are work team, communication and timing and cost control among others.The fourth phase, project documentation, emphasizes the need to write a detailed technical documentation for any project, but also the convenience of keeping up to date good management documentation.The fifth and final phase, after the project, makes the SME realize the need to continue thinking about the project once it has been completed. Either because it will be followed by a new related project, or because the recent one has to be maintained and kept in operation, the required actions have to be kept in mind.As a conclusion, we have defined an ICT project management methodology which is easy to follow and specific for SME's located far from major metropolitan areas.

  • Access to the full text
    Newinsights on the blocking flow shop problem best solutions updated  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    Date: 2010-12-13
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    update of the best solution for Taillard's instances on the blocking flow shop problem

  • Access to the full text
    New insights on the blocking flow shop problem  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    Date: 2010-02-01
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    We present some results attained with different algorithms for the Fm|block|Cmax problem using as experimental data the well-known Taillard instances.

  • Access to the full text
    On tie-breakers and other exotic Tools for the NEH Algorithm  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    Date: 2010-02-01
    Report

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Este es el primero de tres trabajos dedicados a procedimientos de resolución de los problemas flowshop con criterio minimización del makespan, basados en la clásica heurística de Nawaz, Enscore y Ham. Consideramos dos casos el Fm|prmu|Cmax y el Fm|block|Cmax. En el presente trabajo analizamos los procedimientos de desempate en la intercalación del segundo paso del NEH. Basamos las conclusiones en los experimentos realizados tomando como base los 120 ejemplares de las colecciones de Taillard. Son suficientemente conocidos y ejercen cierta fascinación sobre los investigadores. En el anexo recogemos resultados sobre otras colecciones, más numerosas, generadas siguiendo los principios establecidos por Taillard.

  • Programación bicriterio para máquinas en paralelo.

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Mateo Doll, Manuel
    Dyna
    Date of publication: 2009-06
    Journal article

     Share Reference managers Reference managers Open in new window

  • A hybrid flow shop model for an ice cream production scheduling problem

     Ribas Vila, Immaculada; Companys Pascual, Ramon
    Journal of industrial engineering and management (JIEM)
    Date of publication: 2009-06
    Journal article

     Share Reference managers Reference managers Open in new window

  • Un procedimiento GRASP para la programación de pedidos en máquinas paralelas con tiempos de preparación  Open access

     Mateo Doll, Manuel; Ribas Vila, Immaculada; Companys Pascual, Ramon
    Dirección y organización
    Date of publication: 2009-12
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Se resuelve el problema de programación en un sistema productivo formado por máquinas paralelas diferentes. Cada pedido está compuesto por varios lotes de productos, con sus respectivas cantidades, y una fecha de vencimiento. Para realizar un cier to tipo de producto, cada máquina tiene un tiempo de preparación dependiente de la secuencia y un tiempo de proceso. El problema consiste en asignar y programar cada lote en una máquina, minimizando una función objetivo bicriterio, que considera el retraso medio y el tiempo de permanencia medio por pedido. Se propone un GRASP con tres reglas para la solución inicial.

  • Access to the full text
    Johnson revisited, ten years later  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    International Conference on Industrial Engineering and Industrial Management
    Presentation of work at congresses

    Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    Explotación de la reversibilidad del problema Fm|prmu|Cmax para mejorar las soluciones de las heurísticas  Open access

     Companys Pascual, Ramon; Ribas Vila, Immaculada
    International Conference on Industrial Engineering and Industrial Management
    Presentation's date: 2009-09-02
    Presentation of work at congresses

    Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

  • Improvement tools for NEH based heuristics on permutation and blocking flow-shop scheduling problems

     Companys Pascual, Ramon; Ribas Vila, Immaculada; Mateo Doll, Manuel
    International Conference on Advances in Production Management Systems
    Presentation's date: 2009-09-22
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Adaptación de Heurísticas para la secuenciación de piezas en una máquina al problema de secuenciación en máquinas en paralelo

     Ribas Vila, Immaculada; Companys Pascual, Ramon
    Dirección y organización
    Date of publication: 2008-06
    Journal article

     Share Reference managers Reference managers Open in new window

  • programación bicriterio para máquinas en paraleloy tiempos de preparación dependientes de la secuencia

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Mateo Doll, Manuel
    International Conference on Industrial Engineering and Industrial Management
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Estado del arte de la planificación colaborativa en la cadena de suministro: Contexto determinista e incierto

     Ribas Vila, Immaculada; Companys Pascual, Ramon
    Intangible capital
    Date of publication: 2007-07
    Journal article

     Share Reference managers Reference managers Open in new window

  • Programación de operaciones multicriterio con máquinas paralelas, en varias etapas, sin interrupciones ni almacenajes

     Mateo Doll, Manuel; Salamero Salas, Antonio; Companys Pascual, Ramon; Grima Cintas, Pedro; Santos Lopez, M. Antonia de Los; Ribas Vila, Immaculada; Tort-Martorell Llabres, Javier
    Participation in a competitive project

     Share

  • Un algoritmo exacto para la secuenciación de piezas en una máquina con tiempos de preparación dependientes de la secuencia

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Mateo Doll, Manuel
    International Conference on Industrial Engineering and Industrial Management
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • DPI2001-2169 SECUENCIACIÓN DE UNIDADES CON RESTRICCIONES MULTIPLES

     Ribas Vila, Immaculada; Companys Pascual, Ramon; Mateo Doll, Manuel
    Participation in a competitive project

     Share