Gonçalo Reis Figueira

Abstract
Uncertainty is pervasive in modern manufacturing settings. In order to cope with unexpected events, scheduling decisions are commonly taken resorting to dispatching rules, which are reactive in nature. However, rule performance varies according to shop utilisation and due date allowance, which often change in dynamic real-world job shops. Therefore, this paper explores systems that select dispatching rules as conditions change over time, namely periodic and real-time dispatching rule selection systems, which are based on supervised learning and reinforcement learning algorithms, respectively. These types of systems have been proposed in the past but have been further improved in this work by carefully selecting the most relevant state features and dispatching rules. Moreover, by testing both approaches on the same instances, it was possible to compare them and determine the most advantageous one. After the tests, which included a wide array of job shop instances, both periodic and real-time systems outperformed state-of-the-art dispatching rules by over 10% tardiness-wise. Nonetheless, the periodic rule selection approach was more robust across all tests than the real-time approach. These results demonstrate that there is a real incentive for managers to adopt dispatching rule selection systems. © 2025 Elsevier B.V., All rights reserved.

Abstract
Lot-sizing and scheduling in a job shop environment is a fundamental problem that appears in many industrial settings. The problem is very complex, and solutions are often needed fast. Although many solution methods have been proposed, with increasingly better results, their computational times are not suitable for decision-makers who want solutions instantly. Therefore, we propose a novel greedy heuristic to efficiently generate production plans and schedules of good quality. The main innovation of our approach represents the incorporation of a simulation-based technique, which directly generates schedules while simultaneously determining lot sizes. By utilising priority rules, this unique feature enables us to address the complexity of job shop scheduling environments and ensures the feasibility of the resulting schedules. Using a selection of well-known rules from the literature, experiments on a variety of shop configurations and complexities showed that the proposed heuristic is able to obtain solutions with an average gap to Cplex of 4.12%. To further improve the proposed heuristic, a cooperative coevolutionary genetic programming-based hyper-heuristic has been developed. The average gap to Cplex was reduced up to 1.92%. These solutions are generated in a small fraction of a second, regardless of the size of the instance.

Abstract
Supplier selection for strategic items requires a comprehensive framework dealing with qualitative and quantitative aspects of a company's competitive priorities and supply risk, decision scope, and uncertainty. In order to address these aspects, this study aims to tackle supplier selection for strategic items with a multi-sourcing, taking into account multi-criteria, incorporating uncertainty of decision-makers judgment and supplier-buyer parameters, and integrating with inventory management which the past studies have not addressed well. We develop a novel two-phase solution approach based on integrated multi-criteria decision -making (MCDM) and multi-objective simulation-optimization (S-O). First, MCDM methods, including fuzzy AHP and interval TOPSIS, are applied to calculate suppliers' scores, incorporating uncertain decision makers' judgment. S-O then combines the (quantitative) cost-related criteria and considers supply disruptions and uncertain supplier-buyer parameters. By running this approach on data generated based on previous studies, we evaluate the impact of the decision maker's and the objective's weight, which are considered important in supplier selection.

Abstract
Optimising operations in bulk cargo ports is of great relevance due to their major participation in international trade. In inbound operations, which are critical to meet due dates, the product typically arrives by train and must be transferred to the stockyard. This process requires several machines and is subject to frequent disruptions leading to uncertain processing times. This work focuses on the scheduling problem of unloading the wagons to the stockyard, approaching both the deterministic and the stochastic versions. For the deterministic problem, we compare three solution approaches: a Mixed Integer Programming model, a Constraint Programming model and a Greedy Randomised algorithm. The selection rule of the latter is evolved by Genetic Programming. The stochastic version is tackled by dispatching rules, also evolved via Genetic Programming. The proposed approaches are validated using real data from a leading company in the mining sector. Results show that the new heuristic presents similar results to the company's algorithm in a considerably shorter computational time. Moreover, we perform extensive computational experiments to validate the methods on a wide spectrum of randomly generated instances. Finally, as managing uncertainty is fundamental for the effectiveness of these operations, distinct strategies are compared, ranging from purely predictive to completely reactive scheduling. We conclude that re-scheduling with high frequency is the best approach to avoid performance deterioration under schedule disruptions, and using the evolved dispatching rules incur fewer deviations from the original schedule.

Abstract
To encourage customers to take a chance in finding the right product, retailers and marketplaces implement benevolent return policies that allow users to return items for free without a specific reason. These policies contribute to a high rate of returns, which result in high shipping costs for the retailer and a high environmental toll on the planet. This paper shows that these negative impacts can be significantly minimized if inventory is exchanged within the supplier network of marketplaces upon a return. We compare the performance of this proposal to the standard policy where items are always sent to the original supplier. Our results show that our proposal-returning to a closer supplier and using a predictive heuristic for fulfilment-can achieve a 16% cost reduction compared to the standard-returning to the original supplier and using a myopic rule for fulfilment.