Problemas de corte e empacotamento de itens irregulares são problemas que visam determinar um leiaute ótimo de objetos pequenos dentro de objetos maiores, a fim de atender a uma demanda. Estes problemas têm grande importância prática, já que surgem em vários tipos de indústria (como a têxtil, a de móveis e a de calçados). O problema estudado neste trabalho é o problema de corte de itens irregulares em recipientes. Os recipientes são delimitados e o objetivo é encontrar um leiaute dos objetos menores, sem sobreposição, dentro dos objetos maiores utilizando a menor quantidade de recipientes. Propomos um novo método de resolução para o problema. Nosso método é um algoritmo que gerencia um conjunto de heurísticas, de baixo nível, específicas para a resolução do problema com recipientes retangulares e irregulares. Recipientes irregulares são polígonos convexos e não convexos, que podem ser furados. As heurísticas desenvolvidas utilizam uma malha de pontos sobre a técnica de no-fit polygon para evitar a sobreposição dos itens e encontrar posições viáveis no recipiente retangular ou irregular. Os experimentos computacionais foram feitos para um grande conjunto de instâncias, de recipientes retangulares e irregulares. Os resultados demonstram a competitividade do método, que obtêm resultados bons e algumas soluções ótimas, em um tempo computacional aceitável. / Cutting and packing of irregular items are problems that aim to determine the optimum layout of small objects within larger objects (that we call bins), in order to meet a demand. These problems have great practical importance, since they emerge in various types of industry (such as textile, furniture and shoemaking). The problem studied in this work is the irregular bin packing problem. The bins are enclosed and the goal is to find a layout of items, without overlap, within the bins by using the minimum quantity of them. We propose a new method of resolution to this problem. Our method is an algorithm that manages a set of low-level heuristics, specific to solve the problem with rectangular bins and irregular bins. Irregular bins are convex and non-convex polygons, which may contain holes. The developed heuristics uses a mesh of points and the technique of no-fit polygon to avoid the overlapping of items and find feasible positions in rectangular or irregular bins. The computational experiments were performed for a large set of instances, using both rectangular and irregular bins. The results demonstrate the competitiveness of the method, which can get good results and some optimal solutions within an acceptable computational time.

Scheduling in the context of manufacturing systems has become increasingly impor- tant in order for organizations to achieve success in dynamic and competitive scenarios. Scheduling can be described as allocation of available jobs over resources to meet the performance criteria defined in a domain. Our research work fo cuses on scheduling a given set of three-dimensional cylindrical items, each characterized by width wj , height hj, and depth dj , onto parallel non-identical rectangular heat treatment kilns, such that the capacities of the kilns is optimally used. The problem is strongly NP-hard as it generalizes the (one-dimensional) Bin Packing Problem (1BP), in which a set of n positive values wj has to be partitioned into the minimum number of subsets so that the total value in each subset does not exceed the bin capacity W. The problem has been formulated as a variant of the 3D-BPP by following the MILP approach, and we propose a weight optimization heuristic that produces solutions comparable to that of the LP problem, in addition to reducing the computational complexity. Finally, we also propose a Decomposition Algorithm (DA) and validate the perfor- mance effectiveness of our heuristic. The numerical analyses provides useful insights that influence the shop-floor decision making process.

Les travaux de thèse présentés s’intéressent à l’optimisation des activités d’un bloc opératoire. Ces activités concernent les interventions chirurgicales à planifier et les interventions de maintenance préventive sur les équipements dans les salles d’opération. Une solution est la synchronisation de ces activités lors de la construction du planning opératoire au niveau opératoire. Nous dissocions deux stratégies de programmation opératoire : programmation ouverte et programmation avec allocation préalable des plages horaires aux chirurgiens. Pour chacune des stratégies, nous considérons deux cas : le cas où l’heure de début d’une intervention de maintenance dans la salle est fixée, ladite intervention précédant l’affection des interventions chirurgicales dans les salles. Le second cas étant celui où l’heure de début de maintenance varie dans un intervalle entre une heure de début minimum et une heure de début maximum, avec l’intervention de maintenance placée a posteriori.Nous faisons plusieurs propositions de méthodes (exactes et approchées), y compris une méthode hybride, qui repose sur le couplage entre une métaheuristique et une heuristique. Les résultats obtenus sur des instances générées en concertation avec le monde hospitalier sont intéressants. / The presented dissertation is about the optimization of hospital systems, more precisely the optimization of the activities of an operation theatre. These activities showcase the surgical procedures to be planned and the preventive maintenance interventions on the equipment in the operating rooms. One solution is the synchronization of these activities during the construction of the operational planning at the operational level.We dissociate two operating programming strategies: Open Scheduling or Open programming and Block Scheduling or Programming with prior allocation of times to surgeons. For each strategy two cases are considered: the first case is where the time of beginning of a maintenance intervention in the room is fixed - this intervention preceding the affection of the surgical interventions in the rooms. The second case is where the maintenance start time varies in the interval between a minimum start time and a maximum start time, with the maintenance intervention placed beforehand. We make several proposition’s methods (exact and approximate), including a hybrid method, which is based on the coupling between a metaheuristic and a heuristic. The results obtained on bodies generated in consultation with the hospital’s world are interesting.

This thesis explores the integration of IoT protocols to enhance supply chain efficiency and sustainability by developing a flexible automated system. The research covers the integration of a palletization optimizer with a flexible robotic platform, a project conducted in collaboration with OpiFlex and Linköping University. Flexibility and sustainability in production, particularly in the food and beverage industry, are critical yet challenging to achieve. This research addresses these challenges by proposing a system that aligns the output with customer needs by combining these technologies. The research employs a combination of case study and exploratory methodologies. The development approach synthesizes elements from Set-Based Design, Point-Based Design, and Agile development frameworks. The primary research questions focus on identifying the best system architecture for integrating the palletization optimizer with a lower-level automation platform and outlining the steps needed to transform this integration into a commercially viable product. The system includes the optimizer, capable of processing customer orders and configuring products on mixed output pallets, integrated with a flexible robotic system provided by OpiFlex. The work involved evaluating communication protocols, MQTT, OPC UA, and TCP/IP, and designing robust interactions and interfaces between the subsystems. The results demonstrate the system's architecture and interaction protocols.  The thesis concludes with a discussion of the results in comparison to the application scenario and the standards consulted. The conclusion is that the chosen interface practices should remain largely intact but be re-developed using an OPC UA-based architecture. The main reasons for this are its support for both pub/sub and client-server models, increased security, and greater support for enterprise application integration. However, depending on the specific application, the downsides of OPC UA may outweigh its benefits.