In cellular manufacturing systems, minimization of the completion time has a great impact on the production time, material flow, and productivity. An effective scheduling is crucial to attaining the advantages of cellular manufacturing systems. This dissertation attempts to solve the Flowshop Manufacturing Cell (cellular flowshop) Scheduling Problem with Sequence Dependent Setup Times (FMCSP with SDSTs) considering two performance measures: the total flow time as a mono objective, and the makespan and total flow time combined as a bi-criteria scheduling problem. The proposed problem is known to be the NP-hard problem because of its complexity. Several metaheuristic algorithms based on Genetic Algorithm (GA), Simulated Annealing (SA), and Particle Swarm Optimization (PSO) are developed for scheduling part families as well as jobs within each part family for FMCSP with SDSTs to minimize the total flow time. A local search method based on SA combined with PSO (named as PSO-SA) is proposed to enhance the intensification and improve the quality of the solution obtained by pure PSO. The effectiveness and efficiency of the proposed metaheuristics are evaluated based on the Relative Percentage Deviation (RPD) from its lower bound, and the robustness. Results indicate PSO-SA is performed similar to best available algorithms for small and medium size test problems. Yet, there is a very small deviation from best results for large problems. A Multi-objective Particle Swarm Optimization (MPSO) and a Multi-objective Simulated Annealing (MOSA) Algorithm are further proposed to solve the bi-criteria optimization problem to minimize the total flow time and makespan simultaneously. An improved PSO is combined with Threshold Acceptance (TA) algorithm to improve effectiveness of the proposed MPSO (named as IMPSO-TA) for the convergence of the obtained Pareto Front. The proposed algorithms are evaluated using several Quality Indicators (QI) measures for multiobjective optimization problems. The proposed algorithms can generate approximated Pareto Fronts in a reasonable CPU time. The proposed IMPSO-SA outperforms MOSA algorithm in terms of CPU time and minimizing the objective functions. / October 2015

The group scheduling problem commonly arises in cellular manufacturing systems, where parts are grouped into part families. It is characterized by a sequencing task on two levels: on the one hand, a sequence of jobs within each part family has to be identified while, on the other hand, a family sequence has to be determined. In order to solve this NP-hard problem usually heuristic solution approaches are used. In this thesis different aspects of group scheduling are discussed and problem specific heuristics are developed to solve group scheduling problems efficiently. Thereby, particularly characteristic properties of flowshop group scheduling problems, such as the structure of a group schedule or missing operations, are identified and exploited. In a simulation study for job shop manufacturing cells several novel dispatching rules are analyzed. Furthermore, a comprehensive review of the existing group scheduling literature is presented, identifying fruitful directions for future research.

No description available.

Orientador: Antonio Batocchio / Dissertação (mestrado profissional) - Universidade Estadual de Campinas, Faculdade de Engenharia Mecanica / Made available in DSpace on 2018-08-11T07:20:48Z (GMT). No. of bitstreams: 1 Fagundes_RenatoAlexandre_M.pdf: 1173048 bytes, checksum: f9c42d8865a1d2718c308d673b82bd20 (MD5) Previous issue date: 2007 / Resumo: Este trabalho tem como objetivo a implementação de um processo cadenciador (ou puxador) na linha de produção de uma indústria fabricante de placas de circuito impresso rígidas, focando principalmente na implantação de um sistema cadenciador para que o fluxo de produção flua de uma maneira cadenciada e limpa para atender uma determinada família de produtos de placas de circuito impresso rígido (não metalizadas ¿simples face¿ e metalizadas ¿dupla face¿). A montagem da célula de produção para o estudo foi desenvolvida a partir da análise da técnica de mapeamento de fluxo estendido para se obter a melhor produtividade do sistema e atender as demandas do cliente final. A existência de algumas formas de variabilidades nos tempos takt, balanceamento de operadores, tempo para troca de modelos e dimensionamento do ciclo de máquinas foram estudadas e apresentadas buscando sempre uma otimização do fluxo contínuo dentro do processo cadenciador. Através das técnicas de mapeamento de fluxo de valor foi montado um mapa de estado atual e futuro o qual nos permite visualizar de uma maneira mais clara as correções propostas. Palavras chaves: Manufatura enxuta, Mapeamento de Fluxo de Valor, Tempo Takt, OBC / Abstract: This work has as objective the implementation of a pacemaker process in the line of production of an industry manufacturer of rigid printed circuit board, where the major is on the implantation of a pacemaker process allowing a production flow clean and smoth for one definitive product family of the printed circuit board (not metallized "single face" and metallized "double face"). The assembly of the cell of production for the study was developed from the analysis of the technique of Mapping Stream Value to get the best productivity of the system and to take care of the demands of the final customer. The existence of some forms of variabilities like : takt time, balancing of operators, time for exchange of models and sizing of the cycle of machines had been studied and presented searching always an optimization of the continuous flow inside of the pacemaker process. Through the techniques of Mapping Stream Value from the current state to future state was mounted which in allows them to visualize in a clear way of the corrections proposals. Key words- Lean Manufacturing, Value Stream Mapping, Takt Time, OBC / Mestrado / Planejamento e Gestão Estrategica da Manufatura / Mestre em Engenharia Mecânica

The objective of the cellular manufacturing is to simplify the management of the<p>manufacturing industries. In regrouping the production of different parts into clusters,<p>the management of the manufacturing is reduced to manage different small<p>entities. One of the most important problems in the cellular manufacturing is the<p>design of these entities called cells. These cells represent a cluster of machines that<p>can be dedicated to the production of one or several parts. The ideal design of a<p>cellular manufacturing is to make these cells totally independent from one another,<p>i.e. that each part is dedicated to only one cell (i.e. if it can be achieved completely<p>inside this cell). The reality is a little more complex. Once the cells are created,<p>there exists still some traffic between them. This traffic corresponds to a transfer of<p>a part between two machines belonging to different cells. The final objective is to<p>reduce this traffic between the cells (called inter-cellular traffic).<p>Different methods exist to produce these cells and dedicated them to parts. To<p>create independent cells, the choice can be done between different ways to produce<p>each part. Two interdependent problems must be solved:<p>• the allocation of each operation on a machine: each part is defined by one or<p>several sequences of operations and each of them can be achieved by a set of<p>machines. A final sequence of machines must be chosen to produce each part.<p>• the grouping of each machine in cells producing traffic inside and outside the<p>cells.<p>In function of the solution to the first problem, different clusters will be created to<p>minimise the inter-cellular traffic.<p>In this thesis, an original method based on the grouping genetic algorithm (Gga)<p>is proposed to solve simultaneously these two interdependent problems. The efficiency<p>of the method is highlighted compared to the methods based on two integrated algorithms<p>or heuristics. Indeed, to form these cells of machines with the allocation<p>of operations on the machines, the used methods permitting to solve large scale<p>problems are generally composed by two nested algorithms. The main one calls the<p>secondary one to complete the first part of the solution. The application domain goes<p>beyond the manufacturing industry and can for example be applied to the design of<p>the electronic systems as explained in the future research.<p> / Doctorat en Sciences de l'ingénieur / info:eu-repo/semantics/nonPublished

This thesis deals with the analysis of data obtained by observing and measuring workplaces of assembly lines with a focus on the efficiency of their utilization, through selected elements of industrial engineering, which the reader can get acquainted with in the theoretical part of the thesis. In this thesis the line productivity during the shifts is analyzed, an ideal line balancing condition is defined and suggestion for changing the time of line consumption norm according to the measured line cycle time is made. According to the complex analyzes of the workplaces, suggestions are concluded and an economic appreciation of these proposals is also elaborated. The author of this thesis finds the main benefit of this work in increasing of the productivity of the analyzed line in the case of implementation of solution designs.

No description available.

No description available.

No description available.

No description available.