Abstract
In an increasingly and globally competitive industry like the automotive sector, the continuous improvement of processes assumes a key role in the enhancement of effectiveness and efficiency. In line with this philosophy, the study undertaken of the work method and its inherent activities has pointed to time measurement as a gemba support tool of great potential in the optimization of the production process and the elimination of mudas. The present case study relates to the improvement of productivity of an assembly line dedicated to the manufacture of brake cables for the automotive industry. The application of the A3 methodology to this improvement project aims to monitor the evolution of key indicators as productivity per hour and the Overall Equipment Effectiveness (OEE) of the assembly line, to define the different improvement actions to be executed, and to achieve the defined target, and to validate the results of its implementation. The measurement of the different activities of the assembly line allowed to identify the major wastes (of material movements, operator movements, among others.) and to identify the most critical workstations that contribute for the unbalancing of the assembly line. The solutions implemented allowed to increase the productivity by 49% and, as a consequence, reduce the cycle time in 33%. The rearrangement and improvement of operations allowed also to increase the efficiency of the assembly line balancing in 11%. As the A3 methodology assumed a key role for this project, allowing the monitoring of the effectiveness of the different improvement actions implemented, it was standardized so that it could be applied to other improvement projects.

Abstract
Production scheduling is a function that can contribute strongly to the competitive capacity of companies producing goods and services. Failure to stagger tasks properly causes enormous waste of time and resources, with a clear decrease in productivity and high monetary losses. The efficient use of internal resources in organizations becomes a competitive advantage and can thus dictate their survival and sustainability. In that sense, it becomes crucial to analyze and develop production scheduling models, which can be simplified as the function of affecting tasks to means of production over time. This report is part of a project to develop a dynamic scheduling tool for decision support in a single machine environment. The system created has the ability, after a first solution has been generated, to trigger a new solution as some tasks leave the system and new ones arrive, allowing the user, at each instant of time, to determine new scheduling solutions, in order to minimize a certain measure of performance. The proposed tool was validated in an in-depth computational study with dynamic task releases and stochastic execution time. The results demonstrate the effectiveness of the model.

Abstract
Nowadays, companies are facing a constant need to develop and increase coordination between operational functions to respond rapidly and accurately to customer requests. Linked with this need, an increasing number of practitioners are resorting to an established and integrated business management methodology, the Sales and Operations Planning (S&OP). The concept of S&OP has gained increased recognition over the years by several authors and companies. This project describes the S&OP implementation in Sogrape Vinhos (wines) S.A., a Portuguese wine producer and distributer. The company was confronted with low accuracy in the establishing the forecast demand plans, especially on a long-term horizon. In order to increase the demand plans accuracy, the company started a S&OP implementation program. This paper describes the company's current planning process, explains the S&OP's implementation model presenting the selected parameters adequate to the company's context, and finally, evaluate the expected outcomes of this project. Preliminary results from the S&OP implementation project at Sogrape indicate significant savings at the operational level and greater effectiveness in developing the company's demand plans. (C) 2019 The Authors. Published by Elsevier Ltd.

Abstract
Companies that faces transport challenges and require logistics efficiency need to implement solutions based on automation, provided in Industry 4.0. Intelligent Logistics Management, satisfying the demanding requirements of the customer, using new technologies and advanced tools to control and to act along the supply chain are mandatory. To address this topic, this paper presents an application of an Automated Intelligent Vehicle.

Abstract
This project aimed to analyze the practical difficulties in storing and moving a high range of products making the process easier and more efficient. The objectives were to improve the use of available space in the raw materials warehouse and ensure the effectiveness, efficiency and reduction of the periods between the transportation from raw materials to production lines. The work developed focused on improving internal processes, storage practices and internal transportation. In fact, for the production flow to be continuous, the supply must be aligned with the production to ensure that there is no failure of materials.

Abstract
In this paper, we propose a branch-and-price approach for solving the problem of maximizing the expected number of transplants in Kidney Exchange Programs (KEPs). In these programs, the decision on which transplants will be conducted is usually made with the support of optimization models with the assumption that all operations will take place. However, after a plan of transplants is defined, a pair may leave the KEP or a more accurate compatibility evaluation exam may invalidate a transplant. To model these possible events we consider probabilities of failure of vertices and of arcs and the objective of maximizing the expected number of transplants. The proposed approach is based on the so-called cycle formulation, where decision variables are associated with cycles. Built on the concept of type of cycle a branch-and-price algorithm is conceived. One subproblem is defined for each type of cycle. We present computational results of the proposed branch-and-price algorithm and compare them with solving directly the cycle formulation (with a general purpose mixed integer programming solverCPLEX) showing that the proposed approach is the only one suitable for larger instances.