Manuel Pereira Lopes

Abstract
This paper studies a real world dedicated parallel machine scheduling problem with sequence dependent setups, different machine release dates and additional resources (PMSR). To solve this problem, two previously proposed models have been adapted and a novel objective function, the minimisation of the sum of the machine completion times, is proposed to reflect the real conditions of the manufacturing environment that motivates this work. One model follows the strip-packing approach and the other is time-indexed. The solutions obtained show that the new objective function provides a compact production schedule that allows the simultaneous minimisation of machine idle times and setup times. In conclusion, this study provides valuable insights into the effectiveness of different models for solving PMSR problems in real-world contexts and gives directions for future research in this area using complementary approaches such as matheuristics.

Abstract
The problem of routing and scheduling of technicians is a problem that technical assistance and maintenance companies face nowadays, market competitiveness requires quick response, service diversification, and customer satisfaction. The relationship between competitiveness and profitability of companies involves the effective management of their resources. The work developed addresses a real problem of a major Portuguese company providing technical assistance to the home, a varied set of services (need for specific skills and execution times) must be scheduled for a set of technicians with heterogeneous skills and geographical locations (start and end of the route) based on their different places of residence. The results show a considerable increase in the efficiency levels of the solution obtained when compared to the company's current solution and reveals that the lack of homogeneity of skills among technicians and the variation in service flows are factors that should be considered in the operational management of resources and the contracting of work, and that the increase in working hours can also contribute to improving the efficiency of the process.

Abstract
Production scheduling generates a direct impact on several aspects of manufacture, such as the number of delays in delivery to customers, total flow time, as well as the percentage of equipment used. It must, therefore, constitute a priority in production management, which should seek to implement scheduling techniques that will lead to positive results from the perspective of the quality of the solution. However, the methodology cannot overlook the functional aspect of the time which has elapsed until the solution is reached. This study is based on a real and specific module software improvement into a company devoted to the development of ERP software systems (Enterprise Resource Planning). It presents a solution for the production scheduling module focused on flow-shop operations, comprising a total of nine dispatching rules. An additional solution for scheduling is also proposed, which resorts to metaheuristic simulated annealing. Both solutions are compared to each other by using the quality-functionality binomial approach. These two environments are further contrasted with a third, where no effective solution for production scheduling exists. The environment which includes scheduling through dispatching rules was compared to the environment where no production scheduling was implemented. The results obtained from this analysis show an improvement of 13%. The simulated annealing solution presents an improvement of 3,6% when compared to a solution which uses dispatching rules. This improvement implies one extra minute in the calculation of the final solution.

Abstract
This work addresses a case study in an intercontinental supply chain. The problem emerges in a company in Angola dedicated to the trade of consumable goods for construction building and industrial maintenance. The company in Angola sends the replenishment needs to a Portuguese company, which takes the decision of which products and in which quantities will be sent by shipping container to the company in Angola. The replenishment needs include the list of products that reached the corresponding reorder point. The decision of which products and in which quantity should take into consideration a set of practical constraints: the maximum weight of the cargo, the maximum volume the cargo and financial constraints related with the minimum value that guarantees the profitability of the business and a maximum value associated with shipping insurance. A 2-stage hybrid method is proposed. In the first stage, an integer linear programming model is used to select the products that maximise the sales potential. In the second stage, a Container Loading Algorithm is used to effectively pack the selected products in the shipping container ensuring the geometrical constraints, and safety constraints such as weight limit and stability. A new set of problem instances was generated with the 2DCPackGen problem generator, using as inputs the data collected in the company. Computational results for the algorithm are presented and discussed. Good results were obtained with the solution approach proposed, with an average occupation ratio of 92% of the container and an average gap of 4% for the solution of the integer linear programming model.

Abstract
The Container Loading Problem (CLP) literature has traditionally guaranteed cargo static stability by imposing the full support constraint for the base of the box. Used as a proxy for real-world static stability, this constraint excessively restricts the container space utilization and has conditioned the algorithms developed for this problem. In this paper we propose a container loading algorithm with static stability constraints based on the static mechanical equilibrium conditions applied to rigid bodies, which derive from Newton's laws of motion. The algorithm is a multi-population biased random-key genetic algorithm, with a new placement procedure that uses the maximal-spaces representation to manage empty spaces, and a layer building strategy to fill the maximal-spaces. The new static stability criterion is embedded in the placement procedure and in the evaluation function of the algorithm. The new algorithm is extensively tested on well-known literature benchmark instances using three variants: no stability constraint, the classical full base support constraint and with the new static stability constraint a comparison is then made with the state-of-the-art algorithms for the CLP. The computational experiments show that by using the new stability criterion it is always possible to achieve a higher percentage of space utilization than with the classical full base support constraint, for all classes of problems, while still guaranteeing static stability. Moreover, for highly heterogeneous cargo the new algorithm with full base support constraint outperforms the other literature approaches, improving the best solutions known for these classes of problems.