Vaccines are typically produced in large facilities to take advantage of economies of scale. However disease outbreaks are often local in nature and require flexible, small-scale production, especially in regions with poor infrastructure. In this work, mobile on-demand vaccine production is explored as a solution to future outbreaks. An mRNA vaccine process is scaled down to the size of two 20-foot shipping containers, so that 10,000 vaccine doses can be produced in one batch in less than 16 hours. The container is self-sufficient except for the regular resupply of water and electricity being able to produce 100 batches without resupply raw materials and consumables. The final cost per dose is estimated to be 25 e with a likely range between 4 to 45 e depending on dose size, raw material prices, and other underlying assumptions. The practicality of a container-based facility at the presented scale is demonstrated by two case studies.

Currently, state-of-the-art approaches to solving complex optimization problems have focused solely on methods requiring high computational time and unable to find the global optimal solution. In this work, a methodology based on quantum computing is presented to overcome these drawbacks. The novelty of this framework stems from the quantum computer’s architecture and taking into consideration the quantum phenomena that take place to solve optimization problems with specific structure. The proposed methodology includes steps for the transformation of the initial optimization problem into an unconstrainted optimization problem with binary variables and its embedding onto a quantum device. Moreover, different resolution levels for the transformation step and different architectures for the embedding process are utilized. To illustrate the procedure, a case study based on Haverly’s pooling and blending problem is examined while demonstrating the potential of the proposed approach. The res... [more]

To address the dynamic operational demands of the gas processing sector, which is continuously evolving due to gas market opening, increase in natural gas production, and the growing challenge of upstream-midstream integration in a competitive environment, this work presents the Integrated-Gas-Scheduling-System, IntegraGAS. The proposed methodology innovates by using first principles rigorous process simulation coupled with a scheduling tool for short/medium/long-term, enabling gas plants to swiftly adapt to varying operational conditions and meet the requirements of this new market. IntegraGAS was implemented in Petrobras and has significantly enhanced scheduling efficiency, reducing execution time by up to 99.2% and avoiding approx. US$ 2.3 million in annual labor costs, optimizing resource utilization. By integrating Excel for the frontend, Aspen HYSYS for process simulation, VBA for automation, and Microsoft PowerBI for real-time data visualization, IntegraGAS improves decision-mak... [more]

The unit commitment problem determines the optimal strategy to meet the electricity demand at minimum cost by committing power generation units at each point of time. Solving the unit commitment problem gives rise to a challenging optimization problem due to its combinatorial complexity and potentially long solution time requirements. Our proposed solution approach utilizes a decomposition method in conjunction with alternative models from the EGRET library. Results of this decomposition approach tested against four benchmarking systems show that significant computational speed ups are achieved.

With increasing emphasis on energy efficiency, more researchers are focusing on energy-efficient flexible job shop scheduling problems. Mathematical programming is a commonly used optimization method for such scheduling challenges, offering the advantages of achieving global optima and serving as a foundation for other approaches. However, current mathematical programming formulations face several challenges, including insufficient consideration of various forms of energy consumption and low efficiency, particularly in handling large-scale instances, which struggle to converge. In this study, we propose a novel global sequence-based approach with high computational efficiency. In this model, immediate precedence relationships are identified using constraints, enabling the precise determination of idle durations within any idle slots. The proposed formulation achieves a significant reduction in energy consumption by up to 20% relative to other formulations. Furthermore, it successfully... [more]

This study focuses on optimizing production scheduling in multi-product plants with shared resources and costly changeover operations. Specifically, two main challenges are addressed, the unknown changeover behavior of new products and the need for rapid schedule generation after unforeseen events. An innovative framework integrating Machine Learning (ML) techniques with Mixed-Integer Linear Programming (MILP) is proposed for single-stage production processes. Initially, a regression model predicts unknown changeover times based on key product attributes. Then, a representation where distances correlate with changeover times is compiled through multidimensional scaling, allowing constrained clustering to group production orders according to available packing lines. Ultimately, the MILP model generates the production schedule within a constrained solution space, utilizing optimal product-to-line allocation from cluster segmentation. A case study inspired by a Greek construction material... [more]

Scheduling and optimization have a central place in the research area of computing because it is increasingly important to achieve fully automated production processes to adjust manufacturing systems to the requirements of Industry 4.0. In this paper, we demonstrate how an automated wet-etch scheduling problem for the semiconductor industry can be solved by constraint answer set programming (CASP) and its solver called clingcon. A successful solution to this problem is achieved, and we found that for all tested problems, CASP is faster and obtains smaller makespan values for seven of the eight problems tested than the solutions based on mixed integer linear programming and constraint paradigms. The considered scheduling problem includes a robot for lot transfers between baths. CASP is a hybrid approach in automated reasoning that combines different research areas such as answer set programming, constraint processing, and Satisfiability Modulo Theories. For a long time, exact methods su... [more]

The hot rolled strip is a basic industrial product whose surface quality is of utmost importance. The condition of hot rolling work rolls that have been worn for a long time is the key factor. However, the traditional scheduling method controls risks to the surface quality by setting fixed rolling length limits and penalty scores, ignoring the wear condition differences caused by various products. This paper addresses this limitation by reconstructing a hot rolling-scheduling model, after developing a model for pre-assessment of the risk to surface quality based on the Weibull failure function, the deformation resistance formula, and real production data from a rolling plant. Additionally, Ant Colony Optimization (referred to as ACO) is employed to implement the scheduling model. The simulation results of the experiments demonstrate that, compared to the original scheduling method, the proposed one significantly reduces the cumulative risk of surface defects on products. This highlight... [more]

In today’s world, a situational awareness of sustainability is becoming increasingly important. Leaving a better world for future generations is becoming the main interest of many studies. It also puts pressure on managers to change production methods in most industries. Reducing carbon emissions in industry today is crucial to saving our planet. Theoretical research and practical industry requirements diverge, even though numerous researchers have tackled various strategies to handle carbon emission problems. Therefore, this work considers the carbon emission problem of the furniture manufacturing industry in Hosur, Tamilnadu, India. The case study company has a manufacturing system that resembles a hybrid flow shop (HFS) environment. As the HFS scheduling problems are NP-hard in nature, exact solution techniques could not be used to solve the problems. Hence, a sequential hybrid optimization algorithm (SHOA) has been developed in this paper to minimize the carbon footprint. In the SH... [more]

In this paper, we address a two-stage hybrid flowshop scheduling problem with identical parallel machines in each stage. The problem assumes that the queue (Q)-time for each job, which represents the waiting time to be processed in the current stage, must be limited to a predetermined threshold due to quality concerns for the final product. This problem is motivated by one that occurs in the real field, especially in the diffusion workstation of a semiconductor fabrication. Our objective is to minimize the makespan of the jobs while considering product quality. To achieve this goal, we formulated mathematical programming, developed two dominance properties for this problem, and proposed three heuristics with the suggested dominance properties to solve the considered problem. We conducted simulation experiments to evaluate the performance of the proposed approaches using randomly generated problem instances that are created to closely resemble real production scenarios, and the results... [more]

This paper investigates common (slack) due-date assignment single-machine scheduling with controllable processing times within a group technology environment. Under linear and convex resource allocation functions, the cost function minimizes scheduling (including the weighted sum of earliness, tardiness, and due-date assignment, where the weights are position-dependent) and resource-allocation costs. Given some optimal properties of the problem, if the size of jobs in each group is identical, the optimal group sequence can be obtained via an assignment problem. We then illustrate that the problem is polynomially solvable in O(℘3) time, where ℘ is the number of jobs.

In recent years, most of the research in the field of smart grids integrating renewable energy sources assumed energy efficiency as a scheduling objective. However, the aspects of energy consumption or energy demand have not been described clearly, even though they have been proven to be an effective way of reducing energy consumption. In this context, this study aimed to cover a key research challenge in the field, such as the development of an intelligent strategy for solving energy consumption scheduling problems. The added value of our proposal consists of classifying individual consumption profiles assigned to each operation cycle phase, instead of considering an average of non-varying consumption of household appliances. Within this hybrid approach, the proposed explainable system, based on self-organizing maps of neural networks, fuzzy clustering algorithm, and scheduling technics, correlates the complex interrelation between power generated from renewable energy sources in a sm... [more]

The use of parallel applications in High-Performance Computing (HPC) demands high computing times and energy resources. Inadequate scheduling produces longer computing times which, in turn, increases energy consumption and monetary cost. Task scheduling is an NP-Hard problem; thus, several heuristics methods appear in the literature. The main approaches can be grouped into the following categories: fast heuristics, metaheuristics, and local search. Fast heuristics and metaheuristics are used when pre-scheduling times are short and long, respectively. The third is commonly used when pre-scheduling time is limited by CPU seconds or by objective function evaluations. This paper focuses on optimizing the scheduling of parallel applications, considering the energy consumption during the idle time while no tasks are executing. Additionally, we detail a comparative literature study of the performance of lexicographic variants with local searches adapted to be stochastic and aware of idle ener... [more]

Due to rapid population growth, technology, and economic development, electricity demand is rising, causing a gap between energy production and demand. With the emergence of the smart grid, residents can schedule their energy usage in response to the Demand Response (DR) program offered by a utility company to cope with the gap between demand and supply. This work first proposes a novel optimization-based energy management framework that adapts consumer power usage patterns using real-time pricing signals and generation from utility and photovoltaic-battery systems to minimize electricity cost, to reduce carbon emission, and to mitigate peak power consumption subjected to alleviating rebound peak generation. Secondly, a Hybrid Genetic Ant Colony Optimization (HGACO) algorithm is proposed to solve the complete scheduling model for three scenarios: without photovoltaic-battery systems, with photovoltaic systems, and with photovoltaic-battery systems. Thirdly, rebound peak generation is r... [more]

Establishing a wind-solar-hydro hybrid generation system is an effective way of ensuring the smooth passage of clean energy into the grid, and its related scheduling research is a complex and real-time optimization problem. Compared with the traditional scheduling method, this research investigates and improves the accuracy of the scheduling model and the flexibility of the scheduling strategy. The paper innovatively introduces a sand-table deduction model and designs a real-time adaptive scheduling algorithm to evaluate the source-load matching capability of the hybrid wind-solar-hydro system at ultra-short-term scales, and verifies it through arithmetic examples. The results show that the proposed adaptive sand-table scheduling model can reflect the actual output characteristics of the hybrid wind-solar-hydro system, track the load curve, and suppress the fluctuation of wind and solar energy, with good source-load matching capability.

With the rapid development of the Internet of Things (IoT) and artificial intelligence, autonomous vehicles have received much attention in recent years. Safe driving is one of the essential concerns of self-driving cars. The main problem in providing better safe driving requires an efficient inference system for real-time task management and autonomous control. Due to limited battery life and computing power, reducing execution time and resource consumption can be a daunting process. This paper addressed these challenges and developed an intelligent task management system for IoT-based autonomous vehicles. For each task processing, a supervised resource predictor is invoked for optimal hardware cluster selection. Tasks are executed based on the earliest hyper period first (EHF) scheduler to achieve optimal task error rate and schedule length performance. The single-layer feedforward neural network (SLFN) and lightweight learning approaches are designed to distribute each task to the a... [more]

With the transition towards renewable energy resources, the impact of small distributed generators (DGs) increases, leading to the need to actively stabilize distribution grids. DGs may be organized in virtual power plants (VPPs), where DGs’ schedules must be coordinated to enable the VPP to act as a single plant. One approach to solving this problem is using multi-agent systems (MAS) to offer autonomous, robust, and flexible control methods. The coordination of such systems requires communication between agents. The time required for this depends on communication characteristics, determined by the underlying communication infrastructure. In this paper, we investigate communication influences for the wireless technologies CDMA450 and LTE Advanced on the fully distributed optimization heuristic COHDA, which is used to perform optimized scheduling for a VPP. The use case under consideration is the adaptation of schedules to provide flexibility for regional congestion management for deliv... [more]

Smart factories are equipped with Industry 4.0 technologies including smart sensors, digital twin, big data, and embedded software solutions. The application of these technologies contributes to better decision-making, and this real-time decision-making can improve the efficiency of both manufacturing and related logistics processes. In this article, the transformation of conventional milk-run-based in-plant supply solutions into a cyber−physical milk-run supply is described, where the application of Industry 4.0 technologies makes it possible to make real-time decisions regarding scheduling, routing, and resource planning. After a literature review, this paper introduces the structure of Industry 4.0 technologies supported by milk-run-based in-plant supply. A mathematical model of milk-run processes is described including both scheduling and routing problems of in-plant supply. This mathematical model makes it possible to analyze the impact of Industry 4.0 technologies on the efficien... [more]

Generator maintenance scheduling presents many engineering issues that provide power system personnel with a variety of challenges, and one can hardly afford to neglect these engineering issues in the future. Additionally, there is vital need for further development of the repair planning task complexity in order to take into account the vast majority of power flow constraints. At present, the question still remains as to which approach is the simplest and most effective, as well as appropriate for further application in the power flow-oriented statement of the repair planning problem. This research compared directed search, differential evolution, and very fast simulated annealing methods based on a number of numerical calculations and made conclusions about their prospective utilization in terms of a more complicated mathematical formulation of the repair planning task. A comparison of results shows that the effectiveness of directed search methods should not be underestimated, and t... [more]

Off-gas is one of the by-products of the steelmaking process. Its potential energy can be transformed into heat and electricity by means of cogeneration. A case study using a coke oven and Linz−Donawitz converter gas is presented. This work addresses the gas allocation problem for a cogeneration system producing steam and electricity. In the studied facility, located in northern Spain, the annual production of the plant requires 95,000 MWh of electrical energy and 525,000 MWh of thermal energy. The installed electrical and thermal power is 20.4 MW and 81 MW, respectively. A mixed integer linear programming model is built to optimize gas allocation, thus maximizing its benefits. This model is applied to a 24-h scenario with real data from the plant, where gas allocation decision-making was performed by the plant operators. Application of the model generated profit in a scenario where there were losses, increasing benefits by 16.9%. A sensitivity analysis is also performed. The proposed... [more]

Proper planning of the installation of Battery Energy Storage Systems (BESSs) in distribution networks is needed to maximize the overall technical and economic benefits. The limited lifetime and relatively high cost of BESSs require appropriate decisions on their installation and deployment, in order to make the best investment. This paper proposes a comprehensive method to fully support the BESS location and sizing in a low-voltage (LV) network, taking into account the characteristics of the local generation and demand connected at the network nodes, and the time-variable generation and demand patterns. The proposed procedure aims to improve the overall network conditions, by considering both technical and economic aspects. An original approach is presented to consider both the planning and scheduling of BESSs in an LV system. This approach combines the properties of metaheuristics for BESS sizing and placement with a greedy algorithm to find viable BESS scheduling in a relatively sho... [more]

This study concerns the use of the critical chain method to schedule the construction of renewable energy facilities. The critical chain method is recognized as a useful project management tool, transforming a stochastic problem of uncertainty in activity durations into a deterministic one. However, this method has some shortcomings. There are no clear principles of grouping non-critical activities into feeding chains. Another ambiguity is sizing the feeding buffers with regard to the topology of the network model and the resulting dependencies between activities, located in different chains. As a result, it is often necessary to arbitrarily adjust the calculated sizes of feeding buffers before inserting them into the schedule. The authors present the new approach to sizing the time buffers in the schedule, enabling a quick assessment of the quality of a given solution variant and finding a solution that best meets the established criteria, conditions, and constraints. The essence of t... [more]

The promising power-to-gas (P2G) technology makes it possible for wind farms to absorb carbon and trade in multiple energy markets. Considering the remoteness of wind farms equipped with P2G systems and the isolation of different energy markets, the scheduling process may suffer from inefficient coordination and unstable information. An automated scheduling approach is thus proposed. Firstly, an automated scheduling framework enabled by smart contract is established for reliable coordination between wind farms and multiple energy markets. Considering the limited logic complexity and insufficient calculation of smart contracts, an off-chain procedure as a workaround is proposed to avoid complex on-chain solutions. Next, a non-linear model of the P2G system is developed to enhance the accuracy of scheduling results. The scheduling strategy takes into account not only the revenues from multiple energy trades, but also the penalties for violating contract items in smart contracts. Then, th... [more]

This study uses an artificial neural network (ANN) as an intelligent controller for the management and scheduling of a number of microgrids (MGs) in virtual power plants (VPP). Two ANN-based scheduling control approaches are presented: the ANN-based backtracking search algorithm (ANN-BBSA) and ANN-based binary practical swarm optimization (ANN-BPSO) algorithm. Both algorithms provide the optimal schedule for every distribution generation (DG) to limit fuel consumption, reduce CO2 emission, and increase the system efficiency towards smart and economic VPP operation as well as grid decarbonization. Different test scenarios are executed to evaluate the controllers’ robustness and performance under changing system conditions. The test cases are different load curves to evaluate the ANN’s performance on untrained data. The untrained and trained load models used are real-load parameter data recorders in northern parts of Malaysia. The test results are analyzed to investigate the performance... [more]

The operation of on-site power plants in the chemical industry is typically determined by the steam demand of the production plants. This demand is uncertain due to deviations from the production plan and fluctuations in the operation of the plants. The steam demand uncertainty can result in an inefficient operation of the power plant due to a surplus or deficiency of steam that is needed to balance the steam network. In this contribution, it is proposed to use two-stage stochastic programming on a moving horizon to cope with the uncertainty. In each iteration of the moving horizon scheme, the model parameters are updated according to the new information acquired from the plants and the optimisation is re-executed. Hedging against steam demand uncertainty results in a reduction of the fuel consumption and a more economic generation of electric power, which can result in significant savings in the operating cost of the power plant. Moreover, unplanned load reductions due to lack of stea... [more]