Enhanced Hybrid Equilibrium Strategy in Fog-Cloud Computing Networks with Optimal Task Scheduling

More devices in the Intelligent Internet of Things(AIoT)result in an increased number of tasks that require low latency and real-time responsiveness,leading to an increased demand for computational resources.Cloud computing’s low-latency performance issues in AIoT scenarios have led researchers to explore fog computing as a complementary extension.However,the effective allocation of resources for task execution within fog environments,characterized by limitations and heterogeneity in computational resources,remains a formidable challenge.To tackle this challenge,in this study,we integrate fog computing and cloud computing.We begin by establishing a fog-cloud environment framework,followed by the formulation of a mathematical model for task scheduling.Lastly,we introduce an enhanced hybrid Equilibrium Optimizer(EHEO)tailored for AIoT task scheduling.The overarching objective is to decrease both the makespan and energy consumption of the fog-cloud system while accounting for task deadlines.The proposed EHEO method undergoes a thorough evaluation against multiple benchmark algorithms,encompassing metrics likemakespan,total energy consumption,success rate,and average waiting time.Comprehensive experimental results unequivocally demonstrate the superior performance of EHEO across all assessed metrics.Notably,in the most favorable conditions,EHEO significantly diminishes both the makespan and energy consumption by approximately 50%and 35.5%,respectively,compared to the secondbest performing approach,which affirms its efficacy in advancing the efficiency of AIoT task scheduling within fog-cloud networks.

Two-Stage Optimal Scheduling of Community Integrated Energy System

From the perspective of a community energy operator,a two-stage optimal scheduling model of a community integrated energy system is proposed by integrating information on controllable loads.The day-ahead scheduling analyzes whether various controllable loads participate in the optimization and investigates the impact of their responses on the operating economy of the community integrated energy system(IES)before and after;the intra-day scheduling proposes a two-stage rolling optimization model based on the day-ahead scheduling scheme,taking into account the fluctuation of wind turbine output and load within a short period of time and according to the different response rates of heat and cooling power,and solves the adjusted output of each controllable device.The simulation results show that the optimal scheduling of controllable loads effectively reduces the comprehensive operating costs of community IES;the two-stage optimal scheduling model can meet the energy demand of customers while effectively and timely suppressing the random fluctuations on both sides of the source and load during the intra-day stage,realizing the economic and smooth operation of IES.

Multi-Time Scale Optimal Scheduling of a Photovoltaic Energy Storage Building System Based on Model Predictive Control

Building emission reduction is an important way to achieve China’s carbon peaking and carbon neutrality goals.Aiming at the problem of low carbon economic operation of a photovoltaic energy storage building system,a multi-time scale optimal scheduling strategy based on model predictive control(MPC)is proposed under the consideration of load optimization.First,load optimization is achieved by controlling the charging time of electric vehicles as well as adjusting the air conditioning operation temperature,and the photovoltaic energy storage building system model is constructed to propose a day-ahead scheduling strategy with the lowest daily operation cost.Second,considering inter-day to intra-day source-load prediction error,an intraday rolling optimal scheduling strategy based on MPC is proposed that dynamically corrects the day-ahead dispatch results to stabilize system power fluctuations and promote photovoltaic consumption.Finally,taking an office building on a summer work day as an example,the effectiveness of the proposed scheduling strategy is verified.The results of the example show that the strategy reduces the total operating cost of the photovoltaic energy storage building system by 17.11%,improves the carbon emission reduction by 7.99%,and the photovoltaic consumption rate reaches 98.57%,improving the system’s low-carbon and economic performance.

Optimal Scheduling Strategy of Source-Load-Storage Based onWind Power Absorption Benefit

In recent years,the proportion of installed wind power in the three north regions where wind power bases are concentrated is increasing,but the peak regulation capacity of the power grid in the three north regions of China is limited,resulting in insufficient local wind power consumption capacity.Therefore,this paper proposes a two-layer optimal scheduling strategy based on wind power consumption benefits to improve the power grid’s wind power consumption capacity.The objective of the uppermodel is tominimize the peak-valley difference of the systemload,which ismainly to optimize the system load by using the demand response resources,and to reduce the peak-valley difference of the system load to improve the peak load regulation capacity of the grid.The lower scheduling model is aimed at maximizing the system operation benefit,and the scheduling model is selected based on the rolling schedulingmethod.The load-side schedulingmodel needs to reallocate the absorbed wind power according to the response speed,absorption benefit,and curtailment penalty cost of the two DR dispatching resources.Finally,the measured data of a power grid are simulated by MATLAB,and the results show that:the proposed strategy can improve the power grid’s wind power consumption capacity and get a large wind power consumption benefit.

MCWOA Scheduler:Modified Chimp-Whale Optimization Algorithm for Task Scheduling in Cloud Computing

Cloud computing provides a diverse and adaptable resource pool over the internet,allowing users to tap into various resources as needed.It has been seen as a robust solution to relevant challenges.A significant delay can hamper the performance of IoT-enabled cloud platforms.However,efficient task scheduling can lower the cloud infrastructure’s energy consumption,thus maximizing the service provider’s revenue by decreasing user job processing times.The proposed Modified Chimp-Whale Optimization Algorithm called Modified Chimp-Whale Optimization Algorithm(MCWOA),combines elements of the Chimp Optimization Algorithm(COA)and the Whale Optimization Algorithm(WOA).To enhance MCWOA’s identification precision,the Sobol sequence is used in the population initialization phase,ensuring an even distribution of the population across the solution space.Moreover,the traditional MCWOA’s local search capabilities are augmented by incorporating the whale optimization algorithm’s bubble-net hunting and random search mechanisms into MCWOA’s position-updating process.This study demonstrates the effectiveness of the proposed approach using a two-story rigid frame and a simply supported beam model.Simulated outcomes reveal that the new method outperforms the original MCWOA,especially in multi-damage detection scenarios.MCWOA excels in avoiding false positives and enhancing computational speed,making it an optimal choice for structural damage detection.The efficiency of the proposed MCWOA is assessed against metrics such as energy usage,computational expense,task duration,and delay.The simulated data indicates that the new MCWOA outpaces other methods across all metrics.The study also references the Whale Optimization Algorithm(WOA),Chimp Algorithm(CA),Ant Lion Optimizer(ALO),Genetic Algorithm(GA)and Grey Wolf Optimizer(GWO).

Data-driven Wasserstein distributionally robust chance-constrained optimization for crude oil scheduling under uncertainty

Crude oil scheduling optimization is an effective method to enhance the economic benefits of oil refining.But uncertainties,including uncertain demands of crude distillation units(CDUs),might make the production plans made by the traditional deterministic optimization models infeasible.A data-driven Wasserstein distributionally robust chance-constrained(WDRCC)optimization approach is proposed in this paper to deal with demand uncertainty in crude oil scheduling.First,a new deterministic crude oil scheduling optimization model is developed as the basis of this approach.The Wasserstein distance is then used to build ambiguity sets from historical data to describe the possible realizations of probability distributions of uncertain demands.A cross-validation method is advanced to choose suitable radii for these ambiguity sets.The deterministic model is reformulated as a WDRCC optimization model for crude oil scheduling to guarantee the demand constraints hold with a desired high probability even in the worst situation in ambiguity sets.The proposed WDRCC model is transferred into an equivalent conditional value-at-risk representation and further derived as a mixed-integer nonlinear programming counterpart.Industrial case studies from a real-world refinery are conducted to show the effectiveness of the proposed method.Out-of-sample tests demonstrate that the solution of the WDRCC model is more robust than those of the deterministic model and the chance-constrained model.

Energy-Saving Distributed Flexible Job Shop Scheduling Optimization with Dual Resource Constraints Based on Integrated Q-Learning Multi-Objective Grey Wolf Optimizer

The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality.

An Elite-Class Teaching-Learning-Based Optimization for Reentrant Hybrid Flow Shop Scheduling with Bottleneck Stage

Bottleneck stage and reentrance often exist in real-life manufacturing processes;however,the previous research rarely addresses these two processing conditions in a scheduling problem.In this study,a reentrant hybrid flow shop scheduling problem(RHFSP)with a bottleneck stage is considered,and an elite-class teaching-learning-based optimization(ETLBO)algorithm is proposed to minimize maximum completion time.To produce high-quality solutions,teachers are divided into formal ones and substitute ones,and multiple classes are formed.The teacher phase is composed of teacher competition and teacher teaching.The learner phase is replaced with a reinforcement search of the elite class.Adaptive adjustment on teachers and classes is established based on class quality,which is determined by the number of elite solutions in class.Numerous experimental results demonstrate the effectiveness of new strategies,and ETLBO has a significant advantage in solving the considered RHFSP.

Research on Flexible Job Shop Scheduling Based on Improved Two-Layer Optimization Algorithm

To improve the productivity,the resource utilization and reduce the production cost of flexible job shops,this paper designs an improved two-layer optimization algorithm for the dual-resource scheduling optimization problem of flexible job shop considering workpiece batching.Firstly,a mathematical model is established to minimize the maximum completion time.Secondly,an improved two-layer optimization algorithm is designed:the outer layer algorithm uses an improved PSO(Particle Swarm Optimization)to solve the workpiece batching problem,and the inner layer algorithm uses an improved GA(Genetic Algorithm)to solve the dual-resource scheduling problem.Then,a rescheduling method is designed to solve the task disturbance problem,represented by machine failures,occurring in the workshop production process.Finally,the superiority and effectiveness of the improved two-layer optimization algorithm are verified by two typical cases.The case results show that the improved two-layer optimization algorithm increases the average productivity by 7.44% compared to the ordinary two-layer optimization algorithm.By setting the different numbers of AGVs(Automated Guided Vehicles)and analyzing the impact on the production cycle of the whole order,this paper uses two indicators,the maximum completion time decreasing rate and the average AGV load time,to obtain the optimal number of AGVs,which saves the cost of production while ensuring the production efficiency.This research combines the solved problem with the real production process,which improves the productivity and reduces the production cost of the flexible job shop,and provides new ideas for the subsequent research.

Optimized scheduling of integrated energy systems for low carbon economy considering carbon transaction costs

With the introduction of the“dual carbon”goal and the continuous promotion of low-carbon development,the integrated energy system(IES)has gradually become an effective way to save energy and reduce emissions.This study proposes a low-carbon economic optimization scheduling model for an IES that considers carbon trading costs.With the goal of minimizing the total operating cost of the IES and considering the transferable and curtailable characteristics of the electric and thermal flexible loads,an optimal scheduling model of the IES that considers the cost of carbon trading and flexible loads on the user side was established.The role of flexible loads in improving the economy of an energy system was investigated using examples,and the rationality and effectiveness of the study were verified through a comparative analysis of different scenarios.The results showed that the total cost of the system in different scenarios was reduced by 18.04%,9.1%,3.35%,and 7.03%,respectively,whereas the total carbon emissions of the system were reduced by 65.28%,20.63%,3.85%,and 18.03%,respectively,when the carbon trading cost and demand-side flexible electric and thermal load responses were considered simultaneously.Flexible electrical and thermal loads did not have the same impact on the system performance.In the analyzed case,the total cost and carbon emissions of the system when only the flexible electrical load response was considered were lower than those when only the flexible thermal load response was taken into account.Photovoltaics have an excess of carbon trading credits and can profit from selling them,whereas other devices have an excess of carbon trading and need to buy carbon credits.

An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem

Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been widely employed to solve scheduling problems.However,HHO suffers from premature convergence when solving NP-hard problems.Therefore,this paper proposes an improved HHO algorithm(GNHHO)to solve the FJSP.GNHHO introduces an elitism strategy,a chaotic mechanism,a nonlinear escaping energy update strategy,and a Gaussian random walk strategy to prevent premature convergence.A flexible job shop scheduling model is constructed,and the static and dynamic FJSP is investigated to minimize the makespan.This paper chooses a two-segment encoding mode based on the job and the machine of the FJSP.To verify the effectiveness of GNHHO,this study tests it in 23 benchmark functions,10 standard job shop scheduling problems(JSPs),and 5 standard FJSPs.Besides,this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company’s FJSP.The optimized scheduling scheme demonstrates significant improvements in makespan,with an advancement of 28.16%for static scheduling and 35.63%for dynamic scheduling.Moreover,it achieves an average increase of 21.50%in the on-time order delivery rate.The results demonstrate that the performance of the GNHHO algorithm in solving FJSP is superior to some existing algorithms.

An Optimal Dynamic Generation Scheduling for a Wind-Thermal Power System

In this paper, a dynamic generation scheduling model is formulated, aiming at minimizing the costs of power generation and taking into account the constraints of thermal power units and spinning reserve in wind power integrated systems. A dynamic solving method blended with particle swarm optimization algorithm is proposed. In this method, the solution space of the states of unit commitment is created and will be updated when the status of unit commitment changes in a period to meet the spinning reserve demand. The thermal unit operation constrains are inspected in adjacent time intervals to ensure all the states in the solution space effective. The particle swarm algorithm is applied in the procedure to optimize the load distribution of each unit commitment state. A case study in a simulation system is finally given to verify the feasibility and effectiveness of this dynamic optimization algorithm.

A Chance Constrained Optimal Reserve Scheduling Approach for Economic Dispatch Considering Wind Penetration

The volatile wind power generation brings a full spectrum of problems to power system operation and management, ranging from transient system frequency fluctuation to steady state supply and demand balancing issue. In this paper, a novel wind integrated power system day-ahead economic dispatch model, with the consideration of generation and reserve cost is modelled and investigated. The proposed problem is first formulated as a chance constrained stochastic nonlinear programming U+0028 CCSNLP U+0029, and then transformed into a deterministic nonlinear programming U+0028 NLP U+0029. To tackle this NLP problem, a three-stage framework consists of particle swarm optimization U+0028 PSO U+0029, sequential quadratic programming U+0028 SQP U+0029 and Monte Carlo simulation U+0028 MCS U+0029 is proposed. The PSO is employed to heuristically search the line power flow limits, which are used by the SQP as constraints to solve the NLP problem. Then the solution from SQP is verified on benchmark system by using MCS. Finally, the verified results are feedback to the PSO as fitness value to update the particles. Simulation study on IEEE 30-bus system with wind power penetration is carried out, and the results demonstrate that the proposed dispatch model could be effectively solved by the proposed three-stage approach. © 2017 Chinese Association of Automation.

An optimal scheduling algorithm based on task duplication

When the communication time is relatively shorter than the computation time for every task, the task duplication based scheduling (TDS) algorithm proposed by Darbha and Agrawal generates an optimal schedule. Park and Choe also proposed an extended TDS algorithm whose optimality condition is less restricted than that of TDS algorithm, but the condition is very complex and is difficult to satisfy when the number of tasks is large. An efficient algorithm is proposed whose optimality condition is less restricted and simpler than both of the algorithms, and the schedule length is also shorter than both of the algorithms. The time complexity of the proposed algorithm is O(v2), where v represents the number of tasks.

Post-Processing Time-Aware Optimal Scheduling of Single Robotic Cluster Tools

Integrated circuit chips are produced on silicon wafers.Robotic cluster tools are widely used since they provide a reconfigurable and efficient environment for most wafer fabrication processes.Recent advances in new semiconductor materials bring about new functionality for integrated circuits.After a wafer is processed in a processing chamber,the wafer should be removed from there as fast as possible to guarantee its high-quality integrated circuits.Meanwhile,maximization of the throughput of robotic cluster tools is desired.This work aims to perform post-processing time-aware scheduling for such tools subject to wafer residencytime constraints.To do so,closed-form expression algorithms are derived to compute robot waiting time accurately upon the analysis of particular events of robot waiting for singlearm cluster tools.Examples are given to show the application and effectiveness of the proposed algorithms.

Microgrid Optimal Scheduling

This paper presents the optimal scheduling of renewable resources using interior point optimization for grid-connected and islanded microgrids (MG) that operate with no energy storage systems. The German Jordanian University (GJU) microgrid system is used for illustration. We present analyses for islanded and grid-connected MG with no storage. The results show a feasible islanded MG with a substantial operational cost reduction. We obtain an average of $1 k daily cost savings when operating an islanded compared to a grid-connected MG with capped grid energy prices. This cost saving is 10 times higher when considering varying grid energy prices during the day. Although the PV power is intermittent during the day, the MG continues to operate with a voltage variation that does not 10%. The results imply that MGs of GJU similar topology can optimally and safely operate with no energy storage requirements but considerable renewable generation capacity.

A Novel Particle Swarm Optimization for Optimal Scheduling of Hydrothermal System

A fuzzy adaptive particle swarm optimization (FAPSO) is presented to determine the optimal operation of hydrothermal power system. In order to solve the shortcoming premature and easily local optimum of the standard particle swarm optimization (PSO), the fuzzy adaptive criterion is applied for inertia weight based on the evolution speed factor and square deviation of fitness for the swarm, in each iteration process, the inertia weight is dynamically changed using the fuzzy rules to adapt to nonlinear optimization process. The performance of FAPSO is demonstrated on hydrothermal system comprising 1 thermal unit and 4 hydro plants, the comparison is drawn in PSO, FAPSO and genetic algorithms (GA) in terms of the solution quality and computational efficiency. The experiment showed that the proposed approach has higher quality solutions and strong ability in global search.

An Optimal Algorithm for a Class of Parallel Machines Scheduling Problem

This paper considers the parallel machines scheduling problem where jobs are subject to different release times. A constructive heuristic is first proposed to solve the problem in a modest amount of computer time. In general, the quality of the solutions provided by heuristics degrades with the increase of the probiem’s scale. Combined the global search ability of genetic algorithm, this paper proposed a hybrid heuristic to improve the quality of solutions further. The computational results show that the hybrid heuristic combines the advantages of heuristic and genetic algorithm effectively and can provide very good solutions to some large problems in a reasonable amount of computer time.

Towards Prevention of Sportsmen Burnout:Formal Analysis of Sub-Optimal Tournament Scheduling

Scheduling a sports tournament is a complex optimization problem,which requires a large number of hard constraints to satisfy.Despite the availability of several such constraints in the literature,there remains a gap sincemost of the new sports events pose their own unique set of requirements,and demand novel constraints.Specifically talking of the strictly time bound events,ensuring fairness between the different teams in terms of their rest days,traveling,and the number of successive games they play,becomes a difficult task to resolve,and demands attention.In this work,we present a similar situation with a recently played sports event,where a suboptimal schedule favored some of the sides more than the others.We introduce various competitive parameters to draw a fairness comparison between the sides and propose a weighting criterion to point out the sides that enjoyed this schedule more than the others.Furthermore,we use root mean squared error between an ideal schedule and the actual ones for each side to determine unfairness in the distribution of rest days across their entire schedules.The latter is crucial,since successively playing a large number of games may lead to sportsmen burnout,which must be prevented.

Optimal Scheduling of Electrical Energy Systems Using a Fluid Dynamic Analogy

The electricity-gas transformation problem and related intrinsic mechanisms are considered.First,existing schemes for the optimization of electricity-gas integrated energy systems are analyzed through consideration of the relevant literature,and an Electricity Hub(EH)for electricity-gas coupling is proposed.Then,the distribution mechanism in the circuit of the considered electricity-gas integrated system is analyzed.Afterward,a mathematical model for the natural gas pipeline is elaborated according to the power relationship,a node power flow calculation method,and security requirements.Next,the coupling relationship between them is implemented,and dedicated simulations are carried out.Through experimental data,it is found that after 79 data iterations,the optimization results of power generation and gas purchase cost in the new system converge to$54,936 in total,which is consistent with the data obtained by an existing centralized optimization scheme.However,the new proposed optimization scheme is found to be more flexible and convenient.