Abstract
Sustainability and eco-efficiency have been researched in multiple scientific papers since the last years. However the literature is not so abundant when applying those concepts to industrial assembly processes. This paper presents an innovate methodology to optimize aerospace assembly processes. Authors propose the introduction of a new element, the eco-efficiency, along with the traditional criteria, cost and time, currently used for optimization. Using a large Aero-Structure as an industrial case of study, the methodology analyzes the eco-efficiency of an assembly process in connection with a Life Cycle Assessment (LCA) to compute the environmental impact. Results are shown in a dashboard along with the relevant Key Process Indicator (KPI) to help the engineers to select the best assembly process. © 2020, IFIP International Federation for Information Processing.

Abstract
Additive Manufacturing (AM) is one of the most trending production technologies, with a growing number of companies looking forward to implementing it in their processes. Producing through AM not only means that there are no supplier lead times needed to account for, but also enables production closer to the end customer, reducing then the delivery time. This is especially true for companies with a wide range of low and variable demand products. This paper proposes a mixed integer linear programming (MILP) model for the optimal design of supply chains facing the introduction of AM processes. In the addressed problem, the 3D printers allocation to distribution centers (DC), that will make or customize parts, and the Suppliers-DC-Customers connections for each product need to be defined. The model aims at minimizing the supply chain costs, exploring the trade-offs between safety stock and stockout costs, and between buying and 3D printing a part. The main relevant characteristics of this model are the introduction of stock service levels as decision variables and the use of a linearization of the cumulative distribution function to account for demand uncertainty. A real-world problem from a maintenance provider is solved, showing the applicability of the model. © 2019, IEOM Society International.

Abstract
In recent years, cognitive robots have started to find their way into manufacturing halls. However, the full potential of these robots can only be exploited through (a) an integration of the robots with the Manufacturing Execution System (MES), (b) a new and simpler way of programming based on robot skills, automated task planning, and knowledge modeling, and (c) enabling the robots to function in a shared human/robot workspace with the ability to handle unexpected situations. The STAMINA project has built a robotic system that meets these objectives for an automotive kitting application, which has also been tested, validated, and demonstrated in a relevant environment (TRL6). This paper describes the STAMINA robot system and the evaluation of this system on a series of realistic kitting tasks. The structure of the system, evaluation methodology, and experimental results, are presented along with the insights and experiences gained from this work.

Abstract
This study proposes a model for (re-)designing machine layouts in already existing facilities with a multi-period time planning horizon. The model can be applied in several situations and at different moments of a layout life cycle, for example to design the initial layout of an existing facility, or to make some specific and local reconfigurations. This dynamic multiobjective model minimizes costs (production, material handling and reconfiguration costs), maximizes adjacency between machines, minimizes unsuitability (to combine characteristics of the machines and of the existing locations), and can allow changes between periods on the product mix or on the machine layout requirements (e.g., required area). The performance of the model was tested with a case study based on a real first-tier supplier of the automotive industry, thus showing the practical potential of the proposed approach.

Abstract
In this paper, we explore the use of reference values (predictors) for the optimal objective function value of hard combinatorial optimization problems, instead of bounds, obtained by data mining techniques, and that may be used to assess the quality of heuristic solutions for the problem. With this purpose, we resort to the rectangular two-dimensional strip-packing problem (2D-SPP), which can be found in many industrial contexts. Mostly this problem is solved by heuristic methods, which provide good solutions. However, heuristic approaches do not guarantee optimality, and lower bounds are generally used to give information on the solution quality, in particular, the area lower bound. But this bound has a severe accuracy problem. Therefore, we propose a data mining-based framework capable of assessing the quality of heuristic solutions for the 2D-SPP. A regression model was fitted by comparing the strip height solutions obtained with the bottom-left-fill heuristic and 19 predictors provided by problem characteristics. Random forest was selected as the data mining technique with the best level of generalisation for the problem, and 30,000 problem instances were generated to represent different 2D-SPP variations found in real-world applications. Height predictions for new problem instances can be found in the regression model fitted. In the computational experimentation, we demonstrate that the data mining-based framework proposed is consistent, opening the doors for its application to finding predictions for other combinatorial optimisation problems, in particular, other cutting and packing problems. However, how to use a reference value instead of a bound, has still a large room for discussion and innovative ideas. Some directions for the use of reference values as a stopping criterion in search algorithms are also provided.

Abstract
Among the most complex problems in the field of 2-dimensional cutting & packing are irregular packing problems, in which items may have a more complex geometry. These problems are prominent in several areas, including, but not limited to, the textile, shipbuilding and leather industries. They consist in placing a set of items, whose geometry is often represented by simple polygons, into one or more containers such that there is no overlap between items and the utility rate of the container is maximized. In this work, the irregular strip packing problem, an irregular packing variant with a variable length container, is investigated. The placement space is reduced by adopting a rectangular grid and a full search is performed using preprocessed raster penetration maps to efficiently determine the new position of an item. Tests were performed using simple dotted board model cases and irregular strip packing benchmark instances. The comparison of our results with the state of the art solutions showed that the proposed algorithm is very competitive, achieving better or equal compaction in 9 out of 15 instances and improving the average density in 13 instances. Besides the contribution of the new best results, the proposed approach showed the advantage of adopting discrete placement, which can be potentially applied to other irregular packing problems.