Análise e melhoria de processo de pintura e vulcanização na Continental

A indústria automóvel é um dos setores mais exigentes do mercado global, por este motivo empresas como a Continental Mabor S.A, líderes de mercado, necessitam estar na linha da frente no que toca a programas de melhoria contínua e de uma gestão orientada para um crescimento rentável e sustentado. Nesta perspetiva, este estudo de dissertação tem como objetivo encontrar uma solução para a gestão de stock e FiFo (First in First out) de pneus em verde na supracitada empresa, situada em Lousado, Vila Nova de Famalicão. Este projeto de dissertação iniciou-se com uma análise e diagnóstico do processo produtivo do pneu, entre a Construção e a Vulcanização. Nesta análise, foi possível identificar vários problemas, sendo o mais crítico associado à logística interna de transporte do pneu “em curso”, de fabrico entre as fases do mesmo, Construção e Vulcanização. Devido a condicionantes estruturais e de organização, a logística interna de transporte entre estes dois sectores enfrenta estrangulamentos nos fluxos, a falta de espaço para acomodar o material em curso, problemas organizacionais de controlo e monitorização do processo produtivo, dificuldades de regulação do fluxo e localização dos carros de transporte dos pneus em verde. Face aos problemas detetados ao longo do estudo, foram analisadas várias soluções para a resolução ou minimização dos mesmos. Entre as soluções propostas salientam-se: o alargamento do sistema de transporte por tapetes rolantes GTC (Green Tire Conveying) a todos os módulos de construção. Esta solução diminui o fluxo de carros para a área da construção, descongestionando a zona próxima do sistema de carregamento automático GTAL (Green Tire Automatic Loading) na vulcanização. A implementação dum sistema Wi-Fi RFID, que permite identificar e localizar artigos em curso utilizando etiquetas inteligentes numa rede wireless, conseguindo melhorar a programação de produção e o respetivo sequenciamento. Sabendo também que a Continental se encontra numa fase de expansão, designada Projeto Route 17/20, as soluções propostas tomaram em consideração essa nova realidade futura. Assim, foram estudados e propostos novos layouts para esse atual processo. Nestes novos layouts, procurou-se uma reorganização dos processos de fabrico, bem como um redimensionamento dos espaços de parqueamento de carros de pneus verdes adequado aos volumes produtivos. De igual forma, adequou-se os espaços físicos à possível implementação de um sistema de FiFo de pneus em verde na planta fabril, quando concluída a expansão. Este trabalho de dissertação apresenta como vantagens diretas da sua implementação: gerar a menor perturbação no atual método de trabalho seguido na empresa; previsivelmente aumentar a eficiência do processo produtivo; potenciar o crescimento tecnológico programado pela empresa; e oferecer uma boa relação custo/benefício no investimento necessário. Como apreciação final, pode-se concluir que este estudo foi finalizado com sucesso, visto que as soluções propostas foram apreciadas positivamente pela Administração da Continental Mabor S.A. e estão correntemente a ser avaliadas pelo grupo.

Modelo de otimização do espaço livre de armazenagem num silo de cereais

Este trabalho baseia-se num caso de estudo real de planeamento de operações de armazenagem num silo rural de cereais, e enquadra-se nos problemas de planeamento e programação de armazéns. Os programadores deparam-se diariamente com o problema de arranjar a melhor solução de transferência entre células de armazenagem, tentando maximizar o número de células vazias, por forma a ter maior capacidade para receber novos lotes, respeitando as restrições de receção e expedição, e as restrições de capacidade das linhas de transporte. Foi desenvolvido um modelo matemático de programação linear inteira mista e uma aplicação em Excel, com recurso ao VBA, para a sua implementação. Esta implementação abrangeu todo o processo relativo à atividade em causa, isto é, vai desde a recolha de dados, seu tratamento e análise, até à solução final de distribuição dos vários produtos pelas várias células. Os resultados obtidos mostram que o modelo otimiza o número de células vazias, tendo em conta os produtos que estão armazenados mais os que estão para ser rececionados e expedidos, em tempo computacional inferior a 60 segundos, constituindo, assim, uma importante mais valia para a empresa em causa.

Stochastic short-term maintenance scheduling of GENCOs in an oligopolistic electricity market

In the proposed model, the independent system operator (ISO) provides the opportunity for maintenance outage rescheduling of generating units before each short-term (ST) time interval. Long-term (LT) scheduling for 1 or 2 years in advance is essential for the ISO and the generation companies (GENCOs) to decide their LT strategies; however, it is not possible to be exactly followed and requires slight adjustments. The Cournot-Nash equilibrium is used to characterize the decision-making procedure of an individual GENCO for ST intervals considering the effective coordination with LT plans. Random inputs, such as parameters of the demand function of loads, hourly demand during the following ST time interval and the expected generation pattern of the rivals, are included as scenarios in the stochastic mixed integer program defined to model the payoff-maximizing objective of a GENCO. Scenario reduction algorithms are used to deal with the computational burden. Two reliability test systems were chosen to illustrate the effectiveness of the proposed model for the ST decision-making process for future planned outages from the point of view of a GENCO.

Static-priority scheduling of sporadic messages on a wireless channel

Consider the problem of scheduling sporadic messages with deadlines on a wireless channel. We propose a collision-free medium access control (MAC) protocol which implements static-priority scheduling and present a schedulability analysis technique for the protocol. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel.

From task scheduling in single processor environments to message scheduling in a PROFIBUS fieldbus network

In this paper we survey the most relevant results for the prioritybased schedulability analysis of real-time tasks, both for the fixed and dynamic priority assignment schemes. We give emphasis to the worst-case response time analysis in non-preemptive contexts, which is fundamental for the communication schedulability analysis. We define an architecture to support priority-based scheduling of messages at the application process level of a specific fieldbus communication network, the PROFIBUS. The proposed architecture improves the worst-case messages’ response time, overcoming the limitation of the first-come-first-served (FCFS) PROFIBUS queue implementations.

Scheduling IP traffic in multimedia-enabled PROFIBUS networks

Technological developments are pulling fieldbus networks to support a new wide class of applications, such as industrial multimedia applications. To enable its use in this kind of applications the TCP/IP suite of protocols can be integrated within a fieldbus stack, leading to a dual-stack approach that is briefly outlined in the paper. One important requirement that must be fulfilled by this approach is that the hard real-time guarantees provided to the control-related traffic ("native" fieldbus traffic) are kept. At the same time it must also provide the desired quality of service (QoS) to IP applications. The focus of the paper is on how, in such a dual-stack approach, QoS can be efficiently provided to IP applications requiring quasi-constant bandwidth.

Non pre-emptive scheduling of messages on SMTV token-passing networks

Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore, they constitute the foundation upon which real-time applications are to be implemented. A specific class of fieldbus communication networks is based on a simplified version of token-passing protocols, where each station may transfer, at most, a single message per token visit (SMTV). In this paper, we establish an analogy between non-preemptive task scheduling in single processors and the scheduling of messages on SMTV token-passing networks. Moreover, we clearly show that concepts such as blocking and interference in non-preemptive task scheduling have their counterparts in the scheduling of messages on SMTV token-passing networks. Based on this task/message scheduling analogy, we provide pre-run-time schedulability conditions for supporting real-time messages with SMTV token-passing networks. We provide both utilisation-based and response time tests to perform the pre-run-time schedulability analysis of real-time messages on SMTV token-passing networks, considering RM/DM (rate monotonic/deadline monotonic) and EDF (earliest deadline first) priority assignment schemes

Persisting problems related to race and ethnicity in public health and epidemiology research

A recent and comprehensive review of the use of race and ethnicity in research that address health disparities in epidemiology and public health is provided. First it is described the theoretical basis upon which race and ethnicity differ drawing from previous work in anthropology, social science and public health. Second, it is presented a review of 280 articles published in high impacts factor journals in regards to public health and epidemiology from 2009-2011. An analytical grid enabled the examination of conceptual, theoretical and methodological questions related to the use of both concepts. The majority of articles reviewed were grounded in a theoretical framework and provided interpretations from various models. However, key problems identified include a) a failure from researchers to differentiate between the concepts of race and ethnicity; b) an inappropriate use of racial categories to ascribe ethnicity; c) a lack of transparency in the methods used to assess both concepts; and d) failure to address limits associated with the construction of racial or ethnic taxonomies and their use. In conclusion, future studies examining health disparities should clearly establish the distinction between race and ethnicity, develop theoretically driven research and address specific questions about the relationships between race, ethnicity and health. One argue that one way to think about ethnicity, race and health is to dichotomize research into two sets of questions about the relationship between human diversity and health.

Professional and community satisfaction with the Brazilian family health strategy

OBJECTIVE: To analyze the strengths and limitations of the Family Health Strategy from the perspective of health care professionals and the community. METHODS: Between June-August 2009, in the city of Vespasiano, Minas Gerais State, Southeastern Brazil, a questionnaire was used to evaluate the Family Health Strategy (ESF) with 77 healthcare professionals and 293 caregivers of children under five. Health care professional training, community access to health care, communication with patients and delivery of health education and pediatric care were the main points of interest in the evaluation. Logistic regression analysis was used to obtain odds ratios and 95% confidence intervals as well as to assess the statistical significance of the variables studied. RESULTS: The majority of health care professionals reported their program training was insufficient in quantity, content and method of delivery. Caregivers and professionals identified similar weaknesses (services not accessible to the community, lack of healthcare professionals, poor training for professionals) and strengths (community health worker-patient communications, provision of educational information, and pediatric care). Recommendations for improvement included: more doctors and specialists, more and better training, and scheduling improvements. Caregiver satisfaction with the ESF was found to be related to perceived benefits such as community health agent household visits (OR 5.8, 95%CI 2.8;12.1), good professional-patient relationships (OR 4.8, 95%CI 2.5;9.3), and family-focused health (OR 4.1, 95%CI 1.6;10.2); and perceived problems such as lack of personnel (OR 0.3, 95%CI 0.2;0.6), difficulty with access (OR 0.2, 95%CI 0.1;0.4), and poor quality of care (OR 0.3, 95%CI 0.1;0.6). Overall, 62% of caregivers reported being generally satisfied with the ESF services. CONCLUSIONS: Identifying the limitations and strengths of the Family Health Strategy from the healthcare professional and caregiver perspective may serve to advance primary community healthcare in Brazil.

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Preemption delay analysis for floating non-preemptive region scheduling

In real-time systems, there are two distinct trends for scheduling task sets on unicore systems: non-preemptive and preemptive scheduling. Non-preemptive scheduling is obviously not subject to any preemption delay but its schedulability may be quite poor, whereas fully preemptive scheduling is subject to preemption delay, but benefits from a higher flexibility in the scheduling decisions. The time-delay involved by task preemptions is a major source of pessimism in the analysis of the task Worst-Case Execution Time (WCET) in real-time systems. Preemptive scheduling policies including non-preemptive regions are a hybrid solution between non-preemptive and fully preemptive scheduling paradigms, which enables to conjugate both world's benefits. In this paper, we exploit the connection between the progression of a task in its operations, and the knowledge of the preemption delays as a function of its progression. The pessimism in the preemption delay estimation is then reduced in comparison to state of the art methods, due to the increase in information available in the analysis.

Dynamic global scheduling of parallel real-time tasks

High-level parallel languages offer a simple way for application programmers to specify parallelism in a form that easily scales with problem size, leaving the scheduling of the tasks onto processors to be performed at runtime. Therefore, if the underlying system cannot efficiently execute those applications on the available cores, the benefits will be lost. In this paper, we consider how to schedule highly heterogenous parallel applications that require real-time performance guarantees on multicore processors. The paper proposes a novel scheduling approach that combines the global Earliest Deadline First (EDF) scheduler with a priority-aware work-stealing load balancing scheme, which enables parallel realtime tasks to be executed on more than one processor at a given time instant. Experimental results demonstrate the better scalability and lower scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound. A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected. We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions.

Online intra-task device scheduling for hard real-time systems

A large part of power dissipation in a system is generated by I/O devices. Increasingly these devices provide power saving mechanisms, inter alia to enhance battery life. While I/O device scheduling has been studied in the past for realtime systems, the use of energy resources by these scheduling algorithms may be improved. These approaches are crafted considering a very large overhead of device transitions. Technology enhancements have allowed the hardware vendors to reduce the device transition overhead and energy consumption. We propose an intra-task device scheduling algorithm for real time systems that allows to shut-down devices while ensuring system schedulability. Our results show an energy gain of up to 90% when compared to the techniques proposed in the state-of-the-art.

Opportunistic packet scheduling in body area networks

Significant research efforts are being devoted to Body Area Networks (BAN) due to their potential for revolutionizing healthcare practices. Energy-efficiency and communication reliability are critically important for these networks. In an experimental study with three different mote platforms, we show that changes in human body shadowing as well as those in the relative distance and orientation of nodes caused by the common human body movements can result in significant fluctuations in the received signal strength within a BAN. Furthermore, regular movements, such as walking, typically manifest in approximately periodic variations in signal strength. We present an algorithm that predicts the signal strength peaks and evaluate it on real-world data. We present the design of an opportunistic MAC protocol, named BANMAC, that takes advantage of the periodic fluctuations of the signal strength to achieve high reliability even with low transmission power.