2,267 research outputs found

    The Project Scheduling Problem with Non-Deterministic Activities Duration: A Literature Review

    Get PDF
    Purpose: The goal of this article is to provide an extensive literature review of the models and solution procedures proposed by many researchers interested on the Project Scheduling Problem with nondeterministic activities duration. Design/methodology/approach: This paper presents an exhaustive literature review, identifying the existing models where the activities duration were taken as uncertain or random parameters. In order to get published articles since 1996, was employed the Scopus database. The articles were selected on the basis of reviews of abstracts, methodologies, and conclusions. The results were classified according to following characteristics: year of publication, mathematical representation of the activities duration, solution techniques applied, and type of problem solved. Findings: Genetic Algorithms (GA) was pointed out as the main solution technique employed by researchers, and the Resource-Constrained Project Scheduling Problem (RCPSP) as the most studied type of problem. On the other hand, the application of new solution techniques, and the possibility of incorporating traditional methods into new PSP variants was presented as research trends. Originality/value: This literature review contents not only a descriptive analysis of the published articles but also a statistical information section in order to examine the state of the research activity carried out in relation to the Project Scheduling Problem with non-deterministic activities duration.Peer Reviewe

    Models and Algorithms for the Optimisation of Replenishment, Production and Distribution Plans in Industrial Enterprises

    Full text link
    Tesis por compendio[ES] La optimización en las empresas manufactureras es especialmente importante, debido a las grandes inversiones que realizan, ya que a veces estas inversiones no obtienen el rendimiento esperado porque los márgenes de beneficio de los productos son muy ajustados. Por ello, las empresas tratan de maximizar el uso de los recursos productivos y financieros minimizando el tiempo perdido y, al mismo tiempo, mejorando los flujos de los procesos y satisfaciendo las necesidades del mercado. El proceso de planificación es una actividad crítica para las empresas. Esta tarea implica grandes retos debido a los cambios del mercado, las alteraciones en los procesos de producción dentro de la empresa y en la cadena de suministro, y los cambios en la legislación, entre otros. La planificación del aprovisionamiento, la producción y la distribución desempeña un papel fundamental en el rendimiento de las empresas manufactureras, ya que una planificación ineficaz de los proveedores, los procesos de producción y los sistemas de distribución contribuye a aumentar los costes de los productos, a alargar los plazos de entrega y a reducir los beneficios. La planificación eficaz es un proceso complejo que abarca una amplia gama de actividades para garantizar que los equipos, los materiales y los recursos humanos estén disponibles en el momento y el lugar adecuados. Motivados por la complejidad de la planificación en las empresas manufactureras, esta tesis estudia y desarrolla herramientas cuantitativas para ayudar a los planificadores en los procesos de la planificación del aprovisionamiento, producción y distribución. Desde esta perspectiva, se proponen modelos realistas y métodos eficientes para apoyar la toma de decisiones en las empresas industriales, principalmente en las pequeñas y medianas empresas (PYMES). Las aportaciones de esta tesis suponen un avance científico basado en una exhaustiva revisión bibliográfica sobre la planificación del aprovisionamiento, la producción y la distribución que ayuda a comprender los principales modelos y algoritmos utilizados para resolver estos planes, y pone en relieve las tendencias y las futuras direcciones de investigación. También proporciona un marco holístico para caracterizar los modelos y algoritmos centrándose en la planificación de la producción, la programación y la secuenciación. Esta tesis también propone una herramienta de apoyo a la decisión para seleccionar un algoritmo o método de solución para resolver problemas concretos de la planificación del aprovisionamiento, producción y distribución en función de su complejidad, lo que permite a los planificadores no duplicar esfuerzos de modelización o programación de técnicas de solución. Por último, se desarrollan nuevos modelos matemáticos y enfoques de solución de última generación, como los algoritmos matheurísticos, que combinan la programación matemática y las técnicas metaheurísticas. Los nuevos modelos y algoritmos comprenden mejoras en términos de rendimiento computacional, e incluyen características realistas de los problemas del mundo real a los que se enfrentan las empresas de fabricación. Los modelos matemáticos han sido validados con un caso de una importante empresa del sector de la automoción en España, lo que ha permitido evaluar la relevancia práctica de estos novedosos modelos utilizando instancias de gran tamaño, similares a las existentes en la empresa objeto de estudio. Además, los algoritmos matheurísticos han sido probados utilizando herramientas libres y de código abierto. Esto también contribuye a la práctica de la investigación operativa, y proporciona una visión de cómo desplegar estos métodos de solución y el tiempo de cálculo y rendimiento de la brecha que se puede obtener mediante el uso de software libre o de código abierto.[CA] L'optimització a les empreses manufactureres és especialment important, a causa de les grans inversions que realitzen, ja que de vegades aquestes inversions no obtenen el rendiment esperat perquè els marges de benefici dels productes són molt ajustats. Per això, les empreses intenten maximitzar l'ús dels recursos productius i financers minimitzant el temps perdut i, alhora, millorant els fluxos dels processos i satisfent les necessitats del mercat. El procés de planificació és una activitat crítica per a les empreses. Aquesta tasca implica grans reptes a causa dels canvis del mercat, les alteracions en els processos de producció dins de l'empresa i la cadena de subministrament, i els canvis en la legislació, entre altres. La planificació de l'aprovisionament, la producció i la distribució té un paper fonamental en el rendiment de les empreses manufactureres, ja que una planificació ineficaç dels proveïdors, els processos de producció i els sistemes de distribució contribueix a augmentar els costos dels productes, allargar els terminis de lliurament i reduir els beneficis. La planificació eficaç és un procés complex que abasta una àmplia gamma d'activitats per garantir que els equips, els materials i els recursos humans estiguen disponibles al moment i al lloc adequats. Motivats per la complexitat de la planificació a les empreses manufactureres, aquesta tesi estudia i desenvolupa eines quantitatives per ajudar als planificadors en els processos de la planificació de l'aprovisionament, producció i distribució. Des d'aquesta perspectiva, es proposen models realistes i mètodes eficients per donar suport a la presa de decisions a les empreses industrials, principalment a les petites i mitjanes empreses (PIMES). Les aportacions d'aquesta tesi suposen un avenç científic basat en una exhaustiva revisió bibliogràfica sobre la planificació de l'aprovisionament, la producció i la distribució que ajuda a comprendre els principals models i algorismes utilitzats per resoldre aquests plans, i posa de relleu les tendències i les futures direccions de recerca. També proporciona un marc holístic per caracteritzar els models i algorismes centrant-se en la planificació de la producció, la programació i la seqüenciació. Aquesta tesi també proposa una eina de suport a la decisió per seleccionar un algorisme o mètode de solució per resoldre problemes concrets de la planificació de l'aprovisionament, producció i distribució en funció de la seua complexitat, cosa que permet als planificadors no duplicar esforços de modelització o programació de tècniques de solució. Finalment, es desenvolupen nous models matemàtics i enfocaments de solució d'última generació, com ara els algoritmes matheurístics, que combinen la programació matemàtica i les tècniques metaheurístiques. Els nous models i algoritmes comprenen millores en termes de rendiment computacional, i inclouen característiques realistes dels problemes del món real a què s'enfronten les empreses de fabricació. Els models matemàtics han estat validats amb un cas d'una important empresa del sector de l'automoció a Espanya, cosa que ha permés avaluar la rellevància pràctica d'aquests nous models utilitzant instàncies grans, similars a les existents a l'empresa objecte d'estudi. A més, els algorismes matheurístics han estat provats utilitzant eines lliures i de codi obert. Això també contribueix a la pràctica de la investigació operativa, i proporciona una visió de com desplegar aquests mètodes de solució i el temps de càlcul i rendiment de la bretxa que es pot obtindre mitjançant l'ús de programari lliure o de codi obert.[EN] Optimisation in manufacturing companies is especially important, due to the large investments they make, as sometimes these investments do not obtain the expected return because the profit margins of products are very tight. Therefore, companies seek to maximise the use of productive and financial resources by minimising lost time and, at the same time, improving process flows while meeting market needs. The planning process is a critical activity for companies. This task involves great challenges due to market changes, alterations in production processes within the company and in the supply chain, and changes in legislation, among others. Planning of replenishment, production and distribution plays a critical role in the performance of manufacturing companies because ineffective planning of suppliers, production processes and distribution systems contributes to higher product costs, longer lead times and less profits. Effective planning is a complex process that encompasses a wide range of activities to ensure that equipment, materials and human resources are available in the right time and the right place. Motivated by the complexity of planning in manufacturing companies, this thesis studies and develops quantitative tools to help planners in the replenishment, production and delivery planning processes. From this perspective, realistic models and efficient methods are proposed to support decision making in industrial companies, mainly in small- and medium-sized enterprises (SMEs). The contributions of this thesis represent a scientific breakthrough based on a comprehensive literature review about replenishment, production and distribution planning that helps to understand the main models and algorithms used to solve these plans, and highlights trends and future research directions. It also provides a holistic framework to characterise models and algorithms by focusing on production planning, scheduling and sequencing. This thesis also proposes a decision support tool for selecting an algorithm or solution method to solve concrete replenishment, production and distribution planning problems according to their complexity, which allows planners to not duplicate efforts modelling or programming solution techniques. Finally, new state-of-the-art mathematical models and solution approaches are developed, such as matheuristic algorithms, which combine mathematical programming and metaheuristic techniques. The new models and algorithms comprise improvements in computational performance terms, and include realistic features of real-world problems faced by manufacturing companies. The mathematical models have been validated with a case of an important company in the automotive sector in Spain, which allowed to evaluate the practical relevance of these novel models using large instances, similarly to those existing in the company under study. In addition, the matheuristic algorithms have been tested using free and open-source tools. This also helps to contribute to the practice of operations research, and provides insight into how to deploy these solution methods and the computational time and gap performance that can be obtained by using free or open-source software.This work would not have been possible without the following funding sources: Conselleria de Educación, Investigación, Cultura y Deporte, Generalitat Valenciana for hiring predoctoral research staff with Grant (ACIF/2018/170) and the European Social Fund with the Grant Operational Programme of FSE 2014-2020. Conselleria de Educación, Investigación, Cultura y Deporte, Generalitat Valenciana for predoctoral contract students to stay in research centers outside the research centers outside the Valencian Community (BEFPI/2021/040) and the European Social Fund.Guzmán Ortiz, BE. (2022). Models and Algorithms for the Optimisation of Replenishment, Production and Distribution Plans in Industrial Enterprises [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/187461Compendi

    A MULTI-COMMODITY NETWORK FLOW APPROACH FOR SEQUENCING REFINED PRODUCTS IN PIPELINE SYSTEMS

    Get PDF
    In the oil industry, there is a special class of pipelines used for the transportation of refined products. The problem of sequencing the inputs to be pumped through this type of pipeline seeks to generate the optimal sequence of batches of products and their destination as well as the amount of product to be pumped such that the total operational cost of the system, or another operational objective, is optimized while satisfying the product demands according to the requirements set by the customers. This dissertation introduces a new modeling approach and proposes a solution methodology for this problem capable of dealing with the topology of all the scenarios reported in the literature so far. The system representation is based on a 1-0 multi commodity network flow formulation that models the dynamics of the system, including aspects such as conservation of product flow constraints at the depots, travel time of products from the refinery to their depot destination and what happens upstream and downstream the line whenever a product is being received at a given depot while another one is being injected into the line at the refinery. It is assumed that the products are already available at the refinery and their demand at each depot is deterministic and known beforehand. The model provides the sequence, the amounts, the destination and the trazability of the shipped batches of different products from their sources to their destinations during the entire horizon planning period while seeking the optimization of pumping and inventory holding costs satisfying the time window constraints. A survey for the available literature is presented. Given the problem structure, a decomposition based solution procedure is explored with the intention of exploiting the network structure using the network simplex method. A branch and bound algorithm that exploits the dynamics of the system assigning priorities for branching to a selected set of variables is proposed and its computational results for the solution, obtained via GAMS/CPLEX, of the formulation for random instances of the problem of different sizes are presented. Future research directions on this field are proposed

    Approximation of System Components for Pump Scheduling Optimisation

    Get PDF
    © 2015 The Authors. Published by Elsevier Ltd.The operation of pump systems in water distribution systems (WDS) is commonly the most expensive task for utilities with up to 70% of the operating cost of a pump system attributed to electricity consumption. Optimisation of pump scheduling could save 10-20% by improving efficiency or shifting consumption to periods with low tariffs. Due to the complexity of the optimal control problem, heuristic methods which cannot guarantee optimality are often applied. To facilitate the use of mathematical optimisation this paper investigates formulations of WDS components. We show that linear approximations outperform non-linear approximations, while maintaining comparable levels of accuracy

    Energy and Route Optimization of Moving Devices

    Get PDF
    This thesis highlights our efforts in energy and route optimization of moving devices. We have focused on three categories of such devices; industrial robots in a multi-robot environment, generic vehicles in a vehicle routing problem (VRP) context, automatedguided vehicles (AGVs) in a large-scale flexible manufacturing system (FMS). In the first category, the aim is to develop a non-intrusive energy optimization technique, based on a given set of paths and sequences of operations, such that the original cycle time is not exceeded. We develop an optimization procedure based on a mathematical programming model that aims to minimize the energy consumption and peak power. Our technique has several advantages. It is non-intrusive, i.e. it requires limited changes in the robot program and can be implemented easily. Moreover,it is model-free, in the sense that no particular, and perhaps secret, parameter or dynamic model is required. Furthermore, the optimization can be done offline, within seconds using a generic solver. Through careful experiments, we have shown that it is possible to reduce energy and peak-power up to about 30% and 50% respectively. The second category of moving devices comprises of generic vehicles in a VRP context. We have developed a hybrid optimization approach that integrates a distributed algorithm based on a gossip protocol with a column generation (CG) algorithm, which manages to solve the tested problems faster than the CG algorithm alone. The algorithm is developed for a VRP variation including time windows (VRPTW), which is meant to model the task of scheduling and routing of caregivers in the context of home healthcare routing and scheduling problems (HHRSPs). Moreover,the developed algorithm can easily be parallelized to further increase its efficiency. The last category deals with AGVs. The choice of AGVs was not arbitrary; by design, we decided to transfer our knowledge of energy optimization and routing algorithms to a class of moving devices in which both techniques are of interest. Initially, we improve an existing method of conflict-free AGV scheduling and routing, such that the new algorithm can manage larger problems. A heuristic version of the algorithm manages to solve the problem instances in a reasonable amount of time. Later, we develop strategies to reduce the energy consumption. The study is carried out using an AGV system installed at Volvo Cars. The results are promising; (1)the algorithm reduces performance measures such as makespan up to 50%, while reducing the total travelled distance of the vehicles about 14%, leading to an energy saving of roughly 14%, compared to the results obtained from the original traffic controller. (2) It is possible to reduce the cruise velocities such that more energy is saved, up to 20%, while the new makespan remains better than the original one

    Multi-objective biopharma capacity planning under uncertainty using a flexible genetic algorithm approach

    Get PDF
    This paper presents a flexible genetic algorithm optimisation approach for multi-objective biopharmaceutical planning problems under uncertainty. The optimisation approach combines a continuous-time heuristic model of a biopharmaceutical manufacturing process, a variable-length multi-objective genetic algorithm, and Graphics Processing Unit (GPU)-accelerated Monte Carlo simulation. The proposed approach accounts for constraints and features such as rolling product sequence-dependent changeovers, multiple intermediate demand due dates, product QC/QA release times, and pressure to meet uncertain product demand on time. An industrially-relevant case study is used to illustrate the functionality of the approach. The case study focused on optimisation of conflicting objectives, production throughput, and product inventory levels, for a multi-product biopharmaceutical facility over a 3-year period with uncertain product demand. The advantages of the multi-objective GA with the embedded Monte Carlo simulation were demonstrated by comparison with a deterministic GA tested with Monte Carlo simulation post-optimisation

    A Literature Review On Combining Heuristics and Exact Algorithms in Combinatorial Optimization

    Get PDF
    There are several approaches for solving hard optimization problems. Mathematical programming techniques such as (integer) linear programming-based methods and metaheuristic approaches are two extremely effective streams for combinatorial problems. Different research streams, more or less in isolation from one another, created these two. Only several years ago, many scholars noticed the advantages and enormous potential of building hybrids of combining mathematical programming methodologies and metaheuristics. In reality, many problems can be solved much better by exploiting synergies between these approaches than by “pure” classical algorithms. The key question is how to integrate mathematical programming methods and metaheuristics to achieve such benefits. This paper reviews existing techniques for such combinations and provides examples of using them for vehicle routing problems
    corecore