Abstract
Port wine stocks ameliorate during storage, facilitating product differentiation according to age. This induces a trade-off between immediate revenues and further maturation. Varying climate conditions in the limited supply region lead to stochastic purchase prices for wine grapes. Decision makers must integrate recurring purchasing, production, and issuance decisions. Because stocks from different age classes can be blended to create final products, the solution space increases exponentially in the number of age classes. We model the problem of managing port wine inventory as a Markov decision process, considering decay as an additional source of uncertainty. For small problems, we derive general management strategies from the long-run behavior of the optimal policy. Our solution approach for otherwise intractable large problems, therefore, first aggregates age classes to create a tractable problem representation. We then use machine learning to train tree-based decision rules that reproduce the optimal aggregated policy and the enclosed management strategies. The derived rules are scaled back to solve the original problem. Learning from the aggregated optimum outperforms benchmark rules by 21.4% in annual profits (while leaving a 2.8%-gap to an upper bound). For an industry case, we obtain a 17.4%-improvement over current practices. Our research provides distinct strategies for how producers can mitigate climate risks. The purchasing policy dynamically adapts to climate-dependent price fluctuations. Uncertainties are met with lower production of younger products, whereas strategic surpluses of older stocks ensure high production of older products. Moreover, a wide spread in the age classes used for blending reduces decay risk exposure.

Abstract
The textile industry is a complex and dynamic system where structured decision-making processes are essential for efficient supply chain management. In this context, mathematical programming models offer a powerful tool for modeling and optimizing the textile supply chain. This systematic review explores the application of mathematical programming models, including linear programming, nonlinear programming, stochastic programming, robust optimization, fuzzy programming, and multi-objective programming, in optimizing the textile supply chain. The review categorizes and analyzes 163 studies across the textile manufacturing stages, from fiber production to integrated supply chains. Key results reveal the utility of these models in solving a wide range of decision-making problems, such as blending fibers, production planning, scheduling orders, cutting patterns, transportation optimization, network design, and supplier selection, considering the challenges found in the textile sector. Analyzing those models, we point out that sustainability considerations, such as environmental and social aspects, remain underexplored and present significant opportunities for future research. In addition, this study emphasizes the importance of incorporating multi-objective approaches and addressing uncertainties in decision-making to advance sustainable and efficient textile supply chain management.

Abstract
The Vehicle Routing Problem with Synchronization (VRPSync) aims to minimise the total routing costs while considering synchronization requirements that must be fulfilled between tasks of different routes. These synchronization requirements are especially relevant when it is necessary to have tasks being performed by vehicles within given temporal offsets, a frequent requirement in applications where multiple vehicles, crews, materials, or other resources are involved in certain operations. Although several works in the literature have addressed this problem, mainly the deterministic version has been tackled so far. This paper presents a robust optimization approach for the VRPSync, taking into consideration the uncertainty in vehicle travel times between customers. This work builds on existing approaches in the literature to develop mathematical models for the Robust VRPSync, as well as a branch-and-cut algorithm to solve more difficult problem instances. A set of computational experiments is also devised and presented to obtain insights regarding key performance parameters of the mathematical models and the solution algorithm. The results suggest that solution strategies where certain standard problem constraints are only introduced if a candidate solution violates any of those constraints provide more consistent improvements than approaches that rely on tailor-made cutting planes, added through separation routines. Furthermore, the analysis of the Price of Robustness indicators shows that the adoption of robust solutions can have a significant increase in the total costs, however, this increase quickly plateaus as budgets of uncertainty increase.

Abstract
To get products delivered, clients and retailers agree on a delivery time window. We collaborated with an online retailer to develop a real-world application aimed at dynamically determining the delivery fee for each time window while ensuring the explainability of the pricing policy. This sequential decision-making problem arises as new customers continuously arrive. The objective is to maximize the final profit, given by the sum of baskets and delivery fees, discounted by the transportation and fleet costs. As multiple customers share the same delivery route, the costs are distributed among them, complicating the calculation of the marginal cost of each customer. Our study employs Genetic Programming (GP) to create explainable and easy-to-compute pricing policies to determine the delivery fees. These policies, expressed as mathematical formulas, rank price panels - combinations of time slots and corresponding fees - to identify optimal prices for each customer. The inputs to the GP algorithm capture the current state of the system, including factors such as capacity, customer location, and basket value. The resulting expressions offer operational managers a transparent pricing policy that allows them to maximize total profit. © 2025 Elsevier B.V., All rights reserved.

Abstract
The sustainable utilization of forest biomass for bioenergy production is increasingly challenged by the variability and unpredictability of raw material availability. These challenges are particularly critical in regions like Central Portugal, where seasonality, dispersed resources, and wildfire prevention policies disrupt procurement planning. This study investigates two flexibility strategies-dynamic network reconfiguration and operations postponement-as policy relevant tools to enhance resilience in forest-to-bioenergy supply chains. A novel mathematical model, the mobile Facility Location Problem with dynamic Operations Assignment (mFLP-dOA), is proposed and solved using a scalable matheuristic approach. Applying the model to a real case study, we demonstrate that incorporating temporary intermediate nodes and adaptable processing schedules can reduce costs by up to 17% while improving operational responsiveness and reducing non-productive machine time. The findings offer strategic insights for policymakers, biomass operators, and regional planners aiming to design more adaptive and cost-effective biomass supply systems, particularly under environmental risk scenarios such as summer operation bans. This work supports evidence-based planning and investment in flexible logistics infrastructure for cleaner and more resilient bioenergy supply chains.