Abstract
The widespread use of internet is changing the way supply chain echelons interact with each other in order to respond to increasing customer requests of personalized products and services. Companies acquainted with the concept of industry 4.0 (i4.0) embrace the use of internet to improve their internal and external processes, delivering the dynamic and flexible response customers want. This chapter aims to discuss how supply chains may benefit from the adoption of i4.0 technologies by their partners and highlights some of its implementation challenges. Eight technologies cover most of i4.0 applications: additive manufacturing; big data & analytics; cloud computing; cyber-physical systems; cyber security; internet of things; collaborative robotics; and visual computing. At individual level, technologies such as additive manufacturing, collaborative robots, visual computing and cyber-physical systems establish the connectivity of a certain company. However, the integration of the whole supply chain, based on the principles of i4.0, demands that information provided by each company (Big Data) is shared through a collaborative system based on Cloud Computing and Internet of Things technologies. To safely share useful information, Cyber Security techniques must be implemented in individual systems and cloud solutions. Summing up, even though the adoption of i4.0 demands an individual initiative, it will only raise the supply chain’s competitive advantage if all companies adapt their manufacturing and supply chain processes. The main advantage foreseen here is based on an improved communication system of the whole supply chain, bringing consumers closer to the production process. © 2018, Springer International Publishing AG, part of Springer Nature.

Abstract
This paper presents a new formulation for a time window assignment vehicle routing problem where time windows are defined for multiple product segments. This two-stage stochastic optimization problem is solved by means of a fix-and-optimize based matheuristic. The first stage assigns product dependent time windows while the second stage defines delivery schedules. Our approach outperforms a general-purpose solver and achieves an average cost decrease of 5.3% over expected value problem approaches. Furthermore, a sensitivity analysis on three operational models shows that it is possible to obtain significant savings compared to the solutions provided by a large European food retailer.

Abstract

Abstract
This paper investigates the performance of the largest Brazilian hydropower plants. This study covers 78% of the total installed capacity from hydros in the country, and considers indicators reflecting operational and maintenance costs as well as quality of service. The assessment was conducted using a new approach for the construction of composite indicators, based on a directional distance function model. First, we assessed the hydropower plants allowing for complete flexibility in the definition of weights, enabling the identification of underperforming plants, and quantification of their potential for improvement. Next, we assessed the plants considering different perspectives regarding the importance attributed to each indicator. This allowed reflecting different points of view, focusing primarily on operation and maintenance costs or quality issues. The results identify the hydropower plants that can be considered benchmarks in different scenarios, and allow testing the robustness of plants' classification as benchmarks in the unrestricted model.

Abstract
The implementation of efficient strategic decisions such as process design and capacity investment under uncertainty, during the product development process, is critical for the pharmaceutical industry. However, to tackle these problems the widely used multi-stage/scenario-based optimization formulations are still ineffective, especially for the first-stage (here-and-now) solutions where uncertainty has not yet been revealed. This study extends the authors' previous work addressing the stochastic product-launch planning problem, by developing a new Multi-Objective Integer Programming model, embedded in a unified decision-making framework, to obtain the final design strategy that "maximizes" productivity while considering the decision-maker preferences. An approximation of the efficient Pareto-front is determined, and a subsequent Pareto solutions analysis is made to guide the decision process. The developed approach clearly identifies the process designs and production capacities that "maximize" productivity as well as the most promising solutions region for investment. Moreover, a good balance between investment and capacity allocation was achieved.

Abstract
In a paper written by by Vanhoucke et al. (2016), an overview of artificial and empirical project databases has been given for integrated project management and control. These databases are collections of the most wellknown and widespread data instances available in literature for the construction of a baseline schedule, the analysis of schedule risk or the use for project control. The current paper serves as a follow-up study to further elaborate on the use of these data instances, and to give researchers an incentive to use these datasets for their research on the development and validation of new algorithms for project scheduling. Therefore, unlike the general focus of the previous paper on baseline scheduling, schedule risk analysis and project control, the focus on the current paper is restricted to resource-constrained project scheduling. The intention of this follow-up overview is fourfold. First and foremost, a procedure is proposed to facilitate the reporting of best known solutions for the well-known single- and multi-mode resource-constrained project scheduling problem to minimize the project makespan. Secondly, the paper reports our best known solutions we obtained so far, and reflects on the network and resource parameters that increase the project complexity. In doing so, areas to focus on for future research are detected, and an attempt to define hard problem instances is given. Thirdly, a new dataset is presented for the resource-constrained project scheduling problem that is much more diverse in both the network topology and resource scarceness and will enable the future researcher to develop algorithms to solve a wider range of project problems. Finally, the paper also adds some links to tutorials and other relevant information to stimulate researchers to download the data and update best known solutions once available.