Abstract
This paper proposes a multi-objective mixed-integer linear programming to model a cold chain with complementary operations on a hierarchical hub network. Central hubs are linked to each other in the first level of the network and to the star network of the lower-level hubs. As for a case study, different hub levels provide various refreshing or freezing operations to keep the perishable goods fresh along the network. Disruption is formulated by the consideration of stochastic demand and multi-level freshness time windows. Regarding the solution, a genetic algorithm is also developed and compared for competing the large-sized networks.

Abstract
In the current global market, managing supply is not a straightforward process and it becomes even more complex as uncertainty and disruptions occur. In order to mitigate their impact, the selection of suppliers of strategic items should have a more holistic view of the operations in the supply chain. We propose an integrated model for supplier selection, considering inventory management and inbound transportation. We approach this problem, incorporating stochastic demand and suppliers' imperfect quality. Imperfect quality triggers additional costs, including external failure and holding costs. Supply disruptions also affect the suppliers' lead time, resulting in delivery delays. We develop a methodology to address this challenge with simulation-optimisation. A genetic algorithm determines supplier selection decisions, while inventory decisions are computed analytically. Discrete-event simulation is used to evaluate the overall performance, as well as to update the lead time dynamically, according to the disruptions. Finally, sensitivity analysis providing managerial insights reveals that criteria in supplier selection should be given a different priority depending on the characteristics of the items, and the effectiveness of disruption mitigation strategies depends on the disruption characteristics.

Abstract
In this paper, the relevance of integrated planning concerning decisions of production and blending in a spinning industry is studied. The scenario regards a plant that produces several yarn packages over a planning horizon. Each yarn type is produced using a blend of several cotton bales that must contain attributes to ensure the quality of the produced yarns. Three approaches to managing production and blending are compared; the first deals with the solution to the production scheduling and blending problems in a single integrated model. The second approach hierarchically addresses these problems. The third procedure combines features from the integrated and hierarchical approaches. These approaches are applied to a real-world problem, and their respective performances are analyzed. The third approach proved to deal with lot sizing, scheduling and blending in the spinning industry more efficiently. Moreover, the results indicate the importance of coordinating production and blending decisions. © 2021 Brazilian Operations Research Society.

Abstract
The need of lockdown, due to COVID-19, led many manufacturing companies to accelerate the adoption of digital technologies. Manufacturing companies were strongly affected by workforce shortages associated with the spread of COVID-19 and the lockdown, as well by connectivity losses among business partners. Therefore, these companies are reviewing their strategies to increase productivity, mainly embracing digital manufacturing technologies. Here the adoption of digital technologies aims to improve efficiency and flexibility in their processes, also improving connectivity among business partners. This study investigates how collaborative academia-industry R&D cases accelerated the adoption of digital technologies by manufacturing companies, given the current COVID-19 pandemic situation. Based on multiple case studies, this article reports the challenges and the strategies of three ongoing collaborative industry-academia R&D projects developed during the COVID pandemic situation. The results are presented in four different perspectives derived from industry 4.0 readiness maturity models: interpersonal communication, personal competencies and skills, systems integration, and technological strategy. It highlights the importance of manufacturing companies to have a well-designed digitalization strategy, need of continuous training and development of their workforce, and the support of Research & Technology Organizations (RTO) to bring more maturity to the efforts required during a turbulent situation. The results of this paper can provide relevant decision support for manufacturing companies, and its stakeholders, in face of challenges of the actual pandemic and post-pandemic scenario.

Abstract
This work presents a taxonomic proposition that integrates six views of business process (BP), allowing the identification of different BP perspectives as well as their elements used in the BP modelling activity. A literature review (LR) was conducted to identify the theoretical elements of the BP construct. Based on the LR findings, a taxonomic proposition of BP is presented. Finally, interviews were conducted with practitioners to validate it. The taxonomy contributes to the systematisation of knowledge around the theoretical construct BP and offers the practitioner a broad spectrum of points of view for the analysis of a given BP.

Abstract
We study last-mile delivery with the option of crowd shipping, where a company makes use of occasional drivers to complement its vehicle's fleet in the activity of delivering products to its customers. We model it as a data-driven distributionally robust optimization approach to the capacitated vehicle routing problem. We assume the marginals of the defined uncertainty vector are known, but the joint distribution is difficult to estimate. The presence of customers and available occasional drivers can be random. We adopt a strategic planning perspective, where an optimal a priori solution is calculated before the uncertainty is revealed. Therefore, without the need for online resolution performance, we can experiment with exact solutions. Solving the problem defined above is challenging: not only the first-stage problem is already NP-Hard, but also the uncertainty and potentially the second-stage decisions are binary of high dimension, leading to non-convex optimization formulations that are complex to solve. We propose a branch-price-and-cut algorithm taking into consideration measures that exploit the intrinsic characteristics of our problem and reduce the complexity to solve it.