Search

In this paper, we address scheduling methods for queue stabilization and appropriate power allocation techniques in downlink dense user-centric scalable cell-free multiple-input multiple-output (CF-MIMO) networks. Scheduling is performed by the central processing unit (CPU) scheduler using Lyapunov optimization for queue stabilization. In this process, the drift-plus-penalty is utilized, and the control parameter V serves as the weighting factor for the penalty term. The control parameter V is fixed to achieve queue stabilization. We introduce the dynamic V method, which adaptively selects the control parameter V considering the current queue backlog, arrival rate, and effective rate. The dynamic V method allows flexible scheduling based on traffic conditions, demonstrating its advantages over fixed V scheduling methods. In cases where UEs scheduled with dynamic V exceed the number of antennas at the access point (AP), the semi-orthogonal user selection (SUS) algorithm is employed to reschedule UEs with favorable channel conditions and orthogonality. Dynamic V shows the best queue stabilization performance across all traffic conditions. It shows a 10% degraded throughput performance compared to V = 10,000. Max-min fairness (MMF), sum SE maximization, and fractional power allocation (FPA) are widely considered power allocation methods. However, the power allocation method proposed in this paper, combining FPA and queue-based FPA, achieves up to 60% better queue stabilization performance compared to MMF. It is suitable for systems requiring low latency. [ABSTRACT FROM AUTHOR]

The selection of multiple contingency scenarios is a key task to perform resilience-oriented long-term planning analyses. However, the identification of relevant multiple contingencies may easily lead to combinatorial explosion issues, even for relatively small systems. This paper proposes an effective methodology for the identification of relevant multiple contingencies and their probabilities, suitable for the long-term resilience analysis of large power systems. The methodology is composed of two main pillars: (1) the clustering of lines that are more likely to fail together, to reduce the computational complexity of the analysis exploiting historical weather data and (2) the probability-based identification of multiple contingencies within each cluster, where the contingency probability is computed applying the copula theory. Tests performed on a portion of the Italian EHV transmission system confirm the validity of the clustering results compared against historical failure events. Moreover, the copula-based algorithm for contingency probability estimation passes the tests carried out on relatively large clusters with very low error tolerance. The method successfully pinpoints critical multiple contingency scenarios and their likelihoods, making it valuable for assessing power system resilience over long-term horizons in support of resilience-oriented planning activities. [ABSTRACT FROM AUTHOR]

The use of renewable energy sources to achieve carbon neutrality is increasing. However, the uncertainty and volatility of renewable resources are causing problems in power systems. Flexible and low-carbon resources such as Energy Storage Systems (ESSs) are essential for solving the problems of power systems and achieving greenhouse gas reduction goals. However, ESSs are not being installed because of Korea's fuel-based electricity market. To address this issue, this paper presents a method for determining the optimal investment timing of Battery Energy Storage Systems (BESSs) using the Least Squares Monte Carlo (LSMC) method. A case study is conducted considering the System Marginal Price (SMP) and Capacity Payment (CP), which are electricity rates in Korea. Revenue is calculated through the arbitrage of a 10 MW/40 MWh lithium-ion BESS, and linear programming optimization is performed for ESS scheduling to maximize revenue. The ESS revenue with uncertainty is modeled as a stochastic process using Geometric Brownian Motion (GBM), and the optimal time to invest in an ESS is determined using an LSMC simulation considering investment costs. The proposed method can be used as a decision-making tool for ESS investors to provide information on facility investments in arbitrage situations. [ABSTRACT FROM AUTHOR]

Inverse synthetic-aperture radar (ISAR) can achieve precise imaging of targets, which enables precise perception of battlefield information, and it has become one of the most important tasks for radar systems. In multi-target scenarios, a resource scheduling method is required to improve the sensing ability and the overall efficiency of a radar system due to the limited resources. Considering the motion state of the target will change as the observation distance increases and image defocusing can occur due to the prolonged coherence accumulation time and significant changes in the target's motion state, the optimal observation period should be an important consideration factor in the resource scheduling method to further improve the imaging efficiency of radar system, which has not yet been involved in existing research. In this paper, we first derive the expressions of the target's effective rotation angle and the equivalent rotation angular velocity and then define the target's optimal observation period. Then, for multi-target imaging scenarios, we allocate pulse resources within a given time period based on sparse-aperture ISAR imaging technology. An adaptive radar resource scheduling algorithm for multi-target ISAR imaging is proposed, which prioritizes allocating resources based on the optimal observation periods for the targets. In the algorithm, a radar resource scheduling model for multi-target ISAR imaging is established, and a feedback-based closed-loop search optimization method is proposed to solve the model. Finally, the best scheduling strategy can be obtained, which includes imaging task duration and the pulse allocation sequence for each target. Simulation results validate the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

The increasing penetration rate of distributed resources in the distribution network has brought about significant volatility and uncertainty problems. Demand response (DR) can flexibly change the energy consumption method of the user to balance supply and demand. This paper first considers the spatial distribution characteristics of DR resources to schedule DR resources to construct a distributed resource cloud-edge collaborative scheduling framework. Based on this, the distribution network scheduling requirements are combined with the multi-time scale characteristics of DR. A three-stage cloud-edge collaborative optimization scheduling strategy for distributed resources in the distribution network is proposed, which allocates the multi-time scale scheduling tasks of DR resources to the cloud and edge. Secondly, taking the cloud and edge as the optimization platform, a three-stage optimization decision-making model of the distribution network is established. In the day-ahead stage, the global optimization decision is made by combining cloud-centralized optimization with edge-independent optimization. In the intraday stage, edge-rolling optimization is carried out. In the real-time stage, the edge-distributed calculation is based on the consensus algorithm. Finally, the effectiveness and economy of the proposed model and strategy are verified by an example analysis. [ABSTRACT FROM AUTHOR]

Since microgrids can effectively integrate renewable energy, energy storage devices, and controllable loads, this advantage promotes the rapid development and application of microgrid technology. However, with the high proportion of renewable energy access, only considering how energy is optimally distributed in microgrids can no longer meet the actual demand. How to aggregate user-side controllable loads to form regulation resources has become a research hotspot, and the users, as a passive party in the load scheduling process, should also be an important consideration in their perception of the use of electricity. First, a control model for temperature-controlled loads and a time-shift model for time-shiftable loads are developed. Then, the comprehensive electricity satisfaction model of users is established, and the two-layer optimal scheduling model of microgrids considering users' satisfaction is proposed, with users as the upper layer and microgrids as the lower layer, and the two-layer model is transformed into a single-layer model according to the KKT condition for solving. Finally, the effect of the weighting factor for satisfaction on the economy is discussed through the analysis of examples, which verifies the effectiveness of the two-layer model. [ABSTRACT FROM AUTHOR]

Although wireless devices continuously gain communication capabilities, even state-of-the-art Industrial Internet of Things (IIoT) architectures, such as Internet Protocol version 6 over the Time-Slotted Channel Hopping (TSCH) mode of IEEE 802.15.4 (6TiSCH), continue to use network-wide, fixed link configurations. This presents a missed opportunity to (1) forego the need for rigorous manual setup of new deployments; and (2) provide full coverage of particularly heterogeneous and/or dynamic industrial sites. As such, we devised the Multi-Modal Minimal Scheduling Function (3MSF) for the TSCH link layer, which, combined with previous work on the routing layer, results in a 6TiSCH architecture able to dynamically exploit modern multi-modal hardware on a per-link basis through variable-duration timeslots, simultaneous transmission, and routing metric normalization. This paper describes, in great detail, its design and discusses the rationale behind every choice made. Finally, we evaluate three basic scenarios through simulations, showcasing both the functionality and flexibility of our 6TiSCH implementation. [ABSTRACT FROM AUTHOR]

In high-density network environments with multiple access points (APs) and stations, individual uplink scheduling by each AP can severely interfere with the uplink transmissions of neighboring APs and their associated stations. In congested areas where concurrent uplink transmissions may lead to significant interference, it would be beneficial to deploy a cooperative scheduler or a central coordinating entity responsible for orchestrating cooperative uplink scheduling by assigning several neighboring APs to support the uplink transmission of a single station within a proximate service area to alleviate the excessive interference. Cooperative uplink scheduling facilitated by cooperative information sharing and management is poised to improve the likelihood of successful uplink transmissions in areas with a high concentration of APs and stations. Nonetheless, it is crucial to account for the queue stability of the stations and the potential delays arising from information exchange and the decision-making process in uplink scheduling to maintain the overall effectiveness of the cooperative approach. In this paper, we propose a Lyapunov drift-plus-penalty framework-based cooperative uplink scheduling method for densely populated Wi-Fi networks. The cooperative scheduler aggregates information, such as signal-to-interference-plus-noise ratio (SINR) and queue status. During the aggregation procedure, propagation delays are also estimated and utilized as a value of expected cooperation delays in scheduling decisions. Upon aggregating the information, the cooperative scheduler calculates the Lyapunov drift-plus-penalty value, incorporating a predefined model parameter to adjust the system accordingly. Among the possible scheduling candidates, the proposed method proceeds to make uplink decisions that aim to reduce the upper bound of the Lyapunov drift-plus-penalty value, thereby improving the network performance and stability without a severe increase in cooperation delay in highly congested areas. Through comprehensive performance evaluations, the proposed method effectively enhances network performance with an appropriate model parameter. The performance improvement is particularly notable in highly congested areas and is achieved without a severe increase in cooperation delays. [ABSTRACT FROM AUTHOR]

IoT-based smart transportation monitors vehicles, cargo, and driver statuses for safe movement. Due to the limited computational capabilities of the sensors, the IoT devices require powerful remote servers to execute their tasks, and this phenomenon is called task offloading. Researchers have developed efficient task offloading and scheduling mechanisms for IoT devices to reduce energy consumption and response time. However, most research has not considered fault-tolerance-based job allocation for IoT logistics trucks, task and data-aware scheduling, priority-based task offloading, or multiple-parameter-based fog node selection. To overcome the limitations, we proposed a Multi-Objective Task-Aware Offloading and Scheduling Framework for IoT Logistics (MT-OSF). The proposed model prioritizes the tasks into delay-sensitive and computation-intensive tasks using a priority-based offloader and forwards the two lists to the Task-Aware Scheduler (TAS) for further processing on fog and cloud nodes. The Task-Aware Scheduler (TAS) uses a multi-criterion decision-making process, i.e., the analytical hierarchy process (AHP), to calculate the fog nodes' priority for task allocation and scheduling. The AHP decides the fog nodes' priority based on node energy, bandwidth, RAM, and MIPS power. Similarly, the TAS also calculates the shortest distance between the IoT-enabled vehicle and the fog node to which the IoT tasks are assigned for execution. A task-aware scheduler schedules delay-sensitive tasks on nearby fog nodes while allocating computation-intensive tasks to cloud data centers using the FCFS algorithm. Fault-tolerant manager is used to check task failure; if any task fails, the proposed system re-executes the tasks, and if any fog node fails, the proposed system allocates the tasks to another fog node to reduce the task failure ratio. The proposed model is simulated in iFogSim2 and demonstrates a 7% reduction in response time, 16% reduction in energy consumption, and 22% reduction in task failure ratio in comparison to Ant Colony Optimization and Round Robin. [ABSTRACT FROM AUTHOR]

How to select the transmitting path in MPTCP scheduling is an important but open problem. This paper proposes an intelligent data scheduling algorithm using spatiotemporal synchronous graph attention neural networks to improve MPTCP scheduling. By exploiting the spatiotemporal correlations in the data transmission process and incorporating graph self-attention mechanisms, the algorithm can quickly select the optimal transmission path and ensure fairness among similar links. Through simulations in NS3, the algorithm achieves a throughput gain of 7.9% compared to the PDAA3C algorithm and demonstrates improved packet transmission performance. [ABSTRACT FROM AUTHOR]

The penetration of electric vehicles (EVs) in vehicle-to-grid (V2G) interaction can effectively assist the grid in achieving frequency regulation and peak load balancing. However, the customer perceives that participating in V2G services would result in the additional cycling of the battery and the accelerated aging of the EVs' power battery, which has become a major obstacle to the widespread adoption of V2G services. Most existing methods require long-term cycling data and battery parameters to quantify battery aging, which is not suitable for the V2G scenario with large-scale and short-time intervals. Consequently, the real-time and accurate quantification of battery aging for optimization remains a challenge. This study proposes a charging scheduling method for EVs that can accurately and online quantify battery aging. Firstly, V2G scheduling is formulated as an optimization problem by defining an online sliding window to collect real-time vehicle information on the grid, enabling online optimization. Secondly, battery aging is more accurately quantified by proposing a novel amplitude-based rain-flow cycle counting (MRCC) method, which utilizes the charging information of the battery within a shorter time period. Lastly, an intelligent optimization algorithm is employed to optimize the charging and discharging power of EVs, aiming to minimize grid fluctuations and battery aging. The proposed method is validated using a V2G scenario with 50 EVs with randomly generated behaviors, and the results demonstrate that the proposed online scheduling method not only reduces the EFCC of the battery by 8.4%, but also achieves results close to global optimization. [ABSTRACT FROM AUTHOR]

With the rapid development of economic globalization and green manufacturing, traditional flexible job shop scheduling has evolved into the low-carbon heterogeneous distributed flexible job shop scheduling problem (LHDFJSP). Additionally, modern smart manufacturing processes encounter complex and diverse contingencies, necessitating the ability to address dynamic events in real-world production activities. To date, there are limited studies that comprehensively address the intricate factors associated with the LHDFJSP, including workshop heterogeneity, job insertions and transfers, and considerations of low-carbon objectives. This paper establishes a multi-objective mathematical model with the goal of minimizing the total weighted tardiness and total energy consumption. To effectively solve this problem, diverse composite scheduling rules are formulated, alongside the application of a deep reinforcement learning (DRL) framework, i.e., Rainbow deep-Q network (Rainbow DQN), to learn the optimal scheduling strategy at each decision point in a dynamic environment. To verify the effectiveness of the proposed method, this paper extends the standard dataset to adapt to the LHDFJSP. Evaluation results confirm the generalization and robustness of the presented Rainbow DQN-based method. [ABSTRACT FROM AUTHOR]

Low-Power Wide-Area Networks constitute a leading, emerging Internet-of-Things technology, with important applications in environmental and industrial monitoring and disaster prevention and management. In such sensor networks, external detectable events can trigger synchronized alarm report transmissions. In LoRaWANs, and more generally in networks with a random access-based medium access algorithm, this can lead to a cascade of frame collisions, temporarily resulting in degraded performance and diminished system operational capacity, despite LoRaWANs' physical layer interference and collision reduction techniques. In this paper, a novel scheduling algorithm is proposed that can increase system reliability in the case of such events. The new adaptive spatial scheduling algorithm is based on learning automata, as well as previous developments in scheduling over LoRaWANs, and it leverages network feedback information and traffic spatial correlation to increase network performance while maintaining high reliability. The proposed algorithm is investigated via an extensive simulation under a variety of network conditions and compared with a previously proposed scheduler for event-triggered traffic. The results show a decrease of up to 30% in average frame delay compared to the previous approach and an order of magnitude lower delay compared to the baseline algorithm. These findings highlight the importance of using spatial information in adaptive schemes for improving network performance, especially in location-sensitive applications. [ABSTRACT FROM AUTHOR]

This paper studies the single-machine group scheduling problem with convex resource allocation and learning effect. The number of jobs in each group is different, and the corresponding common due dates are also different, where the processing time of jobs follows a convex function of resource allocation. Under common due date assignment, the objective is to minimize the weighted sum of earliness, tardiness, common due date, resource consumption, and makespan. To solve the problem, we present the heuristic, simulated annealing, and branch-and-bound algorithms. Computational experiments indicate that the proposed algorithms are effective. [ABSTRACT FROM AUTHOR]

This paper presents two novel formulations for scheduling problems, namely order-position hybrid formulation (OPH) and order-disjunctive hybrid formulation (ODH), which extend and combine parts of existing formulation strategies. The first strategy (OPH) is based on sequence position and linear ordering formulations, adding relationships between constraints that allow relaxing some decision variables. The second approach (ODH) is based on linear ordering and disjunctive formulations. In this work, we prove ODH to be the most efficient formulation known so far. The experiments have been carried out with a large set of problems, which consider single machines and identical parallel machines. Computational results show that OPH is better than the rest of the existing formulations for the case of weighted completion objectives, while ODH turns out to be the best approach for most scenarios studied. [ABSTRACT FROM AUTHOR]

Distribution network scheduling (DNS) is the basis for distribution network management, which is computed in a periodical way via solving the formulated mixed-integer programming (MIP). To achieve the online scheduling, a provably robust learn-to-optimize approach for online DNS is proposed in this paper, whose key lies in the transformation of the MIP-based DNS into the simple linear program problem with a much faster solving time. It formulates the parametric DNS model to construct the offline training dataset and then proposes the provably robust learning approach to learn the integer variables of MIP. The proposed learning approach is adversarial to minor perturbation of input scenario. After training, the learning model can predict the integer variables to achieve online scheduling. Case study verifies the acceleration effectiveness for online DNS. [ABSTRACT FROM AUTHOR]

The unique topic of allocating and scheduling tasks on a single machine in a multitasking environment is the main emphasis of this research, which also takes into account the effects of worsening maintenance and job-dependent aging effects. In this scenario, the performance and efficiency of the machine in handling different tasks should be symmetric, without significant bias due to the nature or size of the tasks. In a multitasking environment, waiting for jobs can disrupt the processing of the primary job being currently handled. As a result, the actual time required to complete a task becomes erratic and contingent upon the duration of the disruption. In addition to figuring out the best time for maintenance, where to put the due-window, and how big it should be in a multitasking environment, the primary objective is to minimize the costs associated with meeting due-window regulations. To tackle this problem, we propose two optimal algorithms. Additionally, we conduct numerical experiments to compare our approach with the classic due date assignment problem. Interestingly, we observe that in most cases, the average and minimum percentage costs tend to increase as the quantity of jobs increases. However, it is noteworthy that, when the number of jobs is relatively small, specifically when it does not exceed 20, there are instances where these costs decrease with an increase in the number of jobs. [ABSTRACT FROM AUTHOR]

High-throughput screening systems are robotic cells that automatically scan and analyze thousands of biochemical samples and reagents in real time. The problem under consideration is to find an optimal cyclic schedule of robot moves that ensures maximum cell performance. To address this issue, we proposed a new efficient version of the parametric PERT/CPM project management method that works in conjunction with a combinatorial subalgorithm capable of rejecting unfeasible schedules. The main result obtained is that the new fast PERT/CPM method finds optimal robust schedules for solving large size problems in strongly polynomial time, which cannot be achieved using existing algorithms. [ABSTRACT FROM AUTHOR]

The problem of the approximation of the coefficients of the objective function of a scheduling problem for a single machine is considered. It is necessary to minimize the total weighted completion times of jobs with unknown weight coefficients when a set of problem instances with known optimal schedules is given. It is shown that the approximation problem can be reduced to finding a solution to a system of linear inequalities for weight coefficients. For the case of simultaneous job release times, a method for solving the corresponding system of inequalities has been developed. Based on it, a polynomial algorithm for finding values of weight coefficients that satisfy the given optimal schedules was constructed. The complexity of the algorithm is O (n 2 (N + n)) operations, where n is the number of jobs and N is the number of given instances with known optimal schedules. The accuracy of the algorithm is estimated by experimentally measuring the function ε (N , n) = 1 n ∑ j = 1 n ∣ w j − w j 0 ∣ w j 0 , which is an indicator of the average modulus of the relative deviation of the found values w j from the true values w j 0 . An analysis of the results shows a high correlation between the dependence ε (N , n) and a function of the form α (n) / N , where α (n) is a decreasing function of n. [ABSTRACT FROM AUTHOR]

With the demand response and the massive access of distributed energy to the distribution network, it is possible to solve the transmission congestion problem by coordinating the controllable resources in a transmission network and distribution network. Aiming at resolving the problems of scattered side response resources and difficult-to-negotiate compensation prices, a bi-level optimal congestion scheduling strategy based on flexible load dynamic compensation prices is proposed. Under this strategy, the transmission network layer aims at minimizing the congestion cost and optimizes the adjustment scheme of the generator set and the node price. The active distribution network layer obtains the dynamic compensation price of the flexible load of the distribution network through the load characteristics and the node price. Through the interaction and coordination between the two layers, an optimal congestion scheduling scheme is obtained, and the transmission and distribution jointly solve the congestion problem. Based on the modified IEEE-39 experimental system, the effectiveness of the proposed strategy is verified via a simulation. [ABSTRACT FROM AUTHOR]

In this paper, we investigate a single machine scheduling problem with a proportional job deterioration. Under release times (dates) of jobs, the objective is to minimize the total weighted completion time. For the general condition, some dominance properties, a lower bound and an upper bound are given, then a branch-and-bound algorithm is proposed. In addition, some meta-heuristic algorithms (including the tabu search ( T S ), simulated annealing ( S A ) and heuristic ( N E H ) algorithms) are proposed. Finally, experimental results are provided to compare the branch-and-bound algorithm and another three algorithms, which indicate that the branch-and-bound algorithm can solve instances of 40 jobs within a reasonable time and that the N E H and S A are more accurate than the T S . [ABSTRACT FROM AUTHOR]

Background: The fraction of elderly people in the population is growing, the incidence of some cancers is increasing, and the number of available cancer treatments is evolving, causing a challenge to healthcare systems. New healthcare tools are needed, and wearable sensors could partly be potential solutions. The aim of this case report is to describe the Danish research experience with wearable sensors in oncology reporting from three oncological wearable research projects. Case studies: Three planned case studies investigating the feasibility of different wearable sensor solutions during cancer treatment are presented, focusing on study design, population, device, aim, and planned outcomes. Further, two actual case studies performed are reported, focusing on patients included, data collected, results achieved, further activities planned, and strengths and limitations. Results: Only two of the three planned studies were performed. In general, patients found the technical issues of wearable sensors too challenging to deal with during cancer treatment. However, at the same time it was demonstrated that a large amount of data could be collected if the framework worked efficiently. Conclusion: Wearable sensors have the potential to help solve challenges in clinical oncology, but for successful research projects and implementation, a setup with minimal effort on the part of patients is requested. [ABSTRACT FROM AUTHOR]

There exists a temporal and spatial coupling effect among the hydropower units in cascade hydropower stations which constitutes a complex planning problem. Researching the multi-objective optimization scheduling of cascade hydropower stations under various spatiotemporal inflow impacts is of significant importance. Previous studies have typically only focused on the economic dispatch issues of cascade hydropower stations, with little attention given to their coupling mechanism models and the uncertainty impacts of inflows. Firstly, this paper establishes a coupled optimization scheduling model for cascade hydropower stations and elaborates on the operational mechanism of cascade hydropower stations. Secondly, according to the needs of actual scenarios, two types of optimization objectives are set, considering both the supply adequacy and peak-shaving capacity as indicators, with the total residual load and the peak-valley difference of the residual load as comprehensive optimization objectives. Subsequently, considering the uncertainty impact of the inflow side, a stochastic optimization model for inflow is established based on a normal distribution probability. Finally, case study analyses demonstrate that the proposed model not only effectively achieves supply stability but also reduces the peak-valley difference in load, and can achieve optimized scheduling under the uncertain environment of inflow. [ABSTRACT FROM AUTHOR]

The automated design of dispatching rules (DRs) with genetic programming (GP) has become an important research direction in recent years. One of the most important decisions in applying GP to generate DRs is determining the features of the scheduling problem to be used during the evolution process. Unfortunately, there are no clear rules or guidelines for the design or selection of such features, and often the features are simply defined without investigating their influence on the performance of the algorithm. However, the performance of GP can depend significantly on the features provided to it, and a poor or inadequate selection of features for a given problem can result in the algorithm performing poorly. In this study, we examine in detail the features that GP should use when developing DRs for unrelated machine scheduling problems. Different types of features are investigated, and the best combination of these features is determined using two selection methods. The obtained results show that the design and selection of appropriate features are crucial for GP, as they improve the results by about 7% when only the simplest terminal nodes are used without selection. In addition, the results show that it is not possible to outperform more sophisticated manually designed DRs when only the simplest problem features are used as terminal nodes. This shows how important it is to design appropriate composite terminal nodes to produce high-quality DRs. [ABSTRACT FROM AUTHOR]

The increasing demand for storing various types of goods has led to a raise in the need for storage capacity in warehousing systems. Autonomous vehicle storage and retrieval systems (AVS/RSs) offer high flexibility by allowing different configurations to meet different storage requirements. The system mainly completes operations through elevators and multiple rail-guided vehicles (RGVs). This paper focuses on the scheduling optimization of compound operations in the AVS/RS to improve system performance. Compound operations involve the coordinated execution of both single-command and double-command operations. A mathematical model with compound operations was proposed and effectively decomposed into a horizontal component for RGVs and a vertical counterpart for the elevator, which can represent the operations of one elevator cooperating with multiple RGVs. The goal of this model was to minimize the makespan for compound operations and to determine the optimal operation sequence and path for RGVs. An improved discrete particle swarm optimization (DPSO) algorithm called AGDPSO was proposed to solve the model. The algorithm combines DPSO and a genetic algorithm in an adaptive manner to prevent the algorithm from falling into local optima and relying solely on the initial solution. Through rigorous optimization, optimal parameters for the algorithm were identified. When assessing the performance of our improved algorithm against various counterparts, considering different task durations and racking configurations, our results showed that AGDPSO outperformed the alternatives, proving its effectiveness in enhancing system efficiency for the model. The findings of this study not only contribute to the optimization of AVS/RS but also offer valuable insights for designing more efficient warehouses. By streamlining scheduling, improving operations, and leveraging advanced optimization techniques, we can create a more robust and effective storage and retrieval system. [ABSTRACT FROM AUTHOR]

In this paper, we consider different due-date assignment scheduling with group technology and resource allocation on a single machine, where the due date of each job may be different. Under constant processing times, the objective function is to minimize the scheduling cost (i.e., the weighted sum of earliness, tardiness, and due-date assignment cost, where the weights are position dependent). Under some optimal properties, we prove that this problem can be solved in  O (ζ log ζ)  time, where  ζ  is the number of jobs. The problem is also extended to cases which include linear and convex functions of the quantity of resource allocation. The objective function is minimizing the sum of the scheduling cost and the resource-consumption cost. For the special case of linear and convex functions, we show that the problem is polynomially solvable in  O (ζ 3)  time. [ABSTRACT FROM AUTHOR]

The imperative for swift and intelligent decision making in production scheduling has intensified in recent years. Deep reinforcement learning, akin to human cognitive processes, has heralded advancements in complex decision making and has found applicability in the production scheduling domain. Yet, its deployment in industrial settings is marred by large state spaces, protracted training times, and challenging convergence, necessitating a more efficacious approach. Addressing these concerns, this paper introduces an innovative, accelerated deep reinforcement learning framework—VSCS (Variational Autoencoder for State Compression in Soft Actor–Critic). The framework adeptly employs a variational autoencoder (VAE) to condense the expansive high-dimensional state space into a tractable low-dimensional feature space, subsequently leveraging these features to refine policy learning and augment the policy network's performance and training efficacy. Furthermore, a novel methodology to ascertain the optimal dimensionality of these low-dimensional features is presented, integrating feature reconstruction similarity with visual analysis to facilitate informed dimensionality selection. This approach, rigorously validated within the realm of crude oil scheduling, demonstrates significant improvements over traditional methods. Notably, the convergence rate of the proposed VSCS method shows a remarkable increase of 77.5 % , coupled with an 89.3 % enhancement in the reward and punishment values. Furthermore, this method substantiates the robustness and appropriateness of the chosen feature dimensions. [ABSTRACT FROM AUTHOR]

The extensive consumption of energy in manufacturing has led to a large amount of greenhouse gas emissions that have caused an enormous effect on the environment. Therefore, investigating how to reduce energy consumption in manufacturing is of great significance to cleaner production. This paper considers an energy-conscious unrelated parallel batch processing machine scheduling problem under time-of-use (TOU) electricity prices. Under TOU, electricity prices vary for different periods of a day. This problem is grouping jobs into batches, assigning the batches to machines and allocating time to the batches so as to minimize the total electricity cost. A mixed-integer linear programming model and two groups of heuristics are proposed to solve this problem. The first group of heuristics first forms batches, assigns the batches to machines and finally allocates time to the batches, while the second group of heuristics first assigns jobs to machines, batches the jobs on each machine and finally allocates time to each batch. The computational results show that the SPT-FBLPT-P1 heuristic in the second group can provide high-quality solutions for large-scaled instances in a short time, in which the jobs are assigned to the machines based on the shortest processing time rule, the jobs on each machine are batched following the full-batch longest processing time algorithm, and the time is allocated to each batch following an integer programming approach. The MDEC-FBLPT-P1 heuristic that uses the minimum difference of the power consumption algorithm to assign the jobs also performed well. [ABSTRACT FROM AUTHOR]

To operate the grid-connected renewable energy system economically, this study presents a dual-stage optimization scheduling model for grid-connected systems with hybrid energy storage, including day-ahead and intra-days stages. In the day-ahead stage, an economically optimal scheduling model is developed, considering the price peak-to-valley difference. This model aims to enhance the economic efficiency of the system by utilizing hybrid energy storage. In the intra-day stage, more accurate renewable energy forecasts with a shorter time scale are considered. The objectives are to minimize the curtailment rate of renewable energy and to track the day-ahead scheduling outcomes. The NSGA-II algorithm is employed for multi-objective optimization, achieving equilibrium solutions considering multiple optimization objectives. Compared to other published works, the proposed model achieves a balance between different optimization objectives, enabling the system to operate economically and stably. It provides a comprehensive approach to optimize the scheduling of grid-connected systems with hybrid energy storage by considering both economic and operational aspects. Overall, this proposed dual-stage optimization model presents a viable approach to improve economic efficiency and mitigate renewable energy curtailment in grid-connected systems. By effectively integrating renewable energy sources and optimizing their utilization, this model contributes to enhancing the sustainability and optimal operation of the power grid. [ABSTRACT FROM AUTHOR]

This study focuses on the scheduling problem of heterogeneous unmanned surface vehicles (USVs) with obstacle avoidance pretreatment. The goal is to minimize the overall maximum completion time of USVs. First, we develop a mathematical model for the problem. Second, with obstacles, an A* algorithm is employed to generate a path between two points where tasks need to be performed. Third, three meta-heuristics, i.e., simulated annealing (SA), genetic algorithm (GA), and harmony search (HS), are employed and improved to solve the problems. Based on problem-specific knowledge, nine local search operators are designed to improve the performance of the proposed algorithms. In each iteration, three Q-learning strategies are used to select high-quality local search operators. We aim to improve the performance of meta-heuristics by using Q-learning-based local search operators. Finally, 13 instances with different scales are adopted to validate the effectiveness of the proposed strategies. We compare with the classical meta-heuristics and the existing meta-heuristics. The proposed meta-heuristics with Q-learning are overall better than the compared ones. The results and comparisons show that HS with the second Q-learning, HS + QL2, exhibits the strongest competitiveness (the smallest mean rank value 1.00) among 15 algorithms. [ABSTRACT FROM AUTHOR]

Mission scheduling is an effective method to increase the value of satellite missions and can greatly improve satellite resource management and quality of service. Based on the priority-based task scheduling model, this paper proposes a CubeSat scheduling method that takes operational reliability into account, considering the impact of scheduling results on reliable operation. In this method, the available energy and the time window are used as scheduling resources, and the average state of charge of the lithium battery and the number of task start-ups are defined as two indices to measure its reliability. To meet the mission requirements and energy availability of photovoltaic (PV) solar panel and battery constraints, the scheduling model is constructed with an objective function that includes mission priority and reliability index. The branch and bound (BB) method and analytical hierarchy process (AHP) method are used to solve the scheduling problem. The example analysis compares different scheduling results and verifies the effectiveness of the proposed scheduling method. Compared with the existing methods, it comprehensively considers the mission value and operational reliability of the CubeSat, improves the energy reserve level of the CubeSat, and reduces the surge current caused by the start-up of tasks. [ABSTRACT FROM AUTHOR]

Dynamic scheduling represents an important class of combinatorial optimisation problems that are usually solved with simple heuristics, the so-called dispatching rules (DRs). Designing efficient DRs is a tedious task, which is why it has been automated through the application of genetic programming (GP). Various approaches have been used to improve the results of automatically generated DRs, with ensemble learning being one of the best-known. The goal of ensemble learning is to create sets of automatically designed DRs that perform better together. One of the main problems in ensemble learning is the selection of DRs to form the ensemble. To this end, various ensemble construction methods have been proposed over the years. However, these methods are quite computationally intensive and require a lot of computation time to obtain good ensembles. Therefore, in this study, we propose several simple heuristic ensemble construction methods that can be used to construct ensembles quite efficiently and without the need to evaluate their performance. The proposed methods construct the ensembles solely based on certain properties of the individual DRs used for their construction. The experimental study shows that some of the proposed heuristic construction methods perform better than more complex state-of-the-art approaches for constructing ensembles. [ABSTRACT FROM AUTHOR]

To realize the low-carbon operation of integrated energy systems (IESs), this paper proposes a low-carbon optimal scheduling method. First of all, considering the integrated demand response of price-based electricity and heating, an economic scheduling model of the IES integrated demand response based on chance-constrained programming is proposed to minimize the integrated operating cost in an uncertain environment. Through the comprehensive demand response model, the impact of the demand response ratio on the operating economy of the IES is explored. Afterward, the carbon emission index is introduced, and gas turbines and energy storage devices are used as the actuators of multi-energy coupling to further explore the potential interactions between the coupling capacities of various heterogeneous energy sources and carbon emissions. Finally, the original uncertainty model is transformed into a mixed-integer linear-programming model and solved using sequence operation theory and the linearization method. The results show that the operating economy of the IES is improved by coordinating the uncertainty of the integrated demand response and renewable energy. In addition, the tradeoff between the working economy and reliability of the EIS can be balanced via the setting of an appropriate confidence level for the opportunity constraints. [ABSTRACT FROM AUTHOR]

This study investigates the worst-case performance guarantee of locally optimal solutions to minimize the total weighted completion time on uniformly related parallel machines. The investigated neighborhood structure is Jump, also called insertion or move. This research focused on establishing the local optimality condition expressed as an inequality and mapping that maps a schedule into an inner product space so that the norm of the mapping is closely related to the total weighted completion time of the schedule. We determine two new upper bounds for the performance guarantee, which take the form of an expression based on parameters that describe the family of instances: the speed of the fastest machine, the speed of the slowest machine, and the number of machines. These new bounds outperform the parametric upper bound previously established in the existing literature and enable a better understanding of the performance of the solutions obtained for the Jump neighborhood in this scheduling problem, according to parameters that describe the family of instances. [ABSTRACT FROM AUTHOR]

Due to the problem of large latency and energy consumption of fog computing in smart community applications, the fog computing task-scheduling method based on Hybrid Ant Lion Optimizer (HALO) is proposed in this paper. This method is based on the Ant Lion Optimizer (ALO. Firstly, chaotic mapping is adopted to initialize the population, and the quality of the initial population is improved; secondly, the Adaptive Random Wandering (ARW) method is designed to improve the solution efficiency; finally, the improved Dynamic Opposite Learning Crossover (DOLC) strategy is embedded in the generation-hopping stage of the ALO to enrich the diversity of the population and improve the optimization-seeking ability of ALO. HALO is used to optimize the scheduling scheme of fog computing tasks. The simulation experiments are conducted under different data task volumes, compared with several other task scheduling algorithms such as the original algorithm of ALO, Genetic Algorithm (GA), Whale Optimizer Algorithm (WOA) and Salp Swarm Algorithm (SSA). HALO has good initial population quality, fast convergence speed, and high optimization-seeking accuracy. The scheduling scheme obtained by the proposed method in this paper can effectively reduce the latency of the system and reduce the energy consumption of the system. [ABSTRACT FROM AUTHOR]

Nowadays, multi-access edge computing (MEC) has been widely recognized as a promising technology that can support a wide range of new applications for the Internet of Things (IoT). In dynamic MEC networks, the heterogeneous computation capacities of the edge servers and the diversified requirements of the IoT applications are both asymmetric, where and when to offload and schedule the time-dependent tasks of IoT applications remains a challenge. In this paper, we propose a flexible offloading and task scheduling scheme (FLOATS) to adaptively optimize the computation of offloading decisions and scheduling priority sequences for time-dependent tasks in dynamic networks. We model the dynamic optimization problem as a multi-objective combinatorial optimization problem in an infinite time horizon, which is intractable to solve. To address this, a rolling-horizon-based optimization mechanism is designed to decompose the dynamic optimization problem into a series of static sub-problems. A genetic algorithm (GA)-based computation offloading and task scheduling algorithm is proposed for each static sub-problem. This algorithm encodes feasible solutions into two-layer chromosomes, and the optimal solution can be obtained through chromosome selection, crossover and mutation operations. The simulation results demonstrate that the proposed scheme can effectively reduce network costs in comparison to other reference schemes. [ABSTRACT FROM AUTHOR]

Real-time performance and reliability are two critical indicators in cyber–physical production systems (CPPS). To meet strict requirements in terms of these indicators, it is necessary to solve complex job-shop scheduling problems (JSPs) and reserve considerable redundant resources for unexpected jobs before production. However, traditional job-shop methods are difficult to apply under dynamic conditions due to the uncertain time cost of transmission and computation. Edge computing offers an efficient solution to this issue. By deploying edge servers around the equipment, smart factories can achieve localized decisions based on computational intelligence (CI) methods offloaded from the cloud. Most works on edge computing have studied task offloading and dispatching scheduling based on CI. However, few of the existing methods can be used for behavior-level control due to the corresponding requirements for ultralow latency (10 ms) and ultrahigh reliability (99.9999% in wireless transmission), especially when unexpected computing jobs arise. Therefore, this paper proposes a dynamic resource prediction scheduling (DRPS) method based on CI to achieve real-time localized behavior-level control. The proposed DRPS method primarily focuses on the schedulability of unexpected computing jobs, and its core ideas are (1) to predict job arrival times based on a backpropagation neural network and (2) to perform real-time migration in the form of human–computer interaction based on the results of resource analysis. An experimental comparison with existing schemes shows that our DRPS method improves the acceptance ratio by 25.9 % compared to the earliest deadline first scheme. [ABSTRACT FROM AUTHOR]

This study investigated the effect of concern about falling on neural efficiency during stepping in older people. Community-dwellers aged >65 years were categorised as having low (n = 71) and high (n = 28) concerns about falling based on the Iconographical Falls Efficacy Scale (IconFES 10-item, scores <19 and ≥19, respectively). Participants performed a choice stepping reaction time test (CSRT), an inhibitory CSRT (iCSRT), and a Stroop stepping test (SST)) on a computerised step mat. Cortical activity was recorded using functional near-infrared spectroscopy. There were no significant differences in stepping response times or cortical activity in the dorsolateral prefrontal cortex (DLPFC), supplementary motor area (SMA), and premotor cortex (PMC) between those with and without concern about falling. However, stepping response times and cortical activity in the PFC, SMA, and PMC were significantly higher in the SST compared with the CSRT in the whole sample. PMC activity was also higher in the SST compared to the iCSRT. These findings demonstrate that cortical activity is higher in cognitively demanding stepping tasks that require selective attention and inhibition in healthy older people. The lack of association between concern about falling and neural efficiency during stepping in this older sample may reflect their only moderate scores on the IconFES. [ABSTRACT FROM AUTHOR]

Green scheduling that aims to enhance efficiency by optimizing resource allocation and job sequencing concurrently has gained growing academic attention. To tackle such problems with the consideration of scheduling and resource allocation, this paper considers a single-machine group scheduling problem with common/slack due-date assignment and a controllable processing time. The objective is to decide the optimized schedule of the group/job sequence, resource allocation, and due-date assignment. To solve the generalized case, this paper proves several optimal properties and presents a branch-and-bound algorithm and heuristic algorithms. Numerical experiments show that the branch-and-bound algorithm is efficient and the heuristic algorithm developed based on the analytical properties outruns the tabu search. [ABSTRACT FROM AUTHOR]

In recent years, with the rapid growth in the number of electric vehicles (EVs), the large-scale grid connection of EVs has had a profound impact on the power grid. As a flexible energy storage resource, EVs can participate in auxiliary services of the power grid via vehicle-to-grid (V2G) technology. Due to the uncertainty of EVs accessing the grid, it is difficult to accurately control their charging and charging behaviors at both the day-ahead and real-time stages. Aiming at this problem, this paper proposes a two-stage scheduling strategy framework for EVs. In the presented framework, according to historical driving data, a day-ahead scheduling model based on distributionally robust optimization (DRO) is first established to determine the total power plan. In the real-time scheduling stage, a real-time scheduling model based on model predictive control (MPC) is established to track the day-ahead power plan. It can reduce the impact of EVs' uncertainties. This strategy can ensure the charging demand of users is under the control of the charging and discharging behaviors of EVs, which can improve the accuracy of controlling EVs. The case study shows that the scheduling strategy can achieve accurate and fast control of charging and discharging. At the same time, it can effectively contribute to the security and stability of grid operations. [ABSTRACT FROM AUTHOR]

The random output of renewable energy and the disorderly grid connection of electric vehicles (EV) will pose challenges to the safe and stable operation of the power system. In order to ensure the reliability and symmetry of the microgrid operation, this paper proposes a microgrid optimization scheduling strategy considering the access of EVs. Firstly, in order to reduce the impact of random access to EVs on power system operation, a schedulable model of an EV cluster is constructed based on the Minkowski sum. Then, based on the wavelet neural network (WNN), the renewable energy output is predicted to reduce the influence of its output fluctuation on the operation of the power system. Considering the operation constraints of each unit in the microgrid, the network active power loss and node voltage deviation are taken as the optimization objectives, and the established microgrid model is equivalently transformed via second-order cone relaxation to improve its solution efficiency. Based on network reconfiguration and flexible load participation in demand response, the economy and reliability of system operation are improved. Finally, the feasibility and effectiveness of the proposed method are verified based on the simulation examples. [ABSTRACT FROM AUTHOR]

The backfill mining method is adopted in many mines around the world because it can reliably handle underground mine tailings and eliminate dangers in goafs. It is necessary to improve backfilling resource allocation and efficiency, thereby eliminating safety hazards and providing reliable support for the next stage of mining as quickly as possible. In this paper, we propose a backfill-scheduling optimization model that considers multiple processes, resource constraints, and operating capabilities. The purpose of this model is to minimize the exposure time of goafs. This NP-hard (Nondeterministic Polynomial-time hard) problem has a non-inferior implemented solution through multiple iterations of genetic, crossover, and mutation operations of the genetic algorithm. The results show that the model significantly reduces the backfilling-delay time and backfilling-operation time. [ABSTRACT FROM AUTHOR]

The economy and energy saving effects of integrated energy system dispatch plans are influenced by the coupling of different energy devices. In order to consider the impact of changes in equipment load rates on the optimization and scheduling of the system under long-term operation, a method for energy and component cycle optimization considering energy device capacity and load has been proposed. By improving the initial parameters of the components, energy economic parameters, and operational optimization parameters, the system is subjected to long-term scheduling and multi-cycle operational optimization analysis to evaluate the energy saving and emission reduction potential as well as the economic feasibility of the system. Finally, through numerical analysis, the effectiveness of this optimization approach in achieving energy savings, emission reductions, and cost benefits for the system is validated. Furthermore, compared to existing optimization methods, this approach also assesses the economic feasibility of the system. The case study resulted in a pre-tax IRR of 23.14% and a pre-tax NPV of 66.38 million. It is inferred that the system could generate profits over a 10-year operation period, thereby offering a more rational and cost-effective scheduling scheme for the integrated energy system. [ABSTRACT FROM AUTHOR]

Order scheduling is of a great significance in the internet and communication industries. With the rapid development of the communication industry and the increasing variety of user demands, the number of work orders for communication operators has grown exponentially. Most of the research that tries to solve the order scheduling problem has focused on improving assignment rules based on real-time performance. However, these traditional methods face challenges such as poor real-time performance, high human resource consumption, and low efficiency. Therefore, it is crucial to solve multi-objective problems in order to obtain a robust order scheduling policy to meet the multiple requirements of order scheduling in real problems. The priority dispatching rule (PDR) is a heuristic method that is widely used in real-world scheduling systems In this paper, we propose an approach to automatically optimize the Priority Dispatching Rule (PDR) using a deep multiple-objective reinforcement learning agent and to optimize the weighted vector with a convex hull to obtain the most objective and efficient weights. The convex hull method is employed to calculate the maximal linearly scalarized value, enabling us to determine the optimal weight vector objectively and achieve a balanced optimization of each objective rather than relying on subjective weight settings based on personal experience. Experimental results on multiple datasets demonstrate that our proposed algorithm achieves competitive performance compared to existing state-of-the-art order scheduling algorithms. [ABSTRACT FROM AUTHOR]

This paper proposes a time- and event-triggered hybrid scheduling for remote state estimation with limited communication resources. A smart sensor observes a physical process and decides whether to send the local state estimate to a remote estimator via a wireless communication channel; the estimator computes the state estimate of the process according to the received data packets and the known scheduling mechanism. Based on the existing optimal time-triggered scheduling, we employ a stochastic event trigger to save precious communication chances and further improve the estimation performance. The minimum mean-squared error (MMSE) state estimate is derived since the Gaussian property is preserved. The estimation performance upper bound and communication rate are analyzed. The main results are illustrated by numerical examples. [ABSTRACT FROM AUTHOR]

This research studies the Field Technician Scheduling Problem with Experience-Dependent Service Times (FTSP–EDST), involving three main features: matching maintenance tasks with available technicians, sequencing the tasks, and considering the experience-dependent service times. Given a limited number of technicians, the objective is to maximize the collected profit for servicing tasks. This study formulates the problem as a mixed-integer linear programming model and proposes a Modified Iterated Local Search (MILS) to solve the benchmark problem instances of various sizes. A set of FTSP–EDST instances is generated based on existing publicly accessible data, and MILS is utilized to solve these newly generated instances. Computational results confirm the effectiveness of MILS in solving FTSP–EDST. [ABSTRACT FROM AUTHOR]

Population health monitoring based on the Internet of Medical Things (IoMT) is becoming an important application trend healthcare improvement. This work aims to develop an autonomous network architecture, collecting sensor data with a cluster topology, forwarding information through relay nodes, and applying edge computing and transmission scheduling for network scalability and operational efficiency. The proposed distributed network architecture incorporates data compression technologies and effective scheduling algorithms for handling the transmission scheduling of various physiological signals. Compared to existing scheduling mechanisms, the experimental results depict the network performance and show that in analyzing the delay and jitter, the proposed WFQ-based algorithms have reduced the delay and jitter ratio by about 40% and 19.47% compared to LLQ with priority queueing scheme, respectively. The experimental results also demonstrate that the proposed network topology is more effective than the direct path transmission approach in terms of energy consumption, which suggests that the proposed network architecture may improve the development of medical applications with body area networks such that the goal of self-organizing population health monitoring can be achieved. [ABSTRACT FROM AUTHOR]

Over the last decade, the Age of Information has emerged as a key concept and metric for applications where the freshness of sensor-provided data is critical. Limited transmission capacity has motivated research on the design of tractable policies for scheduling information updates to minimize Age of Information cost based on Markov decision models, in particular on the restless multi-armed bandit problem (RMABP). This allows the use of Whittle's popular index policy, which is often nearly optimal, provided indexability (index existence) is proven, which has been recently accomplished in some models. We aim to extend the application scope of Whittle's index policy in a broader AoI scheduling model. We address a model with no buffers incorporating random packet arrivals, unreliable channels, and nondecreasing AoI costs. We use sufficient indexability conditions based on partial conservation laws previously introduced by the author to establish the model's indexability and evaluate its Whittle index in closed form under discounted and average cost criteria. We further use the index formulae to draw insights on how scheduling priority depends on model parameters. [ABSTRACT FROM AUTHOR]

The type-2 multi-objective integrated process planning and scheduling problem, as an NP-hard problem, is required to deal with both process planning and job shop scheduling, and to generate optimal schedules while planning optimal machining paths for the workpieces. For the type-2 multi-objective integrated process planning and scheduling problem, a mathematical model with the minimization objectives of makespan, total machine load, and critical machine load is developed. A multi-objective mayfly optimization algorithm with decomposition and adaptive neighborhood search is designed to solve this problem. The algorithm uses two forms of encoding, a transformation scheme designed to allow the two codes to switch between each other during evolution, and a hybrid population initialization strategy designed to improve the quality of the initial solution while taking into account diversity. In addition, an adaptive neighborhood search cycle based on the average distance of the Pareto optimal set to the ideal point is designed to improve the algorithm's merit-seeking ability while maintaining the diversity of the population. The proposed encoding and decoding scheme can better transform the continuous optimization algorithm to apply to the combinatorial optimization problem. Finally, it is experimentally verified that the proposed algorithm achieves better experimental results and can effectively deal with type-2 MOIPPS. [ABSTRACT FROM AUTHOR]

Photovoltaic (PV) power generation exhibits stochastic and uncertain characteristics. In order to improve the economy and reliability of a photovoltaic-energy storage system (PV-ESS), it is crucial to optimize both the energy storage capacity size and the charging and discharging strategies of the ESS. An optimal scheduling model for PV-ESS is proposed in this paper, comprehensively considering factors in terms of energy cost and charging/discharging constraints of the PV-ESS. Moreover, the model employs a particle swarm optimization-backpropagation (PSO-BP) neural network to predict the PV power using historical generation data from a factory in Xiamen. The proposed two PV-ESS scheduling strategies are compared under three weather conditions. In the demand management strategy, the ESS can flexibly respond to different weather conditions and load demand changes, and effectively reduce the electricity cost for users. [ABSTRACT FROM AUTHOR]