2025
Authors
Fabio Couto; Mariana Curado Malta; António Lucas Soares;
Publication
IFIP advances in information and communication technology
Abstract
2025
Authors
Silva, J; Avila, P; Faria, L; Bastos, J; Ferreira, LP; Castro, H; Matias, J;
Publication
PRODUCTION ENGINEERING ARCHIVES
Abstract
Effective project management is crucial to the success of any industry, particularly in metalworking, where deadlines, resources, and costs play critical roles. However, accurately predicting project execution times remains a significant challenge, directly impacting companies' competitiveness and profitability. In this context, the integration of Artificial Intelligence (AI) tools emerges as a promising solution to improve the accuracy of time predictions and optimise project management in the metal-working industry.AI, particularly through techniques such as Machine Learning (ML), has demonstrated significant potential in predicting timeframes for engineering projects. Predictive activity-based models can be trained with historical data to identify patterns and forecast future durations with high accuracy. In the metalworking sector, where projects are often complex and subject to variability, AI can provide notable advantages in terms of precision and efficiency.This study aims to formulate an activity-based model, represented in IDEF0 (part of the Integration Definition for Function Modelling), for predicting activity durations using AI to support project management in the metalworking industry. By applying the principles of the IDEF0 tool, the objective is to develop a robust and adaptable system capable of analysing historical data, environmental factors, project characteristics, and other relevant inputs to produce more accurate time forecasts.With this work, we aim to contribute to the advancement of Project Management (PM) in the metal-working industry, particularly by providing an activity-based model to support the creation of an innovative AI tool for predicting execution times with greater accuracy.
2025
Authors
Mota, A; Ávila, P; Bastos, J; Roque, AC; Pires, A;
Publication
Procedia Computer Science
Abstract
This paper compares the performance of Simulated Annealing and Tabu Search meta-heuristics in addressing a parallel machine scheduling problem aimed at minimizing weighted earliness, tardiness, total flowtime, and machine deterioration costs-a multi-objective optimization problem. The problem is transformed into a single-objective problem using weighting and weighting relative distance methods. Four scenarios, varying in the number of jobs and machines, are created to evaluate these metaheuristics. Computational experiments indicate that Simulated Annealing consistently yields superior solutions compared to Tabu Search in scenarios with lower dimensions despite longer run times. Conversely, Tabu Search performs better in higher-dimensional scenarios. Furthermore, it is observed that solutions generated by different weighting methods exhibit similar performance. © 2025 The Author(s).
2025
Authors
Moço, H; Sousa, C; Ferreira, R; Pinto, P; Pereira, C; Diogo, R;
Publication
INNOVATIVE INTELLIGENT INDUSTRIAL PRODUCTION AND LOGISTICS, IN4PL 2024, PT II
Abstract
Since supply chains have become complex and tracking a product's journey, from raw materials to the end of it's life has become more difficult. Consumers are demanding greater transparency about the materials origins and environmental impact of the products they buy. These new requirements, togeher with European Commission Green Deal strategy, lead to the concept of digital product passport (DPP). DPP could be seen as an instrument to boost circularity, however the DPP architecture and governance model still undefined and unclear. Data Governance in the context of the DPP acts as the backbone for ensuring accurate and reliable data within these passports or data models, leading to flawless traceability. This article approaches the DPPs and it's governance challenges, explaining how they function as digital repositories for a product's life cycle information and the concept of Data Governance. By understanding how these two concepts work together, we will explore a short use case within the footwear industry to show how DPP governance architecture might work in a distributed environment.
2025
Authors
Monteiro, L; Simoes, AC; Baptista, AJ; Rebelo, R;
Publication
HUMAN-CENTRED TECHNOLOGY MANAGEMENT FOR A SUSTAINABLE FUTURE, VOL 2, IAMOT
Abstract
The footwear industry, a sub-sector of textile industrial sector, faces increased pressures towards higher levels of sustainability and circularity along all the value chain. Along the last decades, shoe products have become more complex products, integrating a greater number of components, materials diversity and often long supply-chains related to cost reduction and production or sourcing delocalization strategies. Full value-chain digitalization, as a cornerstone of Industry 4.0 paradigm, plays a key role for leveraging more sustainable and circular products, namely by traceability operationalization and forthcoming instruments such as Digital Product Passport. This research studied, via a state-of-art framing of the challenges followed by qualitative approach, how Industry 4.0 technologies can support the development of new services that contribute to sustainable and circular practices in footwear companies. An interview-based survey was conducted to 6 footwear companies, to map the adoption level of Industry 4.0 technologies and cross-linking to circular services business models.
2025
Authors
Baratto, M; Crama, Y; Pedroso, JP; Viana, A;
Publication
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Abstract
When each patient of a kidney exchange program has a preference ranking over its set of compatible donors, questions naturally arise surrounding the stability of the proposed exchanges. We extend recent work on stable exchanges by introducing and underlining the relevance of a new concept of locally stable, or L-stable, exchanges. We show that locally stable exchanges in a compatibility digraph are exactly the so-called local kernels (L-kernels) of an associated blocking digraph (whereas the stable exchanges are the kernels of the blocking digraph), and we prove that finding a nonempty L-kernel in an arbitrary digraph is NP-complete. Based on these insights, we propose several integer programming formulations for computing an L-stable exchange of maximum size. We conduct numerical experiments to assess the quality of our formulations and to compare the size of maximum L-stable exchanges with the size of maximum stable exchanges. It turns out that nonempty L-stable exchanges frequently exist in digraphs which do not have any stable exchange. All the above results and observations carry over when the concept of (locally) stable exchanges is extended to the concept of (locally) strongly stable exchanges.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.