Energy-Efficient Technologies for High-Performance Manufacturing Industries

Ph.DDOCTOR OF PHILOSOPH

Methods for Optimal Microgrid Management

Abstract During the last years, the number of distributed generators has grown significantly and it is expected to become higher in the future. Several new technologies are being de-veloped for this type of generation (including microturbines, photovoltaic plants, wind turbines and electrical storage systems) and have to be integrated in the electrical grid. In this framework, active loads (i.e., shiftable demands like electrical vehicles, intelligent buildings, etc.) and storage systems are crucial to make more flexible and smart the dis-tribution system. This thesis deals with the development and application of system engi-neering methods to solve real-world problems within the specific framework of microgrid control and management. The typical kind of problems that is considered when dealing with the manage-ment and control of Microgrids is generally related to optimal scheduling of the flows of energy among the various components in the systems, within a limited area. The general objective is to schedule the energy consumptions to maximize the expected system utility under energy consumption and energy generation constraints. Three different issues related to microgrid management will be considered in detail in this thesis: 1. The problem of Nowcasting and Forecasting of the photovoltaic power production (PV). This problem has been approached by means of several data-driven techniques. 2. The integration of stations to charge electric vehicles in the smart grids. The impact of this integration on the grid processes and on the demand satisfaction costs have been analysed. In particular, two different models have been developed for the optimal integration of microgrids with renewable sources, smart buildings, and the electrical vehicles (EVs), taking into account two different technologies. The first model is based on a discrete-time representation of the dynamics of the system, whereas the second one adopts a discrete-event representation. 3. The problem of the energy optimization for a set of interconnencted buildings. In ths connection, an architecture, structured as a two-level control scheme has been developed. More precisely, an upper decision maker solves an optimization problem to minimize its own costs and power losses, and provides references (as 3 regars the power flows) to local controllers, associated to buildings. Then, lower level (local) controllers, on the basis of a more detailed representation of each specific subsystem (the building associated to the controller), have the objective of managing local storage systems and devices in order to follow the reference values (provided by the upper level), to contain costs, and to achieve comfort requirements

Energy aware hybrid flow shop scheduling

Only if humanity acts quickly and resolutely can we limit global warming' conclude more than 25,000 academics with the statement of SCIENTISTS FOR FUTURE. The concern about global warming and the extinction of species has steadily increased in recent years

Energy Efficient Policies, Scheduling, and Design for Sustainable Manufacturing Systems

Climate mitigation, more stringent regulations, rising energy costs, and sustainable manufacturing are pushing researchers to focus on energy efficiency, energy flexibility, and implementation of renewable energy sources in manufacturing systems. This thesis aims to analyze the main works proposed regarding these hot topics, and to fill the gaps in the literature. First, a detailed literature review is proposed. Works regarding energy efficiency in different manufacturing levels, in the assembly line, energy saving policies, and the implementation of renewable energy sources are analyzed. Then, trying to fill the gaps in the literature, different topics are analyzed more in depth. In the single machine context, a mathematical model aiming to align the manufacturing power required to a renewable energy supply in order to obtain the maximum profit is developed. The model is applied to a single work center powered by the electric grid and by a photovoltaic system; afterwards, energy storage is also added to the power system. Analyzing the job shop context, switch off policies implementing workload approach and scheduling considering variable speed of the machines and power constraints are proposed. The direct and indirect workloads of the machines are considered to support the switch on/off decisions. A simulation model is developed to test the proposed policies compared to others presented in the literature. Regarding the job shop scheduling, a fixed and variable power constraints are considered, assuming the minimization of the makespan as the objective function. Studying the factory level, a mathematical model to design a flow line considering the possibility of using switch-off policies is developed. The design model for production lines includes a targeted imbalance among the workstations to allow for defined idle time. Finally, the main findings, results, and the future directions and challenges are presented

Cost Factor Focused Scheduling and Sequencing: A Neoteric Literature Review

The hastily emergent concern from researchers in the application of scheduling and sequencing has urged the necessity for analysis of the latest research growth to construct a new outline. This paper focuses on the literature on cost minimization as a primary aim in scheduling problems represented with less significance as a whole in the past literature reviews. The purpose of this paper is to have an intensive study to clarify the development of cost-based scheduling and sequencing (CSS) by reviewing the work published over several parameters for improving the understanding in this field. Various parameters, such as scheduling models, algorithms, industries, journals, publishers, publication year, authors, countries, constraints, objectives, uncertainties, computational time, and programming languages and optimization software packages are considered. In this research, the literature review of CSS is done for thirteen years (2010-2022). Although CSS research originated in manufacturing, it has been observed that CSS research publications also addressed case studies based on health, transportation, railway, airport, steel, textile, education, ship, petrochemical, inspection, and construction projects. A detailed evaluation of the literature is followed by significant information found in the study, literature analysis, gaps identification, constraints of work done, and opportunities in future research for the researchers and experts from the industries in CSS

Optimization of Electric-Vehicle Charging: scheduling and planning problems

The progressive shift from traditional vehicles to Electric Vehicles (EVs ) is considered one of the key measures to achieve the objective of a significant reduction in the emission of pollutants, especially in urban areas. EVs will be widely used in a not-so-futuristic vision, and new technologies will be present for charging stations, batteries, and vehicles. The number of EVs and Charging Stations (CSs) is increased in the last years, but, unfortunately, wide usage of EVs may cause technical problems to the electrical grid (i.e., instability due to intermittent distributed loads), inefficiencies in the charging process (i.e., lower power capacity and longer recharging times), long queues and bad use of CSs. Moreover, it is necessary to plan the CSs installation over the territory, the schedule of vehicles, and the optimal use of CSs. This thesis focuses on applying optimization methods and approaches to energy systems in which EVs are present, with specific reference to planning and scheduling decision problems. In particular, in smart grids, energy production, and storage systems are usually scheduled by an Energy Management System (EMS) to minimize costs, power losses, and CO2 emissions while satisfying energy demands. When CSs are connected to a smart grid, EVs served by CSs represent an additional load to the power system to be satisfied, and an additional storage system in the case of vehicle-to-grid (V2G) technology is enabled. However, the load generated by EVs is deferrable. It can be thought of as a process in which machines (CSs) serve customers/products (EVs) based on release time, due date, deadline, and energy request, as happens in manufacturing systems. In this thesis, first, attention is focused on defining a discrete-time optimization problem in which fossil fuel production plants, storage systems, and renewables are considered to satisfy the grid's electrical load. The discrete-time formalization can use forecasting for renewables and loads without data elaboration. On the other side, many decision variables are present, making the optimization problem hard to solve through commercial optimization tools. For this reason, an alternative method for the optimal schedule of EVs characterized by a discrete event formalization is presented. This new approach can diminish the number of variables by considering the time intervals as variables themselves. Of course, the solution's optimality is not guaranteed since some assumptions are necessary. Moreover, the last chapter proposes a novel approach for the optimal location and line assignment for electric bus charging stations. In particular, the model provides the siting and sizing of some CSs to maintain a minimum service frequency over public transportation lines

Optimization Models and Approximate Algorithms for the Aerial Refueling Scheduling and Rescheduling Problems

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with release times and due date-to-deadline window. ARSP assumes that the jobs have different release times, due dates, and due date-to-deadline windows between the refueling due date and a deadline to return without refueling. The Aerial Refueling Rescheduling Problem (ARRP), on the other hand, can be defined as updating the existing AR schedule after being disrupted by job related events including the arrival of new aircrafts, departure of an existing aircrafts, and changes in aircraft priorities. ARRP is formulated as a multiobjective optimization problem by minimizing the total weighted tardiness (schedule quality) and schedule instability. Both ARSP and ARRP are formulated as mixed integer programming models. The objective function in ARSP is a piecewise tardiness cost that takes into account due date-to-deadline windows and job priorities. Since ARSP is NP-hard, four approximate algorithms are proposed to obtain solutions in reasonable computational times, namely (1) apparent piecewise tardiness cost with release time rule (APTCR), (2) simulated annealing starting from random solution (SArandom ), (3) SA improving the initial solution constructed by APTCR (SAAPTCR), and (4) Metaheuristic for Randomized Priority Search (MetaRaPS). Additionally, five regeneration and partial repair algorithms (MetaRE, BestINSERT, SEPRE, LSHIFT, and SHUFFLE) were developed for ARRP to update instantly the current schedule at the disruption time. The proposed heuristic algorithms are tested in terms of solution quality and CPU time through computational experiments with randomly generated data to represent AR operations and disruptions. Effectiveness of the scheduling and rescheduling algorithms are compared to optimal solutions for problems with up to 12 jobs and to each other for larger problems with up to 60 jobs. The results show that, APTCR is more likely to outperform SArandom especially when the problem size increases, although it has significantly worse performance than SA in terms of deviation from optimal solution for small size problems. Moreover CPU time performance of APTCR is significantly better than SA in both cases. MetaRaPS is more likely to outperform SAAPTCR in terms of average error from optimal solutions for both small and large size problems. Results for small size problems show that MetaRaPS algorithm is more robust compared to SAAPTCR. However, CPU time performance of SA is significantly better than MetaRaPS in both cases. ARRP experiments were conducted with various values of objective weighting factor for extended analysis. In the job arrival case, MetaRE and BestINSERT have significantly performed better than SEPRE in terms of average relative error for small size problems. In the case of job priority disruption, there is no significant difference between MetaRE, BestINSERT, and SHUFFLE algorithms. MetaRE has significantly performed better than LSHIFT to repair job departure disruptions and significantly superior to the BestINSERT algorithm in terms of both relative error and computational time for large size problems

A general framework integrating techniques for scheduling under uncertainty

Ces dernières années, de nombreux travaux de recherche ont porté sur la planification de tâches et l'ordonnancement sous incertitudes. Ce domaine de recherche comprend un large choix de modèles, techniques de résolution et systèmes, et il est difficile de les comparer car les terminologies existantes sont incomplètes. Nous avons cependant identifié des familles d'approches générales qui peuvent être utilisées pour structurer la littérature suivant trois axes perpendiculaires. Cette nouvelle structuration de l'état de l'art est basée sur la façon dont les décisions sont prises. De plus, nous proposons un modèle de génération et d'exécution pour ordonnancer sous incertitudes qui met en oeuvre ces trois familles d'approches. Ce modèle est un automate qui se développe lorsque l'ordonnancement courant n'est plus exécutable ou lorsque des conditions particulières sont vérifiées. Le troisième volet de cette thèse concerne l'étude expérimentale que nous avons menée. Au-dessus de ILOG Solver et Scheduler nous avons implémenté un prototype logiciel en C++, directement instancié de notre modèle de génération et d'exécution. Nous présentons de nouveaux problèmes d'ordonnancement probabilistes et une approche par satisfaction de contraintes combinée avec de la simulation pour les résoudre. ABSTRACT : For last years, a number of research investigations on task planning and scheduling under uncertainty have been conducted. This research domain comprises a large number of models, resolution techniques, and systems, and it is difficult to compare them since the existing terminologies are incomplete. However, we identified general families of approaches that can be used to structure the literature given three perpendicular axes. This new classification of the state of the art is based on the way decisions are taken. In addition, we propose a generation and execution model for scheduling under uncertainty that combines these three families of approaches. This model is an automaton that develops when the current schedule is no longer executable or when some particular conditions are met. The third part of this thesis concerns our experimental study. On top of ILOG Solver and Scheduler, we implemented a software prototype in C++ directly instantiated from our generation and execution model. We present new probabilistic scheduling problems and a constraintbased approach combined with simulation to solve some instances thereof