946 resultados para Production system design
Resumo:
Pós-graduação em Engenharia de Produção - FEG
Resumo:
The current competitive market requires companies to adapt so that they can meet the needs of customers in an agile manner and aimed at the lowest possible cost in their manufacture, be it a product or service. The Toyota Production System is aimed at higher profits through lean manufacturing practices with reduced spending, smaller lots and inventories, generated by market demand. The variety of products makes the setup of the equipment a critical point and it should be reduced as much as possible so it does not affect productivity. The rapid exchange of tools allows with few actions and a modification that time does not exceed one digit on your total time. In this study, a case study showed that only with standardization and use of cheap improvements made it possible to reduce setup time in bottle labeling machine by 98 minutes for a final time of approximately 10 minutes with little investment, demonstrating the feasibility the displayed and a monthly gain tool in bottles at approximately 120,000, generating a performance gain and budget of approximately R$ 94,000.00 per month
Resumo:
The pharmaceutical industry was consolidated in Brazil in the 1930s, and since then has become increasingly competitive. Therefore the implementation of the Toyota Production System, which aims to lean production, has become common among companies in the segment. The main efficiency indicator currently used is the Overall Equipment Effectiveness (OEE). This paper intends to, using the fuzzy model DEA-BCC, analyze the efficiency of the production lines of a pharmaceutical company in the Paraíba Valley, compare the values obtained by the model with those calculated by the OEE, identify the most sensitive machines to variation in the data input and develop a ranking of effectiveness between the consumer machinery. After the development, it is shown that the accuracy of the relationship between the two methods is approximately 57% and the line considered the most effective by the Toyota Production System is not the same as the one found by this paper
Resumo:
The current competitive market requires companies to adapt so that they can meet the needs of customers in an agile manner and aimed at the lowest possible cost in their manufacture, be it a product or service. The Toyota Production System is aimed at higher profits through lean manufacturing practices with reduced spending, smaller lots and inventories, generated by market demand. The variety of products makes the setup of the equipment a critical point and it should be reduced as much as possible so it does not affect productivity. The rapid exchange of tools allows with few actions and a modification that time does not exceed one digit on your total time. In this study, a case study showed that only with standardization and use of cheap improvements made it possible to reduce setup time in bottle labeling machine by 98 minutes for a final time of approximately 10 minutes with little investment, demonstrating the feasibility the displayed and a monthly gain tool in bottles at approximately 120,000, generating a performance gain and budget of approximately R$ 94,000.00 per month
Resumo:
The pharmaceutical industry was consolidated in Brazil in the 1930s, and since then has become increasingly competitive. Therefore the implementation of the Toyota Production System, which aims to lean production, has become common among companies in the segment. The main efficiency indicator currently used is the Overall Equipment Effectiveness (OEE). This paper intends to, using the fuzzy model DEA-BCC, analyze the efficiency of the production lines of a pharmaceutical company in the Paraíba Valley, compare the values obtained by the model with those calculated by the OEE, identify the most sensitive machines to variation in the data input and develop a ranking of effectiveness between the consumer machinery. After the development, it is shown that the accuracy of the relationship between the two methods is approximately 57% and the line considered the most effective by the Toyota Production System is not the same as the one found by this paper
Resumo:
Nitrogen management has been intensively studied on several crops and recently associated with variable rate on-the-go application based on crop sensors. Such studies are scarce for sugarcane and as a biofuel crop the energy input matters, seeking high positive energy balance production and low carbon emission on the whole production system. This article presents the procedure and shows the first results obtained using a nitrogen and biomass sensor (N-Sensor (TM) ALS, Yara International ASA) to indicate the nitrogen application demands of commercial sugarcane fields. Eight commercial fields from one sugar mill in the state of Sao Paulo, Brazil, varying from 15 to 25 ha in size, were monitored. Conditions varied from sandy to heavy soils and the previous harvesting occurred in May and October 2009, including first, second, and third ratoon stages. Each field was scanned with the sensor three times during the season (at 0.2, 0.4, and 0.6 m stem height), followed by tissue sampling for biomass and nitrogen uptake at ten spots inside the area, guided by the different values shown by the sensor. The results showed a high correlation between sensor values and sugarcane biomass and nitrogen uptake, thereby supporting the potential use of this technology to develop algorithms to manage variable rate application of nitrogen for sugarcane.
Resumo:
In this paper, we propose three novel mathematical models for the two-stage lot-sizing and scheduling problems present in many process industries. The problem shares a continuous or quasi-continuous production feature upstream and a discrete manufacturing feature downstream, which must be synchronized. Different time-based scale representations are discussed. The first formulation encompasses a discrete-time representation. The second one is a hybrid continuous-discrete model. The last formulation is based on a continuous-time model representation. Computational tests with state-of-the-art MIP solver show that the discrete-time representation provides better feasible solutions in short running time. On the other hand, the hybrid model achieves better solutions for longer computational times and was able to prove optimality more often. The continuous-type model is the most flexible of the three for incorporating additional operational requirements, at a cost of having the worst computational performance. Journal of the Operational Research Society (2012) 63, 1613-1630. doi:10.1057/jors.2011.159 published online 7 March 2012
Resumo:
Workplace accidents involving machines are relevant for their magnitude and their impacts on worker health. Despite consolidated critical statements, explanation centered on errors of operators remains predominant with industry professionals, hampering preventive measures and the improvement of production-system reliability. Several initiatives were adopted by enforcement agencies in partnership with universities to stimulate production and diffusion of analysis methodologies with a systemic approach. Starting from one accident case that occurred with a worker who operated a brake-clutch type mechanical press, the article explores cognitive aspects and the existence of traps in the operation of this machine. It deals with a large-sized press that, despite being endowed with a light curtain in areas of access to the pressing zone, did not meet legal requirements. The safety devices gave rise to an illusion of safety, permitting activation of the machine when a worker was still found within the operational zone. Preventive interventions must stimulate the tailoring of systems to the characteristics of workers, minimizing the creation of traps and encouraging safety policies and practices that replace judgments of behaviors that participate in accidents by analyses of reasons that lead workers to act in that manner.
Resumo:
[ES] El objetivo de este Trabajo es el de parametrizar, implementar las estructuras de datos y programar las aplicaciones necesarias que posibilitan el intercambio de información entre dos entornos software, SAP R/3 y Knapp, líderes en sus campos de actuación. El resultado de aplicar tales cambios permitirá a la organización no sólo centralizar la información en el ERP, sino que mejorará sus procesos de negocio y agilizará la toma de decisiones por parte de los responsables. Se realiza un estudio de la situación actual y, tras un análisis detallado, se propone una solución que permita alcanzar los objetivos propuestos. Una vez diseñada, presentada y aprobada la propuesta, se procede a la parametrización de SAP R/3, a la definición de los segmentos y tipos de IDOC y a la codificación de funciones y programas que permitan tratar la información enviada por Knapp. Finalizadas estas tareas, se elaboran juegos de datos de los procesos comerciales y se ejecutan en un entorno de test, en colaboración con los usuarios claves, para comprobar la bondad de la solución implementada. Se analizan los resultados y se corrigen posibles deficiencias. Finalmente se transporta al sistema productivo todos los cambios realizados y se verifica la correcta ejecución de los procesos de negocio de la organización.
Resumo:
Máster Oficial en Cultivos Marinos. Trabajo presentado como requisito parcial para la obtención del Título de Máster Oficial en Cultivos Marinos, otorgado por la Universidad de Las Palmas de Gran Canaria (ULPGC), el Instituto Canario de Ciencias Marinas (ICCM), y el Centro Internacional de Altos Estudios Agronómicos Mediterráneos de Zaragoza (CIHEAM)
Resumo:
Service Oriented Computing is a new programming paradigm for addressing distributed system design issues. Services are autonomous computational entities which can be dynamically discovered and composed in order to form more complex systems able to achieve different kinds of task. E-government, e-business and e-science are some examples of the IT areas where Service Oriented Computing will be exploited in the next years. At present, the most credited Service Oriented Computing technology is that of Web Services, whose specifications are enriched day by day by industrial consortia without following a precise and rigorous approach. This PhD thesis aims, on the one hand, at modelling Service Oriented Computing in a formal way in order to precisely define the main concepts it is based upon and, on the other hand, at defining a new approach, called bipolar approach, for addressing system design issues by synergically exploiting choreography and orchestration languages related by means of a mathematical relation called conformance. Choreography allows us to describe systems of services from a global view point whereas orchestration supplies a means for addressing such an issue from a local perspective. In this work we present SOCK, a process algebra based language inspired by the Web Service orchestration language WS-BPEL which catches the essentials of Service Oriented Computing. From the definition of SOCK we will able to define a general model for dealing with Service Oriented Computing where services and systems of services are related to the design of finite state automata and process algebra concurrent systems, respectively. Furthermore, we introduce a formal language for dealing with choreography. Such a language is equipped with a formal semantics and it forms, together with a subset of the SOCK calculus, the bipolar framework. Finally, we present JOLIE which is a Java implentation of a subset of the SOCK calculus and it is part of the bipolar framework we intend to promote.
Resumo:
Programa de doctorado: Ingeniería de Telecomunicación Avanzada.
Resumo:
Most actors of the Italian silent cinema in the early 1910s have a theatrical training. Some of them are already asserted or famous actors (like Cesare Dondini, Ermete Novelli, Ermete Zacconi, Giovanni Grasso) who are invited “to pose” for the cinema following their reputation, according to a strategy of an aesthetic and cultural legitimacy launched in 1909 by film d'art of the Pathé Consortium. I think it is the proverbial readiness and strength of the stage Italian actors that create a decisive contribution to the rapid development of the national cinema industry, despite its serious structural deficiencies, from the protoindustrialized phase (1909) to the golden age of divismo (starting in 1913), until the first signs of decadence (1919), and the so-called “fall” of the UCI production and distribution system. This is the main topic of the thesis: an investigation on the Italian stage actors engaged in the film industry (“from stage to screen” as the Italian title says, but in a “post-Vardac” approach) through many different sources: periodicals, memories, personal and business letters, and also contracts, found in several archive funds. A specific chapter is dedicated to the artistic career of Febo Mari (1881-1939), real name Alfredo Rodriguez, witch is a time-sample symptomatic of deep ties established between the growing film publishing and the Italian theatrical production system in the 1910s. The Mari debut in cinema and his ascent toward screen “divo” status coincides with the parable that leads from emergence to decadence of divismo in Italy.
Resumo:
The thesis deals with channel coding theory applied to upper layers in the protocol stack of a communication link and it is the outcome of four year research activity. A specific aspect of this activity has been the continuous interaction between the natural curiosity related to the academic blue-sky research and the system oriented design deriving from the collaboration with European industry in the framework of European funded research projects. In this dissertation, the classical channel coding techniques, that are traditionally applied at physical layer, find their application at upper layers where the encoding units (symbols) are packets of bits and not just single bits, thus explaining why such upper layer coding techniques are usually referred to as packet layer coding. The rationale behind the adoption of packet layer techniques is in that physical layer channel coding is a suitable countermeasure to cope with small-scale fading, while it is less efficient against large-scale fading. This is mainly due to the limitation of the time diversity inherent in the necessity of adopting a physical layer interleaver of a reasonable size so as to avoid increasing the modem complexity and the latency of all services. Packet layer techniques, thanks to the longer codeword duration (each codeword is composed of several packets of bits), have an intrinsic longer protection against long fading events. Furthermore, being they are implemented at upper layer, Packet layer techniques have the indisputable advantages of simpler implementations (very close to software implementation) and of a selective applicability to different services, thus enabling a better matching with the service requirements (e.g. latency constraints). Packet coding technique improvement has been largely recognized in the recent communication standards as a viable and efficient coding solution: Digital Video Broadcasting standards, like DVB-H, DVB-SH, and DVB-RCS mobile, and 3GPP standards (MBMS) employ packet coding techniques working at layers higher than the physical one. In this framework, the aim of the research work has been the study of the state-of-the-art coding techniques working at upper layer, the performance evaluation of these techniques in realistic propagation scenario, and the design of new coding schemes for upper layer applications. After a review of the most important packet layer codes, i.e. Reed Solomon, LDPC and Fountain codes, in the thesis focus our attention on the performance evaluation of ideal codes (i.e. Maximum Distance Separable codes) working at UL. In particular, we analyze the performance of UL-FEC techniques in Land Mobile Satellite channels. We derive an analytical framework which is a useful tool for system design allowing to foresee the performance of the upper layer decoder. We also analyze a system in which upper layer and physical layer codes work together, and we derive the optimal splitting of redundancy when a frequency non-selective slowly varying fading channel is taken into account. The whole analysis is supported and validated through computer simulation. In the last part of the dissertation, we propose LDPC Convolutional Codes (LDPCCC) as possible coding scheme for future UL-FEC application. Since one of the main drawbacks related to the adoption of packet layer codes is the large decoding latency, we introduce a latency-constrained decoder for LDPCCC (called windowed erasure decoder). We analyze the performance of the state-of-the-art LDPCCC when our decoder is adopted. Finally, we propose a design rule which allows to trade-off performance and latency.
Resumo:
This work presents exact, hybrid algorithms for mixed resource Allocation and Scheduling problems; in general terms, those consist into assigning over time finite capacity resources to a set of precedence connected activities. The proposed methods have broad applicability, but are mainly motivated by applications in the field of Embedded System Design. In particular, high-performance embedded computing recently witnessed the shift from single CPU platforms with application-specific accelerators to programmable Multi Processor Systems-on-Chip (MPSoCs). Those allow higher flexibility, real time performance and low energy consumption, but the programmer must be able to effectively exploit the platform parallelism. This raises interest in the development of algorithmic techniques to be embedded in CAD tools; in particular, given a specific application and platform, the objective if to perform optimal allocation of hardware resources and to compute an execution schedule. On this regard, since embedded systems tend to run the same set of applications for their entire lifetime, off-line, exact optimization approaches are particularly appealing. Quite surprisingly, the use of exact algorithms has not been well investigated so far; this is in part motivated by the complexity of integrated allocation and scheduling, setting tough challenges for ``pure'' combinatorial methods. The use of hybrid CP/OR approaches presents the opportunity to exploit mutual advantages of different methods, while compensating for their weaknesses. In this work, we consider in first instance an Allocation and Scheduling problem over the Cell BE processor by Sony, IBM and Toshiba; we propose three different solution methods, leveraging decomposition, cut generation and heuristic guided search. Next, we face Allocation and Scheduling of so-called Conditional Task Graphs, explicitly accounting for branches with outcome not known at design time; we extend the CP scheduling framework to effectively deal with the introduced stochastic elements. Finally, we address Allocation and Scheduling with uncertain, bounded execution times, via conflict based tree search; we introduce a simple and flexible time model to take into account duration variability and provide an efficient conflict detection method. The proposed approaches achieve good results on practical size problem, thus demonstrating the use of exact approaches for system design is feasible. Furthermore, the developed techniques bring significant contributions to combinatorial optimization methods.