Abstract

Abstract
Many companies face capacity limitations that impair them to satisfy potential demand. In this context, sales/marketing teams have to decide which demand segments the company should prioritize. In business -to-business contexts, it is common that this selection includes customers with and without a contract. On the operations side, the production teams are interested in finding the most efficient usage for the available capacity. However, decision-making approaches to face such a challenge are scarce. In this paper, we propose a scenario-based robust optimization model to support the sales and marketing teams to define the most profitable sales plan in a setting of limited capacity, to serve multiple customers that can be either non -contractual or operate under quantity-flexibility contracts. The proposed model integrates contract design, portfolio selection, and tactical production planning decisions. By employing our model, we are able to quantify how a product's inclusion in a contract relates not only to its own profitability but also to the profitability of the remaining products that might be offered to the customer using the same resources. Regarding the optimal flexibility level to offer to a customer, it is explained by the expected sales volume, the discount rate depending on the flexibility level, and the demand variability expectation. We expect this approach supports industrial companies in defining the mid-term sales plan and deciding on the conditions to offer to contract customers.

Abstract
This work formulates a mixed-integer linear programming (MILP) model and proposes a bi-objective multi-population biased random key genetic algorithm (mp-BRKGA) for the joint scheduling of quay cranes and speed adjustable vehicles in container terminals considering the dual-cycling strategy. Under such a strategy, a combination of loading and unloading containers are handled by a set of cranes (moved between ships and vehicles) and transported by a set of vehicles (transported between the quayside and the storage area). The problem consists of four components: crane scheduling, vehicle assignment, vehicle scheduling, and speed assignment both for empty and loaded journey legs. The results show that an approximated true Pareto front can be found by solving the proposed MILP model and that the mp-BRKGA finds uniformly distributed Pareto fronts, close to the true ones. Additionally, the results clearly demonstrate the advantages of considering speed adjustable vehicles since both the makespan and the energy consumption can be considerably reduced.

Abstract
Logistics chains are being increasingly developed due to several factors, among which the exponential growth of e-commerce. Cross-docking is a logistics strategy used by several companies from varied economic sectors, applied in warehouses and distribution centres. In this context, it is the objective of the CrossLog - Automatic Mixed-Palletizing for Crossdocking Logistics Centers Project, to investigate and study an automated and collaborative crossdocking system, capable of moving and managing the flow of products within the warehouse in the fastest and safest way. In its scope, this paper describes the modelling and simulation of a crossdocking system, with an integrated AS/RS, to analyse possible alternatives including not only the fast movement of products, but also its storage in case needed. Different scenarios were modelled and simulated, on the FlexSim software, and the obtained results for each one were critically analysed to draw conclusions on the best storage policy.

Abstract
This work addresses the flexible job shop scheduling problem with transportation (FJSPT), which can be seen as an extension of both the flexible job shop scheduling problem (FJSP) and the job shop scheduling problem with transportation (JSPT). Regarding the former case, the FJSPT additionally considers that the jobs need to be transported to the machines on which they are processed on, while in the latter, the specific machine processing each operation also needs to be decided. The FJSPT is NP-hard since it extends NP-hard problems. Good-quality solutions are efficiently found by an operation-based multistart biased random key genetic algorithm (BRKGA) coupled with greedy heuristics to select the machine processing each operation and the vehicles transporting the jobs to operations. The proposed approach outperforms state-of-the-art solution approaches since it finds very good quality solutions in a short time. Such solutions are optimal for most problem instances. In addition, the approach is robust, which is a very important characteristic in practical applications. Finally, due to its modular structure, the multistart BRKGA can be easily adapted to solve other similar scheduling problems, as shown in the computational experiments reported in this paper.

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.