Production lot sizing and scheduling with non-triangular sequence-dependent setup times

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Solving two production scheduling problems with sequence-dependent set-up times

In today’s competitive markets, the importance of goodscheduling strategies in manufacturing companies lead to theneed of developing efficient methods to solve complexscheduling problems.In this paper, we studied two production scheduling problemswith sequence-dependent setups times. The setup times areone of the most common complications in scheduling problems,and are usually associated with cleaning operations andchanging tools and shapes in machines.The first problem considered is a single-machine schedulingwith release dates, sequence-dependent setup times anddelivery times. The performance measure is the maximumlateness.The second problem is a job-shop scheduling problem withsequence-dependent setup times where the objective is tominimize the makespan.We present several priority dispatching rules for bothproblems, followed by a study of their performance. Finally,conclusions and directions of future research are presented.

A Cost Model for the Effect of Setup Time Reduction in Stainless Steel Strip Production

Setup time reduction facilitate the flexibility needed for just-in-time production. An integrated steel mill with meltshop, continuous caster and hot rolling mill is often operated as decoupled processes. Setup time reduction provides the flexibility needed to reduce buffering, shorten lead times and create an integrated process flow. The interdependency of setup times, process flexibility and integration were analysed through system dynamics simulation. The results showed significant reductions of energy consumption and tied capital. It was concluded that setup time reduction in the hot strip mill can aid process integration and hence improve production economy while reducing environmental impact.

Sequenciamento de lotes em prensas de alta capacidade com tempo de setup dependente da sequência

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Heuristic methods for the single machine scheduling problem with different ready times and a common due date

The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness penalties of the jobs. Since this problem is NP-hard, the application of constructive heuristics that exploit specific characteristics of the problem to improve their performance is investigated. The proposed approaches are examined through a computational comparative study on a set of 280 benchmark test problems with up to 1000 jobs.

Models for capacitated lot-sizing problem with backlogging, setup carryover and crossover

Setup operations are significant in some production environments. It is mandatory that their production plans consider some features, as setup state conservation across periods through setup carryover and crossover. The modelling of setup crossover allows more flexible decisions and is essential for problems with long setup times. This paper proposes two models for the capacitated lot-sizing problem with backlogging and setup carryover and crossover. The first is in line with other models from the literature, whereas the second considers a disaggregated setup variable, which tracks the starting and completion times of the setup operation. This innovative approach permits a more compact formulation. Computational results show that the proposed models have outperformed other state-of-the-art formulation.

Non-exponential return time distributions for vorticity extremes explained by fractional Poisson processes

Serial correlation of extreme midlatitude cyclones observed at the storm track exits is explained by deviations from a Poisson process. To model these deviations, we apply fractional Poisson processes (FPPs) to extreme midlatitude cyclones, which are defined by the 850 hPa relative vorticity of the ERA interim reanalysis during boreal winter (DJF) and summer (JJA) seasons. Extremes are defined by a 99% quantile threshold in the grid-point time series. In general, FPPs are based on long-term memory and lead to non-exponential return time distributions. The return times are described by a Weibull distribution to approximate the Mittag–Leffler function in the FPPs. The Weibull shape parameter yields a dispersion parameter that agrees with results found for midlatitude cyclones. The memory of the FPP, which is determined by detrended fluctuation analysis, provides an independent estimate for the shape parameter. Thus, the analysis exhibits a concise framework of the deviation from Poisson statistics (by a dispersion parameter), non-exponential return times and memory (correlation) on the basis of a single parameter. The results have potential implications for the predictability of extreme cyclones.

Comparison of Hydrologic and Hydraulic Characteristics of the Anacostia River to Non-Urban Coastal Streams

Streams in urban areas often utilize channelization and other bank erosion control measures to improve flood conveyance, reduce channel migration, and overbank flooding. This leads to reductions in evapotranspiration and sediment storage on floodplains. The purpose of this study is to quantify the evapotranspiration and sediment transport capacity in the Anacostia Watershed, a large Coastal Plain urban watershed, and to compare these processes to a similar sized non-urban watershed. Times series data of hydrologic and hydraulic changes in the Anacostia, as urbanization progressed between 1939-2014, were also analyzed. The data indicates lower values of warm season runoff in the non-urban stream, suggesting a shift from evapotranspiration to runoff in urban streams. Channelization in the Anacostia also increased flow velocities and decreased high flow width. The high velocities associated with channelization and the removal of floodplain storage sites allows for the continued downstream transport of sediment despite stream bank stabilization.

Lot production size problem and simulation of urban transport

OBJECTIVES AND STUDY METHOD: There are two subjects in this thesis: “Lot production size for a parallel machine scheduling problem with auxiliary equipment” and “Bus holding for a simulated traffic network”. Although these two themes seem unrelated, the main idea is the optimization of complex systems. The “Lot production size for a parallel machine scheduling problem with auxiliary equipment” deals with a manufacturing setting where sets of pieces form finished products. The aim is to maximize the profit of the finished products. Each piece may be processed in more than one mold. Molds must be mounted on machines with their corresponding installation setup times. The key point of our methodology is to solve the single period lot-sizing decisions for the finished products together with the piece-mold and the mold-machine assignments, relaxing the constraint that a single mold may not be used in two machines at the same time. For the “Bus holding for a simulated traffic network” we deal with One of the most annoying problems in urban bus operations is bus bunching, which happens when two or more buses arrive at a stop nose to tail. Bus bunching reflects an unreliable service that affects transit operations by increasing passenger-waiting times. This work proposes a linear mathematical programming model that establishes bus holding times at certain stops along a transit corridor to avoid bus bunching. Our approach needs real-time input, so we simulate a transit corridor and apply our mathematical model to the data generated. Thus, the inherent variability of a transit system is considered by the simulation, while the optimization model takes into account the key variables and constraints of the bus operation. CONTRIBUTIONS AND CONCLUSIONS: For the “Lot production size for a parallel machine scheduling problem with auxiliary equipment” the relaxation we propose able to find solutions more efficiently, moreover our experimental results show that most of the solutions verify that molds are non-overlapping even if they are installed on several machines. We propose an exact integer linear programming, a Relax&Fix heuristic, and a multistart greedy algorithm to solve this problem. Experimental results on instances based on real-world data show the efficiency of our approaches. The mathematical model and the algorithm for the lot production size problem, showed in this research, can be used for production planners to help in the scheduling of the manufacturing. For the “Bus holding for a simulated traffic network” most of the literature considers quadratic models that minimize passenger-waiting times, but they are harder to solve and therefore difficult to operate by real-time systems. On the other hand, our methodology reduces passenger-waiting times efficiently given our linear programming model, with the characteristic of applying control intervals just every 5 minutes.

Implementação ferramenta LEAN – TPM - serrote mecânico alternativo

Presentemente, com a economia cada vez mais globalizada e com a grande competitividade do mercado, as empresas de produção procuram cada vez mais ajustar-se às exigências dos clientes. Por esse motivo, o controlo do fluxo produtivo torna-se imprescindível para a resolução de problemas e para a própria melhoria contínua do processo. O sistema “Lean Manufacturing”, é um conjunto de atividades que tem como meta o aumento da capacidade de resposta às mudanças e à minimização dos desperdícios na produção, constituindo-se num verdadeiro empreendimento de gestão inovadora. O TPM – Total Productive Maintenance, é uma ferramenta de melhoria continua cada vez mais utilizada nas empresas com o objetivo de melhorar a eficiência dos seus equipamentos e atingir metas para a redução de desperdícios, incluindo a restauração e manutenção de condições padrão de funcionamento. O presente trabalho visa a implementação da ferramenta TPM num equipamento (Serrote Mecânico Alternativo) instalado no Laboratório das Oficinas Mecânicas do Instituto Superior de Engenharia do Porto. No contexto prático, este trabalho consistiu numa primeira fase por implementar a ferramenta 5S´s no posto de trabalho do equipamento em estudo. Durante esta implementação foi possível detetar algumas anomalias no equipamento, tendo sido sujeitas a uma análise para encontrar as suas causas raiz. Posteriormente foi implementada a ferramenta TPM, de modo, a criar melhores condições de acesso e simplificação das atividades de inspeção, lubrificação e limpeza. Além disso, foi executado e proposto algumas oportunidades de melhoria em alguns elementos, de forma a reduzir tempos de operação e tempos de setup, contribuindo para o aumento da eficiência do equipamento.

Estudo e análise do sequenciamento de tarefas de produção: job shop scheduling

Esta dissertação apresenta um estudo sobre os problemas de sequenciamento de tarefas de produção do tipo job shop scheduling. Os problemas de sequenciamento de tarefas de produção pretendem encontrar a melhor sequência para o processamento de uma lista de tarefas, o instante de início e término de cada tarefa e a afetação de máquinas para as tarefas. Entre estes, encontram-se os problemas com máquinas paralelas, os problemas job shop e flow shop. As medidas de desempenho mais comuns são o makespan (instante de término da execução de todas as tarefas), o tempo de fluxo total, a soma dos atrasos (tardiness), o atraso máximo, o número de tarefas que são completadas após a data limite, entre outros. Num problema do tipo job shop, as tarefas (jobs) consistem num conjunto de operações que têm de ser executadas numa máquina pré-determinada, obedecendo a um determinado sequenciamento com tempos pré-definidos. Estes ambientes permitem diferentes cenários de sequenciamento das tarefas. Normalmente, não são permitidas interrupções no processamento das tarefas (preemption) e pode ainda ser necessário considerar tempos de preparação dependentes da sequência (sequence dependent setup times) ou atribuir pesos (prioridades) diferentes em função da importância da tarefa ou do cliente. Pretende-se o estudo dos modelos matemáticos existentes para várias variantes dos problemas de sequenciamento de tarefas do tipo job shop e a comparação dos resultados das diversas medidas de desempenho da produção. Este trabalho contribui para demonstrar a importância que um bom sequenciamento da produção pode ter na sua eficiência e consequente impacto financeiro.

Melhoria de processos numa indústria têxtil através da aplicação do paradigma Lean

Dissertação de mestrado em Engenharia Industrial

Análise de tempos e métodos e implementação de ferramentas lean num sistema produtivo

Dissertação de mestrado em Engenharia Industrial

Sistema de controlo de processo e de organização numa empresa metalomecânica

Dissertação de mestrado em Engenharia Mecatrónica (área de especialização de Tecnologia de Manufatura)

Análise e simulação da produção de moldes para injeção de plásticos

Dissertação de mestrado em Engenharia Industrial