Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 50 of 182 results
  • Using iterated local search for solving the flow-shop problem: Parallelization, parametrization, and randomization issues

     Juan-Pérez, Angel A.; Lourenço, Helena R.; Mateo Doll, Manuel; Luo, Rachel; Castella, Quim
    International transactions in operational research
    Date of publication: 2014-01
    Journal article

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

    Iterated local search (ILS) is a powerful framework for developing efficient algorithms for the permutation flow-shop problem (PFSP). These algorithms are relatively simple to implement and use very few parameters, which facilitates the associated fine-tuning process. Therefore, they constitute an attractive solution for real-life applications. In this paper, we discuss some parallelization, parametrization, and randomization issues related to ILS-based algorithms for solving the PFSP. In particular, the following research questions are analyzed: (a) Is it possible to simplify even more the parameter setting in an ILS framework without affecting performance? (b) How do parallelized versions of these algorithms behave as we simultaneously vary the number of different runs and the computation time? (c) For a parallelized version of these algorithms, is it worthwhile to randomize the initial solution so that different starting points are considered? (d) Are these algorithms affected by the use of a "good-quality" pseudorandom number generator? In this paper, we introduce the new ILS-ESP (where ESP is efficient, simple, and parallelizable) algorithm that is specifically designed to take advantage of parallel computing, allowing us to obtain competitive results in "real time" for all tested instances. The ILS-ESP also uses "natural" parameters, which simplifies the calibration process. An extensive set of computational experiments has been carried out in order to answer the aforementioned research questions.

  • Creación de clusters para una mejor oferta de actividades extraescolares en Barcelona, España

     Mateo Doll, Manuel; Subirachs Torne, Miquel; Martínez Villaplana, Jordi; Figueras Castells, Pere; D'Armas Regnault, Mayra
    Latin American and Caribbean Conference for Engineering and Technology
    Presentation's date: 2013-08-15
    Presentation of work at congresses

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

  • An efficient metaheuristic for the inventory orienteering problem and the single-vehicle cyclic inventory routing problem

     Vansteenwegen, Pieter; Mateo Doll, Manuel
    Multidisciplinar International Scheduling Conference: Theory and Applications
    Presentation's date: 2013-08-27
    Presentation of work at congresses

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

  • Methodology for the strategic capacity planning in universities

     De La Torre Martinez, Maria Del Rocio; Lusa Garcia, Amaia; Mateo Doll, Manuel
    International Conference on Industrial Engineering and Industrial Management
    Presentation's date: 2013-07-12
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem

     Juan Perez, Angel Alejandro; Castella, Q; Ramalhinho-Lourenço, Helena; Barrios, Barry B.; Mateo Doll, Manuel
    Workshop on Statistics, Mathematics, and Computation and Portuguese-Polish Workshop on Biometry
    Presentation's date: 2012-07-04
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • An algorithm for a biobjective parallel machine problem with eligibility and release and delivery times

     Mateo Doll, Manuel; Teghem, Jacques
    International Conference of Modeling and Simulation
    Presentation's date: 2012-06-06
    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

    The scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not always all the jobs can be manufactured in any machine and the eligibility appears. Based on a real-life situation, we present a company which has three different sets of machines, called as high-level, medium-level and low-level respectively. Besides, there are release times and delivery times related to the respective previous operations and following operations to the main process to be carried in the parallel machines. A set of n jobs to be scheduled on these m parallel machines are also distributed among levels. One job from a level can be manufactured in a machine of the same or higher level. Initially all the jobs are processed on the machines of high level. But a penalty appears when a job is manufactured in a machine different of this initial level. The proposed algorithm solves the problem with two criteria: the minimization of the completion time or makespan, Cmax, and the minimization of the total penalty. The objective is to determine or to approximate the Pareto front. Several alternatives are presented according to different rules to move a job from one machine to another and compared through numerical experiments.

    Keywords: parallel machines, eligibility, release times, delivery times, Pareto front.

  • Access to the full text
    Combinando randomización sesgada y búsqueda local iterativa para resolver problemas de flow-shop  Open access

     Lourenço, Helena R.; Mateo Doll, Manuel; Grasas, Alex; Agustín Martín, Alba; Juan Perez, Angel Alejandro
    Congreso Español sobre Metaheurísticas, Algoritmos Evolutivos y Bioinspirados
    Presentation's date: 2012-02-08
    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

    A la hora de poder aplicar algoritmos te oricos a casos reales, no solo resulta conveniente que el algoritmo sea e ciente sino tambi en que sea lo m as comprensible posible y que no requiera de comple- jos procesos de parametrizaci on. Siguiendo esta l ogi- ca, proponemos aqu un algoritmo h brido que reune las caracter sticas anteriores para resolver el proble- ma del Flow-Shop (FSP). El algoritmo, que no re- quire de parametrizaci on alguna, combina estrategias de randomizaci on con una B usqueda Local Iterativa (ILS), logrando ser competitivo con otros conocidos algoritmos que se encuentran entre los m as simples y e cientes para el FSP. Nuestro enfoque de ne (1) un nuevo operador para el proceso de perturbaci on ILS, (2) un nuevo criterio de aceptaci on basado en reglas simples y transparentes, y (3) un proceso de random- izaci on sesgada de la soluci on inicial. Los resultados preliminares obtenidos con las instancias de Taillard permiten concluir que la soluci on propuesta puede ser una excelente alternativa en aplicaciones reales

  • Access to the full text
    Creación de celdas cooperativas en un grupo de tiendas de una misma franquicia  Open access

     Mateo Doll, Manuel; De La Torre Martinez, Maria Del Rocio; d'Armas Regnault, Mayra
    Latin American and Caribbean Conference for Engineering and Technology
    Presentation's date: 2012-07-26
    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

    En este trabajo se resuelve un problema de creación de celdas cooperativas en un grupo de tiendas que forman parte de una misma franquicia, que permitan evitar las posibles roturas de stocks derivadas de incrementos puntuales de la demanda. El problema de las celdas cooperativas se inscribe en el marco del Vehicle Routing Problem (VRP). Para la resolución del problema se aplicaron dos procedimientos basados en el estudio de las distancias entre los componentes de las celdas. El primero (GCSI) sigue dos fases: en primer lugar se genera una solución inicial intuitiva y posteriormente se aplica un procedimiento de mejora fundamentado en el Variable Neighborhood Search (VNS) con aportaciones propias del Multi-Start Local Search (MSLS). En el segundo (GCGRASP) se aplica un GRASP. Los dos procedimientos se experimentaron en un caso real que consta de 116 tiendas, todas pertenecientes a la misma cadena de franquicias y ubicadas en la zona sur de Inglaterra. Los resultados demuestran que el procedimiento GCGRASP puede alcanzar valores de la distancia media por celda inferiores a los que se obtienen aplicando el procedimiento GCSI. No obstante, los tiempos de cálculo en aplicar el procedimiento GCSI son muy inferiores a los tiempos obtenidos para el procedimiento GCGRASP.

  • Access to the full text
    Strategic capacity planning in KIOs: a classification scheme  Open access

     Martinez Costa, M. Carmen; Lusa Garcia, Amaia; Mas Machuca, Marta; De La Torre Martinez, Maria Del Rocio; Mateo Doll, Manuel
    International Conference on Industrial Engineering and Industrial Management. Congreso de Ingeniería de Organización
    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

    This paper introduces the Strategic Capacity Planning problem in knowledge intensive organizations (KIOs) and proposes a classification scheme based on different characteristics such as the organization structure, the workforce characteristics, the capacity requirements, the capacity decisions or the evaluation criteria, among others. The classification, which gives rise to a high number of variants, is the first step towards a general solving methodology design and the developing of ad hoc solving procedures

  • Analysis of the single-vehicle cyclic inventory routing problem

     Aghezzaf, El-Houssaine; Zhong, Yiqing; Raa, Birger; Mateo Doll, Manuel
    International journal of systems science
    Date of publication: 2012-09
    Journal article

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

  • A combined inventory routing and game theory approach to solve a real-life distribution problem.

     Mateo Doll, Manuel; Aghezzaf, El-Houssaine; Vinyes Vila, Pau
    International journal of business performance and supply chain modeling
    Date of publication: 2012-01-01
    Journal article

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

  • Access to the full text
    ILS-ESP: An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem  Open access

     Juan Perez, Angel Alejandro; Ramalhinho-Lourenço, Helena; Mateo Doll, Manuel; Castellà, Quim; Barrios, Barry B.
    Date: 2012-02-29
    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

    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 for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most e cient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can a ect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic ‘common sense’ rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate di erent alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.

  • Access to the full text
    n-Cyclic Hoist Scheduling Problem to manufacture more than 2 products  Open access

     Mateo Doll, Manuel; Companys Pascual, Ramon
    Date: 2012-07-27
    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

    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 can be proposed. The problem consists in the scheduling of hoist movements, which is known as CHSP (Cyclic Hoist Scheduling Problem). The objective is double: first, determine a sequence of the n products in a job cycle and then minimise the cycle time for the given sequence of products (n-cycle). We propose the use of a branch-and-bound procedure previously developed, which was developed for the 2-cycle. As there are different sequences of products, the experience demonstrates that the use of upper bounds as a result of previous steps in the algorithms generally leads to the optimum solution in lower times.

  • Programación de pedidos en un taller con máquinas en paralelo y tiempo de preparación

     Mateo Doll, Manuel; D'Armas Regnault, Mayra
    Latin American and Caribbean Conference for Engineering and Technology
    Presentation's date: 2011-08-03
    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

  • Ergonomics as basis for a decision support system in the printing industry

     Mateo Doll, Manuel; Alvarez Casado, Enrique; Rodriguez Mondelo, Pedro Manuel; Tarral, Marc
    International Conference on Occupational Risk Prevention
    Presentation's date: 2010-05-01
    Presentation of work at congresses

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

  • Assignment process of the emergency services in the E-Call project

     Gallegos Diez, David; Liesa Mestres, Francisco; Mateo Doll, Manuel
    FISITA World Automotive Congress
    Presentation's date: 2010-05-31
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Access to the full text
    An exact algorithm for the single-vehicle cyclic inventory routing problem  Open access

     Aghezzaf, El-Houssaine; Zhong, Yiqing; Raa, Birger; Mateo Doll, Manuel
    International Conference of Modeling and Simulation
    Presentation's date: 2010-05-10
    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

    The single-vehicle cyclic inventory routing problem (SV CIRP) consists of a repetitive distribution of a product from a single depot to a selected subset of customers. For each customer that is selected for replenishments, the supplier collects a corresponding xed reward. The objective is to determine the subset of customers to replenish, the quantity of the product to be delivered to each, and to design the vehicle route so that the resulting pro t (di erence between the total reward and the total logistical cost) is maximized while preventing stockouts at each of the selected customers. In this paper, the SV CIRP is formulated as a mixed-integer program with a nonlinear objective function. After an e cient analysis of the problem, an exact algorithm for its solution is proposed. This exact algorithm requires only solutions of linear mixed-integer programs. Values of an insertion-based heuristic for this problem are compared to the optimal values obtained for a set of some test problems. In general the gap may get as large as 25%, which justi es the e ort to continue exploring and developing exact and approximation algorithms for the SV CIRP.

  • Use of simulation for the distribution of emergency teams in a loop-road around Barcelona

     Gallegos Diez, David; Mateo Doll, Manuel; García-Tornel, Lorenzo
    International Conference of Modeling and Simulation
    Presentation's date: 2010-05-11
    Presentation of work at congresses

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

  • Access to the full text
    A simulation-based approach for solving the flowshop problem  Open access

     Juan Perez, Angel Alejandro; Ruíz, Rubén; Lourenço, Helena R.; Mateo Doll, Manuel; Ionescu, Dragos
    Winter Simulation Conference
    Presentation's date: 2010-12
    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

    A simulation-based algorithm for the Permutation Flowshop Sequencing Problem (PFSP) is presented. The algorithm uses Monte Carlo Simulation and a discrete version of the triangular distribution to incorporate a randomness criterion in the classical Nawaz, Enscore, and Ham (NEH) heuristic and starts an iterative process in order to obtain a set of alternative solutions to the PFSP. Thus, a random but biased lo We can then consider several properties per solution other than the makespan, such as balanced idle times among machines, number of completed jobs at a given target time, etc. This allows the decision-maker to consider multiple solution characteristics apart from those defined by the aprioristic objective function. Therefore, our methodology provides flexibility during the sequence selection process, which may help to improve the scheduling process. Several tests have been performed to discuss the effectiveness of this approach. The results obtained so far are promising enough to encourage further developments and improvements on the algorithm and its applications in real-life scenarios. In particular, Multi-Agent Simulation is proposed as a promising technique to be explored in future works.

  • 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.

  • 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.

  • Planning production using mathematical programming: The case of a woodturning company

     Pastor Moreno, Rafael; Altamiras, Jordi; Mateo Doll, Manuel
    Computers & operations research
    Date of publication: 2009-07
    Journal article

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

  • 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

  • Determinación de las rutas de un robot transportador en un sistema productivo

     Mateo Doll, Manuel; D'Armas Regnault, Mayra; Santos Lopez, M. Antonia de Los
    Latin American and Caribbean Conference for Engineering and Technology
    Presentation's date: 2009-06-04
    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

    En este trabajo se resuelve un problema de programación de los ciclos producción en un sistema productivo con la presencia de robots transportadores o vehículos autoguiados. Se determinó la secuencia óptima de transporte de las piezas entre las máquinas, a partir de los tiempos de procesamiento y de transporte de las piezas de una etapa a otra del proceso productivo. El objetivo de este trabajo es obtener la secuencia óptima de movimientos del robot transportador para diferentes configuraciones de un sistema productivo (máquinas que pueden estar activas e inactivas, disposiciones lineal y circular de las máquinas). Para la resolución de los diferentes casos se programó en lenguaje Visual Basic un algoritmo Brach and Bound. El algoritmo se experimentó con 214 ejemplares. Los resultados demuestran que existen relaciones entre las diferentes características del sistema productivo, como son los tiempos de ciclo, los tiempos de procesamiento o la distribución de las máquinas dentro del proceso productivo. Estos resultados evidencian las configuraciones del sistema que permiten reducir de manera significativa los tiempos ciclos del robot transportador.

  • 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.

  • A Combined Inventory Routing and Game Theory Approach for a Real-World Distribution Problem

     Mateo Doll, Manuel; Aghezzaf, El-Houssaine; Vinyes Vila, Pau
    International Conference on Computers and Industrial Engineering
    Presentation's date: 2009-07-06
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • El impacto del efecto bullwhip en una cadena de suministro real: análisis y mejora de su rendimiento a través de la dinámica industrial

     Hernández Balbuena, Rubén; Mateo Doll, Manuel; Companys Pascual, Ramon
    International Conference on Industrial Engineering and Industrial Management
    Presentation's date: 2009-09-03
    Presentation of work at congresses

    View View 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

  • Programación n-cíclia en una línea de fabricación con puente-grúa

     Mateo Doll, Manuel; 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 de la secuencia de las órdenes de producción mediante la aplicación de algoritmos genéticos

     Mateo Doll, Manuel; D'Armas Regnault, Mayra
    Universidad, ciencia y tecnología
    Date of publication: 2008-12
    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

  • A supply chain analyzed under the game theory

     Mateo Doll, Manuel
    7e Conférence Francophone de MOdélisation et SIMulation. Mosim'08
    Presentation's date: 2008-03-31
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • The open operational research journal

     Mateo Doll, Manuel
    Collaboration in journals

     Share

  • A supply chain analyzed under the game theory

     Mateo Doll, Manuel; Vinyes, P
    7e Conférence Francophone de MOdélisation et SIMulation. Mosim'08
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • A GRASP procedure for scheduling orders of multiple products on parallel machines with setups

     Mateo Doll, Manuel
    International Federation of Operational Research Societies Conference
    Presentation's date: 2008-07-17
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Different behaviour of a double branch-and-bound algorithm on FmprmuCmax and FmblockCmax problems

     Companys Pascual, Ramon; Mateo Doll, Manuel
    Computers & operations research
    Date of publication: 2007-04
    Journal article

     Share Reference managers Reference managers Open in new window

  • Programación n-cíclica en una línea de fabricación con puente-grúa

     Mateo Doll, Manuel; Companys Pascual, Ramon
    International Conference on Industrial Engineering and Industrial Management
    Presentation's date: 2007-09-05
    Presentation of work at congresses

     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

  • European journal of operational research

     Mateo Doll, Manuel
    Collaboration in journals

     Share

  • International journal of manufacturing technology and management

     Mateo Doll, Manuel
    Collaboration in journals

     Share

  • Swarm intelligence

     Mateo Doll, Manuel
    Collaboration in journals

     Share

  • Programación n-cíclica en una línea de fabricación con puente-grúa.

     Mateo Doll, Manuel
    International Conference on Industrial Engineering and Industrial Management
    Presentation's date: 2007-09-05
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • 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

  • Hoist Scheduling in a chemical line to produce batches with identical sizes of different products

     Mateo Doll, Manuel; Companys Pascual, Ramon
    6e Conférence Francophone de MOdélisation et SIMulation
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Solving the CSP with lp_solve

     Libbrecht, Nicolas; Manel, Mateo; Mateo Doll, Manuel
    Date: 2006-07
    Report

     Share Reference managers Reference managers Open in new window

  • Hoist Scheduling in a chemical line to produce batches with identical sizes of different products

     Mateo Doll, Manuel
    6e Conférence Francophone de MOdélisation et SIMulation
    Presentation's date: 2006-04-03
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window