Abstract
We address the layout optimization problem of deciding the number, the location, and the operational space of a set of Airborne Wind Energy (AWE) units, which overall constitute an AWE farm. The layout optimization problem in conventional wind farms, with standard wind turbines, is a well-studied subject; however, in the case of AWE, there are several new characteristics and challenges. While in the case of conventional wind farms, the main concern is to guarantee a reduced aerodynamical wake effect from other units, in AWE the main concern is to avoid collision among units. The optimization problem addressed is the following: given a specific land dimension and local wind characteristics, we solve a bi-objective problem of maximizing power production while minimizing the number of units, by deciding the number of producing units, their locations, as well as their flight envelopes. The solution method uses a combination of metaheuristic methods, including elements from the Non-Dominated Sorting Genetic Algorithm-II (NSGA-II) and the Biased Random Key Genetic Algorithm (BRKGA). The results produce a custom Pareto set adapted to the wind local characteristics, allowing for a more accurate estimation of the key objectives, better estimate of the annual power output of the AWE farm, and make better-informed decisions regarding the optimal number of units to deploy in the farm.

Abstract
This paper addresses a job shop scheduling problem with peak power constraints, in which jobs can be processed once or multiple times on either all or a subset of the machines. The latter characteristic provides additional flexibility, nowadays present in many manufacturing systems. The problem is complicated by the need to determine both the operation sequence and starting time as well as the speed at which machines process each operation. Due to the adherence to renewable energy production and its intermittent nature, manufacturing companies need to adopt power-flexible production schedules. The proposed power control strategies, that is, adjusting processing speed and timing to reduce peak power requirements may impact production time (makespan) and energy consumption. Therefore, we propose a bi-objective approach that minimizes both objectives. A linear programming model is developed to provide a formal statement of the problem, which is solved to optimality for small-sized instances. We also proposed a multi-objective biased random key genetic algorithm framework that evolves several populations in parallel. Computational experiments provide decision and policymakers with insights into the implications of imposing or negotiating power consumption limits. Finally, the several trade-off solutions obtained show that as the power limit is lowered, the makespan increases at an increasing rate and a similar trend is observed in energy consumption but only for very small makespan values. Furthermore, peak power demand reductions of about 25% have a limited impact on the minimum makespan value (4-6% increase), while at the same time allowing for a small reduction in energy consumption.

Abstract
This work extends the energy-efficient job shop scheduling problem with transport resources by considering speed adjustable resources of two types, namely: the machines where the jobs are processed on and the vehicles that transport the jobs around the shop-floor. Therefore, the problem being considered involves determining, simultaneously, the processing speed of each production operation, the sequence of the production operations for each machine, the allocation of the transport tasks to vehicles, the travelling speed of each task for the empty and for the loaded legs, and the sequence of the transport tasks for each vehicle. Among the possible solutions, we are interested in those providing trade-offs between makespan and total energy consumption (Pareto solutions). To that end, we develop and solve a bi-objective mixed-integer linear programming model. In addition, due to problem complexity we also propose a multi-objective biased random key genetic algorithm that simultaneously evolves several populations. The computational experiments performed have show it to be effective and efficient, even in the presence of larger problem instances. Finally, we provide extensive time and energy trade-off analysis (Pareto front) to infer the advantages of considering speed adjustable machines and speed adjustable vehicles and provide general insights for the managers dealing with such a complex problem.

Abstract
This paper addresses the joint scheduling of production operations, transport tasks, and storage/retrieval activities in flexible job shop systems where the production operations and transport tasks can be done by one of the several resources available. Jobs need to be retrieved from storage and delivered to a load/unload area, from there, they are transported to and between the machines where their operations are processed on. Once all operations of a job are processed, the job is taken back to the load/unload area and then returned to the storage cell. Therefore, the problem under study requires, concurrently, solving job routing, machine scheduling, transport allocation, vehicle scheduling, and shuttle schedule. To this end, we propose a hybrid biased random-key genetic algorithm (BRKGA) in which the mutation operator resorts to six local search heuristics. The computational experiments conducted on a set of benchmark instances show the effectiveness of the proposed mutation operator.

Abstract
This article addresses the significant issue of job deterioration effects in job-shop scheduling problems and aims to create awareness on its impact within the manufacturing industry. While previous studies have explored deteriorating effects in various production configurations, research on scheduling problems in complex settings, particularly job-shop, is very limited. Thus, we address and optimize the impact of job deterioration in a generic job-shop scheduling problem (JSP). The JSP with job deterioration is harder than the classical JSP as the processing time of an operation is only known when the operation is started. Hence, we propose a biased random key genetic algorithm to find good quality solutions quickly. Through computational experiments, the effectiveness of the algorithm and its multi-population variant is demonstrated. Further, we investigate several deterioration functions, including linear, exponential, and sigmoid. Job deterioration increases operations' processing time, which leads to an increase in the total production time (makespan). Therefore, the management should not ignore deterioration effects as they may lead to a decrease in productivity, to an increase in production time, costs, and waste production, as well to a deterioration in the customer relations due to frequent disruptions and delays. Finally, the computational results reported clearly show that the proposed approach is capable of mitigating (almost nullifying) such impacts. © 2023 IEEE.