Search

With the rapid development of biometric technology, an increasing number of application scenarios require biometric identification systems for identity authentication, such as cell phones, gate control, and banks. The performance and operational efficiency of bioidentification systems directly impact their effectiveness in application scenarios. Traditional bioidentification technology requires a large number of devices and sites to build bioidentification systems. Bioidentification simulation model technology based on lightweight containers can simulate bioidentification systems in different scenarios through virtualization technology, which can save hardware costs while enabling efficient testing and debugging. In this context, improving the operational efficiency of bioidentification simulation models has become an important research direction. In this paper, efficient scheduling technology for a bioidentification simulation model based on lightweight containers is investigated to explore how to use container technology to improve the operational efficiency and security of the bioidentification simulation model to better serve modern bioidentification applications. For a 4-core 4G light load, the results show that the response time based on the resource scheduling strategy was 30 ms and the throughput was 30 requests per second; in contrast, the response time based on the load scheduling strategy was 45 ms, and the throughput was 27 requests per second. The system performance with the resource scheduling strategy under the same load with identical containers was significantly better than that under the load scheduling strategy. By using lightweight container technology, the operational efficiency of the bioidentification simulation model can be effectively improved while also improving the security of the system. [ABSTRACT FROM AUTHOR]

Nowadays, with the rapid expansion of cloud computing technology in processing Internet of Things (IoT) workloads, the demand for data centers has significantly increased, leading to a surge in CO2 emissions, power consumption, and global warming. As a result, extensive research and initiatives have been undertaken to tackle this problem. Two specific approaches focus on enhancing workload scheduling, a complex problem known as NP-Hard, and integrating scheduling into scientific workflows. In this investigation, we present a multi-objective Crow Search Algorithm (CSA) for optimizing both makespan and costs in scientific cloud workflows (CSAMOMC). We conduct a comparative analysis between our approach and the well-known HEFT and TC3pop algorithms, which are commonly used for reducing makespan and optimizing costs. Our findings demonstrate that CSAMOMC is capable of achieving an average makespan reduction of 4.42% and a cost reduction of 4.77% when compared to the aforementioned algorithms. [ABSTRACT FROM AUTHOR]

Demand for imaging of large area targets by space-based assets such as constellations of Earth Observation Satellites (EOS) is on the rise for different applications. The area targets coverage cannot be achieved by a single satellite in a single observation opportunity, as the region for imaging spreads wider than the coverage swaths of imaging sensors. Hence, the imaging satellites are scheduled in a cooperative way to achieve maximum coverage of the area in a given planning time horizon. The scheduling algorithms also aim to maximize or minimize some specific objectives of interest while simultaneously complying with all resource constraints for an efficient use of precious space resources. As the current generation satellites are highly agile, there are many ways of choosing an imaging location in the target area for each single observation opportunity of a satellite. Even though the possible imaging region in continuous space is discretized into a finite number of strips for each observation, the huge combinatorial search space formed with all satellites' imaging opportunities makes the problem intractable. Thus, the area target imaging scheduling is a complex combinatorial NP-hard optimization problem. Many exact and heuristic methods were evolved to provide a solution to this scheduling problem. Even though the exact methods solve the problem to optimality, they are limited to smaller problem instances because of the high computational complexities involved in those methods. More focus is seen in the literature on heuristic approaches as they guarantee scheduling performance with feasible solutions within an acceptable computational complexity. This paper presents our efficient heuristic approach proposed for the scheduling problem for imaging a large area target using a constellation of multiple satellites. Our approach is an extension of a widely used greedy approach in combination with insights from dynamic programming. In this paper, first we addressed the scheduling problem by describing it in detail and formulating it into a non-linear integer programming problem, considering the multi-objectives of achieving maximum coverage and minimum imaging resolution. The solution to the problem comprises two phases, namely the area decomposition phase and the scheduling phase. In the area decomposition phase, the area target is divided into strips dynamically for each observation opportunity of a satellite. Then exact observation period of each strip is computed using a simplified semi-analytical computational method. In the scheduling phase, we applied our heuristic search strategy, namely Forward and Backward Heuristic Search (FBHS) to obtain a near optimal solution within an acceptable computational time. Through the extensive simulations conducted under various scenarios, the effectiveness of the proposed method is verified in comparison with the baseline greedy approach. • The large area target imaging scheduling for multiple satellites is a complex combinatorial NP hard optimization problem. • Greedy algorithm, which guarantee the scheduling performance, is a widely used method. • Forward and Backward Heuristic Search method is proposed for area target image scheduling. [ABSTRACT FROM AUTHOR]

The amount of space debris is rising rapidly, and the number of satellites launched by humans is also growing. This poses a serious threat to the security of many important space assets including the International Space Station and the China Space Station. Due to the frequent occurrence of hazardous space conjunction (potential collisions) events, we aim to use a constellation composed of a few optical satellites to observe these space dangerous conjunction events, thereby improving the observation accuracy and timeliness of key conjunction events. We consider a variety of factors to establish an optical nanosatellite constellation design model, develop constellation observation efficiency evaluation criteria, construct a constellation configuration evaluation function, and design the performance parameters of space-based optical telescopes. The optimal orbit parameters and constellation configuration are obtained by using the genetic algorithm for optimization calculation. It is determined that a constellation of 6 satellites can track and observe more than 96% of potentially dangerous conjunction objects 24–48 h before a dangerous conjunction occurs. According to the observation data, high-precision orbit information of space objects can be obtained, which can reduce the collision false alarm rate by 99%. As a result, operators are notified to take collision avoidance measures only when the space object is truly in danger. This approach greatly reduces the number of avoidance operations caused by false early warnings, lowers the operating cost of space assets, and ensures the safety of space assets. [ABSTRACT FROM AUTHOR]

Optimization of scheduling problems that involve single or multiple machines with a multimodal objective function and linear or non-linear constraints are generally NP-Hard. The Artificial Bee Colony (ABC) algorithm is a metaheuristic proposed about eighteen years ago and has gained popularity in the swarm intelligence-based evolutionary computation approaches. Various scheduling requirements in diverse domains viz. Electric Vehicle charging, Operating Room, Nurse, Automatic Guided Vehicle (AGV), production, manufacturing, hydrothermal, Printed Circuit Board (PCB), and call centre scheduling are studied. The NP-Hard nature of these scheduling problems render exact methods incompetent for large problem instances thus requiring meta-heuristics such as ABC to produce feasible solutions in a reasonable computation time. The adaptation of ABC in these domains and the outcomes and performance of ABC are highlighted. Based on the case studies, it is found that the requirements of scheduling problems that would benefit from ABC are those that have a planning horizon requiring a near-optimal solution in a reasonably fast time when run on minimal computing capacity. Future works that would merit the application and enhancement of existing ABC techniques are proposed. The case studies presented in this paper motivate R&D Engineers and young researchers to apply ABC techniques of optimization and scheduling in different research topics for achieving energy and cost efficiency. [ABSTRACT FROM AUTHOR]

We have recently witnessed the rapid development of several emerging technologies, including the internet of things, which lead to a high interest in wireless sensor networks. Tiny sensor nodes are now important parts of a large number of complex systems, with numerous applications, including military, environment monitoring, and surveillance and body area sensor networks. A wireless sensor network builds the core part for IoT. Besides this, lifetime maximization is the biggest challenge in the wireless sensor network. Also, In a wireless sensor network, it is difficult to find an optimal node deployment approach that would minimize costs, be robust to node failures, decrease computing overhead and communication, and maintain a high degree of coverage and network connectivity. There is numerous literature addressed this challenge which is discussed in this paper; still there are lot many challenges yet to be addressed. Considering this scenario, in this paper, we propose a scheduled-based node deployment algorithm using Firefly Optimization (FA) to offer a circumstance where we have a group of target points that satisfy p-coverage and sensor nodes that satisfy q-connectivity, with subject to the selection of the optimal number of a sensor node that has the highest energy and minimum distance. The multiple parameters as no. of sensor nodes, distance, survivability factors, coverage, and connectivity of the sensor nodes are considered for designing the fitness function. A comprehensive statistical analysis is done using the simulation results to prove the proposed scheme's efficiency with other existing state-of-the-art methods under various p-coverage and q-connectivity configurations. [ABSTRACT FROM AUTHOR]

Over the years, the finance-based and resource-constrained project scheduling problem (FBRCPSP) has been aimed at scheduling activities and offsetting the capital gap without exceeding credit and renewable resource limits in capital-driven construction projects. However, the heuristics proposed for the FBRCPSP in previous studies neglected to focus on identifying efficient priority rules, which are understandable and intuitive for construction practitioners with different roles. Accordingly, this study explores efficient priority rules and evaluates their performance according to modified serial and parallel schedule generation scheme heuristics for the FBRCPSP. First, 11 priority rules that cover the project network, schedule, activity, and resource information are introduced, and three priority rules related to activity information are designed. Second, the two priority rule-based heuristics are applied in an example to generate multiple project schedules according to the different combinations of priority rules and heuristics. Furthermore, the performance of priority rules is tested on the metrics of project duration and profit through numerical experiments. The results show that the priority rules of the latest start time, latest finish time, and old great rank positional weight are the three best priority rules in general. Additionally, the priority rules evenly present more stable and superior results than those obtained by other priority rules for the different levels of weekly fixed overhead cost and the scenarios of contract terms. Based on the intuitive heuristics, the selected efficient priority rules assist contractors in deciding which priority rule should be applied in practice, and project managers can employ an effective priority rule to establish a baseline schedule in the initial project phase and quickly adjust the plan when it becomes infeasible for project execution. This study evaluates the performance of frequently used priority rules on finance-based and resource-constrained project scheduling heuristics in construction project management. The model and priority rule-based heuristics can be embedded into project management software or digitalized scheduling platforms in practice. Moreover, project managers can employ efficient priority rule-based heuristics to generate a desirable project schedule for mastering cash flow and resource-demand plans in the project planning stage. Intuitive priority rules are incorporated into the heuristics to quickly adjust or update schedules and financing alternatives for project management when a baseline schedule is disrupted during the project execution. In addition, practitioners can obtain more adaptive or efficient priority rules following the testing approach proposed in this work if they have rich similar project experience or big data in construction projects. In summary, this study offers construction project schedulers or managers practical scheduling strategies and approaches for addressing finance-based and resource-constrained construction projects. [ABSTRACT FROM AUTHOR]

With the widespread adoption of electric vehicles (EVs), the demand for public charging services is steadily increasing. Consequently, the development of effective charging scheduling strategies, aimed at optimizing the utilization of limited charging infrastructure, has become a key problem. Considering the diversity of user demands, we propose a Cost-Aware Charging Scheduling Architecture (CASA). This architecture considers both urgent and nonurgent charging customers by designing two charging modes with different power levels and associated costs. However, optimizing multiple objectives simultaneously while ensuring the interests of all parties involved in the charging demand response presents a challenge. Moreover, the uncertainty in customer charging demands and Time-of-Use (TOU) tariff further complicates the establishment of the model. To address the aforementioned challenges, this study formulates EV charging scheduling as a Markov Decision Process (MDP) based on deep reinforcement learning (DRL), employing the Deep Q-Network (DQN) algorithm for solution derivation. The objective is to minimize the operational costs of charging stations while ensuring the quality of service (QoS) requirements for customers. The simulation results demonstrate that CASA exhibits superior performance in optimizing both the average response time and service success rate, compared to commonly used baselines for charging scheduling. Furthermore, the CASA approach achieves a significant reduction in operating costs of EV charging station. [ABSTRACT FROM AUTHOR]

AbstractThis paper investigates a scheduling imperfect maintenance policy for an operating system that works at random times for multiple jobs (n tandem jobs or n parallel jobs). We consider the system suffers from type-I failure which is corrected by a minimal repair, or type-II failure, which is disaster and is eliminated by a corrective maintenance. To control the deterioration process, preventive maintenance is design to go through at a scheduling time T or the completion of multiple jobs, whichever occurs last. Each maintenance is performed imperfectly, the system improves yet its failure characteristic is also changed after maintenance. Lastly, the system is displaced at the N-th maintenance. On the basis minimizes the mean cost rate, this paper derived the optimal scheduling parameters (T*, n*, N*) analytically and numerically, according to its existence and uniqueness. The models we proposed will provide a general structure for maintenance theory of reliability. [ABSTRACT FROM AUTHOR]

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]

Brain machine interfaces (BMIs) can substantially improve the quality of life of elderly or disabled people. However, performing complex action sequences with a BMI system is onerous because it requires issuing commands sequentially. Fundamentally different from this, we have designed a BMI system that reads out mental planning activity and issues commands in a proactive manner. To demonstrate this, we recorded brain activity from freely-moving monkeys performing an instructed task and decoded it with an energy-efficient, small and mobile field-programmable gate array hardware decoder triggering real-time action execution on smart devices. Core of this is an adaptive decoding algorithm that can compensate for the day-by-day neuronal signal fluctuations with minimal re-calibration effort. We show that open-loop planning-ahead control is possible using signals from primary and pre-motor areas leading to significant time-gain in the execution of action sequences. This novel approach provides, thus, a stepping stone towards improved and more humane control of different smart environments with mobile brain machine interfaces. [ABSTRACT FROM AUTHOR]

The generation maintenance scheduling deals with a time sequence of preventive maintenance outages for a given set of generation units in an electricity market subject to power system restrictions. Incorporating a leader–follower structure in generation maintenance scheduling models is essential because of the inherent conflict between the interests of an independent system operator (ISO) and generation companies (GENCOs). The present paper proposes a new preventive maintenance scheduling model for generation companies facing the risk of involving generation units' disruption and demand variations while ensuring the reliability of the power system. Each GENCO proposes the maintenance schedule of its generation units to the ISO in a non-cooperative manner intending to maximize its net profit. Then ISO reacts to the aggregated schedule according to the power system's reliability index. Thus, a new formula is developed to consider all the interactions between the power system's stakeholders. In this regard, a stochastic multi-leader one-follower approach is applied. The GENCOs are considered independent leaders at the upper-level and the ISO is considered a follower at the lower-level. Then an equivalent single-level counterpart model is presented for each leader. So, the whole problem is converted into multiple individual stochastic single-level models, and then the Nash Equilibrium concept is used to determine GENCO equilibrium strategies. The proposed methodology is evaluated using some modified IEEE reliability test systems. The numerical analysis confirms that the proposed model is more effective in cases with higher uncertainties. Moreover, the performed analysis demonstrated the importance of applying a bi-level approach to the problem. Finally, the superiority of the proposed approach compared to the existing one is confirmed. [ABSTRACT FROM AUTHOR]

The development of adaptive scheduling algorithms that take advantage of malleability has become a crucial area of research in many large-scale projects. Malleable workloads can improve the system's performance but, at the same time, provide an extra dimension to the scheduling problem. This paper proposes an adaptive, performance-based job scheduling method that emphasizes the backfilling concept with malleability. The proposed method performs the malleability operations only when the estimated execution time of the involved applications is better than or equal to the execution time on the allocated resources without reconfiguration. The reconfiguration feasibility is determined by performance models considering the application scalability and reconfiguration overheads. Different policies for implementing malleability are presented, each targeting a specific workload in terms of job size and scalability. The comprehensive evaluation shows an improvement in the slowdown up to 49% compared to the non-adaptive baseline scheduling algorithm. [ABSTRACT FROM AUTHOR]

The development of safety-critical real-time embedded systems (RTESs) is a difficult task. Indeed, in addition to functional requirements, these systems must guarantee timing constraints. Model-driven engineering (MDE) promotes a rise in the level of abstraction during the development process of these systems. This is beneficial since it may help designers manage the increasing complexity of these systems. It may also accelerate the development process through model transformations and enable early verification of the timing properties. Schedulability analysis techniques aim to verify whether the tasks complete their executions within the time limit specified by the real-time application (i.e., the deadline). Unfortunately, software designers find this task difficult since it requires a deep understanding of real-time scheduling theory, as well as the use of dedicated tools (called analysis tools). In this paper, we propose real-time verification design patterns to promote early verification of timing properties in a model-based approach. These patterns aim to assist designers in the verification process. They encapsulate the knowledge of a real-time expert in scheduling theory. To facilitate and fasten the verification process, we propose to automate the generation of the analysis model. Thanks to the provided patterns, this generation phase includes an automatic consistency check of the design model. The consistency check step verifies the design's validity and completeness with respect to the applied pattern. To add further benefits to the proposed patterns, we describe a process that provides context for how these patterns can be applied. We apply and simulate the contribution to real-world case study. The obtained results show the viability of this research. [ABSTRACT FROM AUTHOR]

The technology for path planning of independent mobile robots is mature, but multi-robot path planning for unified scheduling and allocation is much more complex than single-robot path planning. This requires consideration of collision problems between robots, general optimal path problems, etc. This paper proposes the use of the BSO algorithm for unified scheduling and allocation of multiple robots to improve the efficiency of task execution. The BSO algorithm is a new type of intelligent optimization algorithm that uses clustering ideas to search for local optimal solutions and obtains global optimal solutions by comparing local optimal solutions. It also uses mutation ideas to increase the diversity of the algorithm and avoid becoming trapped in local optimal solutions. Using the GA/SA algorithm and the proposed BSO algorithm for computer simulation comparison, we obtained the optimal path planning for the three robots under unified scheduling. The total distance of the optimal path obtained by the BSO algorithm was 27.36% and 25.31% shorter than those of the GA and SA algorithms, respectively. To further test the performance of the BSO algorithm, we conducted additional experiments on the unified scheduling of multiple robots. The experimental results show that the proposed BSO algorithm can significantly improve the efficiency. The multi-robot under unified scheduling performs point-to-point path planning without collisions, and they can traverse all task target points in the shortest path without repetition. This algorithm is suitable for multi-robot tasks in large-scale environments. [ABSTRACT FROM AUTHOR]

Earth observation satellite (EOS) scheduling is critical for improving the performance of Earth observation system. Most of the existing studies on satellite observation scheduling problems focus on static tasks and real-time dynamic tasks also known as emergency tasks while few attempts have been made for common dynamic tasks yet. The common dynamic tasks are characterized by uncertain arrival times and delayable observations while the emergency tasks require immediate observations. The number of common dynamic tasks is rapidly increasing with the expansion of satellite observation applications, which poses great challenges to EOS observation scheduling. To address this issue, this paper investigates the satellite observation scheduling problem with common dynamic tasks. Firstly, a centralized onboard dynamic scheduling framework based on a periodic-triggered rolling horizontal optimization (RHO) strategy is proposed and a novel two-stage mathematical model is established for the periodic rescheduling problem. Secondly, we propose a low-complexity onboard periodic rescheduling algorithm (OPR), which consists of a greedy-based task allocation algorithm, a pointer network (Ptr-network) based task scheduling algorithm and an iterative local search algorithm. In the greedy-based task allocation algorithm, we define a Task-EOS Fitness Indicator (TEFI) and each task is greedily allocated to the EOS with maximum TEFI. In the Ptr-network based task scheduling algorithm, the allocated task sets of all EOSs are fed into the Ptr-network in parallel to generate the observation scheduling result. Afterward, an iterative local search algorithm is proposed to further improve the quality of the observation scheduling result. Finally, extensive experiments are conducted to demonstrate the superiority of the OPR algorithm for the satellite observation scheduling problem with common dynamic tasks. [ABSTRACT FROM AUTHOR]

Summary: With increasing challenges and research in edge‐assisted IoT models, an improved resource scheduling approach exploiting deep learning concepts is proposed in this research work. Improvement in performance in the proposed work is achieved primarily by addressing the response time and waiting time. This could be achieved if the optimal resources are scheduled without any delay. The presented concatenated deep learning technique considers the time series IoT network source requirements and allocates optimal resources from the resource pool, considering resource availability, workload, and computation time. Two deep learning techniques, namely, CNN and GRU, are utilized for the concatenation process, while resource characteristics are considered as features that are extracted and classified to schedule optimal resources. Novelty in the proposed work is exhibited in the form of the concatenation process proposed. The proposed resource scheduling performance metrics are compared with the performance of the existing scheduling model through simulation analysis for better validation. The proposed model selects the optimal resources from the resource pool using concatenated features and schedules for respective requests with minimum delay and waiting time, which increases the overall efficiency of the edge computing IoT networks. [ABSTRACT FROM AUTHOR]

In the context of the dual carbon goal strategy, the proportion of new energy generation has increased annually, large‐scale renewable energy integration has been achieved, and the intermittent and uncertain operating characteristics pose an enormous challenge to the complete and stable operation of an integrated energy system (IES), promoting the complexity of IES optimization models. To increase the stability and accuracy of the system and improve the operation efficiency of the system, a Gaussian mixture model is used to fit the probability distribution of wind power and the prediction errors of the photovoltaic output. In addition, the expected maximization method is used to solve a model with hidden variables, the results show that the expectation maximization algorithm can improve the fitting accuracy, reduce the error caused by the subjective setting of the initial value, and make the fitting accuracy of the wind‐solar power prediction error greater. Then, to solve the problem in which the low resolution of the day‐ahead scheduling time leads to large errors, day‐ahead, day‐to‐day multitime scale operation optimization model takes into account the comprehensive demand response according to the differences in wind and solar output and load forecasting accuracy. Finally, simulation validation is conducted in multiple scenarios, and a comparative analysis is performed for single and multitime scale comprehensive demand response scenarios. The simulation results show that compared with the optimization results of no demand response day, the optimization results of this model reduce the total cost by 23.21%, carbon emissions by 13.98%, purchased electricity by 13.87%, and purchased gas by 19.31%, effectively improving the use of gas turbines in the system. The multitime scale scheduling strategy increases the overall operating cost of the IES, modifies the scheduling results, and agrees with real operating scenarios. [ABSTRACT FROM AUTHOR]

Introduction: Optimizing operating room (OR) scheduling accuracy is important for OR efficiency, meeting patient expectations, and maximizing value for health systems. However, limited data exist on factors influencing the precision of Total Hip Arthroplasty (THA) OR scheduling. This study aims to identify the factors influencing the accuracy of OR scheduling for THA. Methods: A retrospective review of 6,072 THA (5,579 primary THA and 493 revision THA) performed between January 2020 and May 2023 at an urban, academic institution was conducted. We collected baseline patient characteristics, surgeon years of experience, and compared actual wheels in to wheels out (WIWO) OR time against scheduled OR time. Significant scheduling inaccuracies were defined as actual OR times deviating by at least 15% from scheduled OR times. Logistic regression analyses were employed to assess the impact of patient, surgeon, and intraoperative factors on OR scheduling accuracy. Results: Using adjusted odds ratios, primary THA patients who had a lower BMI and surgeons who had less than 10 years of experience were associated with overestimation of OR time. Whereas, higher BMI, younger age, general anesthesia, non-primary osteoarthritis indications, and afternoon procedure start times were linked to underestimation of OR time. For revision THA, lower BMI and fewer components revised correlated with overestimated OR time. Men, higher BMI, more components revised, septic indication for surgery, and morning procedure start times were associated with underestimation of OR time. Conclusion: This study highlights several critical patient, surgeon, and intraoperative factors influencing OR scheduling accuracy for THA. OR scheduling models should consider these factors to enhance OR efficiency. [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]

Summary: This article is concerned with the sliding mode control for Markovian jump systems under transmission constraints. To deal with node congestions, a switched channel scheduling scheme integrating round‐robin (RR) protocol and weight try‐once‐discard (WTOD) protocol is proposed to orchestrate the priority of multiple sensor nodes. At each transmission instant, a system performance‐based detector is adopted to select one scheduling protocol between RR and WTOD in a certain event‐triggering manner, by which only one sensor node has the priority to access the network. Compared with conventional protocols, the proposed scheduling scheme establishes a dynamic coupling mechanism between channel resource and scheduling rules, aiming to strike a balance between improving system performance and reducing communication resource requirements. Then, a token‐dependent sliding mode controller is constructed, and a genetic algorithm‐based optimization problem is given to achieve smaller convergent domain. Finally, numerical examples are shown to verify the present control strategy. [ABSTRACT FROM AUTHOR]

In the current computing environment, the significance of distributed heterogeneous systems has gained prominence. The research on scheduling problems in distributed systems that consider energy consumption has garnered substantial attention due to its potential to enhance system stability, achieve energy savings, and contribute to environmental preservation. However, efficient scheduling in such systems necessitates not only the consideration of energy consumption but also the ability to adapt to the dynamic nature of the system. To tackle these challenges, we propose an online energy-aware scheduling algorithm for deadline-constrained applications in distributed heterogeneous systems, leveraging dynamic voltage and frequency scaling (DVFS) techniques. First, the algorithm models the continuously arriving applications and heterogeneous processors and proposes a novel task-sorting method to prioritize tasks, ensuring that more applications are completed within their respective deadlines. Second, the algorithm controls the selection range of processors based on the task's subdeadline and assigns the task to the processor with the minimum energy consumption. Through experiments conducted with randomly generated applications, our approach consistently exhibits superior performance when compared to similar scheduling algorithms. [ABSTRACT FROM AUTHOR]

Aiming at the problem that the dynamic window approach (DWA) has low planning efficiency and it is difficult to avoid fast-moving obstacles, an improved adaptive DWA based on risk degree function is proposed in this paper. The risk function is designed and introduced into the evaluation function of the traditional DWA to evaluate the risk of collision between dynamic obstacles and the robot, so that the robot can effectively avoid faster obstacles. Then, according to the fuzzy control principle, the adaptive weight coefficient is designed to improve the evaluation function, so that the mobile robot can move to the target point more efficiently. The simulation results show that compared with the traditional DWA, the adaptive DWA based on risk degree function reduces the time of completing the planning task by about 8%, and the path length after the completion of the planning by about 8%, it indicates that the improved algorithm has higher efficiency. After 50 repeated experiments, using the adaptive DWA based on risk degree function successfully avoids all obstacles to complete the planning task, which shows that this algorithm has higher security. [ABSTRACT FROM AUTHOR]

Several real-world scientific and industrial workflow applications adopt elastic and cost-efficient cloud services to fulfill their requirement. There are two stakeholders in the system, namely the user and the provider each of which tries to maximize its profit and at the same time minimize their possible overall costs. Since task scheduling algorithms for workflow executions determine which task should be possibly executed on what resources, they have a drastic impact on both the user's quality of experiences and on the underlying resource utilization. Indeed, an efficient task scheduling algorithm can meet service-level agreement (SLA) for both sides. For the sake of the importance of the issue, this survey presents a subjective taxonomy on the task scheduling schemes in the literature for workflow executions in cloud computing environments to be a guideline for future improvement. It classifies the literature based on the proposed algorithms in the literature, objectives, stakeholders' requirements, and evaluation metrics. This survey highlights research trends, challenges, research gaps, potential solutions, and future direction. It can also pave the way for further processing, improvement and strengthening of existing approaches or devising novel ones for interested researchers in the field of task scheduling problems. [ABSTRACT FROM AUTHOR]

The effective utilization of task parallelism scheduling enables the exploitation of processing performance across multiple cores. Traditional serial scheduling algorithms are inadequate for achieving parallel task scheduling on multicore platforms. This study proposes a novel dynamic task scheduling algorithm called SEFAS. The algorithm aims to maximize task parallelism, leverage multicore performance, and reduce the duration of task set scheduling. The algorithm employs upward and downward ordering to calculate critical paths and categorize tasks into distinct levels. The introduction of node convergence factor and sequential failure factor facilitates the depiction of task parallelism and serves as a workaround for the limitations of the greedy algorithm. Experimental results demonstrate the enhanced adaptability of the proposed algorithm for computationally and communication-intensive tasks. Additionally, numerical comparisons reveal that the algorithm reduces the scheduling length by 35.0%, 93.7%, 17.1%, and 5% when compared to PLTSF, CPOP, CPMISF, and CPC, respectively. [ABSTRACT FROM AUTHOR]

The space time-sensitive multi-target collaborative observation scheduling problem extends the traditional Earth Observation Satellite (EOS) scheduling by incorporating the time dimension. Multiple effective and collaborative observations over time are required to collect relevant information on time-sensitive space targets in high-speed motion. Furthermore, changes in target spatial relationships cause conflicts in resource allocation. Due to the urgency of the time-sensitive targets, the observation system must respond promptly and efficiently upon receiving a task. This study proposes a mathematical model and a Time-Sensitive Observation Scheduling (TSOS) algorithm to address these problem characteristics. Firstly, a mathematical model for scheduling is established by introducing the completion quality index and resource switching frequency index, given the requirement for collaborative multiple satellites in this problem. The TSOS algorithm consists of two parts: task pre-processing and a circular scheduling strategy. In the task pre-processing module, the entire scheduling is divided into multiple observation decision intervals. This enables the candidate satellite set corresponding to each target to remain stable, which reduces the complexity of the problem. An action mapping method is used in the circular scheduling module, and a decision network based on Deep Reinforcement Learning (DRL) called the Observation Pair Decision Network is proposed. Experimental results demonstrate that the trained TSOS algorithm can effectively schedule resources in scenarios with different conflict degrees and exhibits strong robustness. [ABSTRACT FROM AUTHOR]

This paper addresses the global optimal signal plan of a fixed time control for an isolated signalized intersection with central pedestrian refuges considering both vehicle delays and pedestrian delays. A signal phase plan, a pedestrian signal setting scheme, and a signal timing plan are all part of the signal plan presented here. Pedestrian delays are explicitly formulated with signal timing parameters considering signal phase plans and pedestrian signal setting schemes. Integer nonlinear combinatorial programming models are proposed to minimize average and total delays. Numerical experiments show that the proposed optimization models outperform the existing ones, especially when traffic demands between phases are unbalanced. The analysis of the results shows that separate pedestrian signalization settings, and adjacent (or nonadjacent) allowed crossing phases for pedestrians at central islands are superior signal plan options when the minimum phase time is insufficient (or sufficient) to accommodate the minimum green time for crosswalks. [ABSTRACT FROM AUTHOR]

The production process of precast components is labor-intensive, involving various manual tasks. The physically demanding tasks usually result in fatigue and overexertion of workers, leading to increased occupational health risks and reduced productivity. An appropriate work–rest strategy is recognized to effectively promote both workers' health and productivity, while it has rarely been studied in the field of the construction industry. To narrow this gap, this study developed a mixed-integer linear programming approach to optimize the work–rest schedule by integrating workers' overexertion. The objective is to maximize the productive time affected by the workers' accumulative fatigue and recovery. Also, the optimized work–rest strategy can be highly customized by considering personalized factors and task characteristics. Experimenting with a case study compared the default rest schedule provided by the superintendent onsite with the optimal solution solved from the developed model. Results suggested that up to 20% improvement in productive time can be achieved, especially for the task with a relatively higher workload. Computational experiments were conducted to evaluate the sensitivity of total productive time to various personalized and task-specific factors. The proposed method provides superintendents with an applicable strategy to improve workers' productivity and reduce their occupational risks resulting from overexertion. This study can promote the implementation of personalized occupational health management and support the improvement of regulations on the required rest with quantified evidence, thereby contributing to more reliable scheduling and sustainable workforce development for the construction industry. The research scope was limited to the precast production process, and further investigation on broader applications will be conducted. [ABSTRACT FROM AUTHOR]

This study proposes an optimization model based on particle swarm optimization (PSO) to achieve the objectives of minimizing project duration, project cost, and resource fluctuation while maximizing project quality and schedule flexibility. The objectives of this study are as follows: (1) to determine whether the interrelationships between these five objectives affect the outcome of the optimization; (2) to determine whether the presence or absence of resource constraints affects the solution; and (3) to verify that the solution of the PSO-based optimization model coincides with the exact mathematical solution, but faster. An example project was presented to illustrate the applicability of the proposed model. The conclusions of this study are as follows: (1) multiple objectives do interact with each other and should be evaluated simultaneously rather than one at a time to reach realistic solutions, (2) resource constraints do affect the solutions obtained, and (3) the proposed model successfully reaches an optimal solution that is extremely close to the exact mathematical solution much faster than the mathematical model. [ABSTRACT FROM AUTHOR]

This paper studies the flexible double shop scheduling problem (FDSSP) that considers simultaneously job shop and assembly shop. It brings about the problem of scheduling association of the related tasks. To this end, a reinforcement learning algorithm with a deep temporal difference network is proposed to minimize the makespan. Firstly, the FDSSP is defined as the mathematical model of the flexible job-shop scheduling problem joined to the assembly constraint level. It is translated into a Markov decision process that directly selects behavioral strategies according to historical machining state data. Secondly, the proposed ten generic state features are input into the deep neural network model to fit the state value function. Similarly, eight simple constructive heuristics are used as candidate actions for scheduling decisions. From the greedy mechanism, optimally combined actions of all machines are obtained for each decision step. Finally, a deep temporal difference reinforcement learning framework is established, and a large number of comparative experiments are designed to analyze the basic performance of this algorithm. The results showed that the proposed algorithm was better than most other methods, which contributed to solving the practical production problem of the manufacturing industry. [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]

This paper addresses to the problem of flowshop scheduling under no-idle constraints with respect to the total completion time criterion. A branch and bound algorithm is proposed and a machine based lower bound is developed for the first time in the literature of this problem. Moreover, an Iterated Local Search (ILS) algorithm is used to provide the upper bounds of the problem. The computational results are promising, and the proposed algorithm appears able to find optimal solutions to problems with up to 20 jobs and 4 machines. [ABSTRACT FROM AUTHOR]

We investigate the semi-online problem of MapReduce scheduling on two parallel machines. We aim to minimize the makespan. Jobs are released over-list, and each job includes a map task and a reduce task. The job’s map task can be preemptive and scheduled simultaneously onto different machines, however, the reduce task is non-preemptive. The job’s reduce task needs to wait for its map task to complete before starting. We consider the following two versions: Firstly, we know the processing time of the largest reduce task beforehand, and then design a 4/3-competitive optimal semi-online algorithm. Secondly, we know in advance the value of the reduce task with the largest processing time and the the total sum of the processing times. Then we present a 4/3-competitive semi-online algorithm. We conclude that the algorithm is the best possible when the largest reduce task meets certain conditions. [ABSTRACT FROM AUTHOR]

To promote the application of automated vehicles in large airports, in this study, we present an integrated optimization method for scheduling Unmanned follow-me cars. The scheduling process is divided into three phases: Dispatch, Guidance, and Recycle. For the Dispatch phase, we establish a vehicle assignment model, to allocate the vehicle resource equitably. For the Guidance phase, we offer an quantitative way, to measure the spacing between Unmanned follow-me car and aircraft. To optimize the efficiency of airport operation in the three phases and ensure safety, the collaborative planning model, and the conflict prediction model are established. An improved grey wolf optimization algorithm is adopted to enhance the convergence speed and generalization performance. A case study at Ezhou Huahu Airport in China demonstrates the effectiveness of the methods. The results show that the model of collaborative planning can make the balance of path selection, Unmanned follow-me car's working time, and departure sequence. The convergence speed of the improved algorithm has been increased by 18.75%. The inequity index of vehicle assignment is only 0.015731, and the spatiotemporal distribution of conflicts is influenced by the airport's surface layout. [ABSTRACT FROM AUTHOR]

With the development of modern society, business organizations have higher and higher requirements for the efficiency of cloud computing services. In order to improve the comprehensive computing capability of cloud computing network, it is very important to optimize its end-side computing power. This research takes the Hadoop platform as the computing end-side cloud computing network structure as the research object, and designs a Hadoop end-side multi-granularity and multi-level multi-level network that integrates the Graphics processing unit (GPU) and the information transfer interface (Multi Point Interface, MPI). Hierarchical computing power optimization scheduling model and improved microservice deployment s11trategy that integrates multi-level resources. The performance verification experiment results show that the mean value of all node balance ratios of the original strategy and the improved strategy on computing resource-oriented, memory resource-oriented, and disk resource-oriented microservices are 0.13 and 0.12, 0.21 and 0.17, and 0.22 and 0.19, respectively. The value of the service instance cost in the scheme using the critical path optimization scheduling strategy is always at a low level, while the instance cost value of the native strategy is significantly higher than the former. It can be seen that the end-side computing power optimization scheduling model designed in this study can indeed play a role in improving the computing performance of the end-side computing power network. [ABSTRACT FROM AUTHOR]

Scheduling for accurate estimation of construction duration is significant to prevent construction delays and successfully complete projects on time. Although the main reasons for construction delays differ among developing countries, several factors related to project characteristics and clients contribute. In this study, interviews and observations were conducted with TOKI (Housing Development Administration of the Republic of Turkey), to explore construction delays. It was revealed that TOKI uses three factors such as “the number of flats”, “type of drawings utilized during the tender stage”, and “non-working days” to estimate total construction duration. Data analysis of the TOKI Projects Status Table, which lists detailed project information for 2800 completed TOKI projects, showed that most delays occurred in housing projects. Therefore, the construction delays for TOKI housing projects were investigated in this case study. The findings revealed that there is a wide construction duration gap between calculated construction durations using TOKI’s calculation method and durations indicated in official construction contracts between TOKI as a client and the awarded contractors. It was concluded that the comparison between durations with construction documents and schematic design and construction delays are generally positive and high. Therefore, it was found that TOKI significantly shortened the construction duration and the factors used by TOKI for calculation of the construction duration are insufficient, which ultimately resulted in delays for a considerable number of housing projects. These findings can be helpful for clients and project managers to mitigate construction delays. To effectively overcome construction delays in developing countries, suggestions are made to develop accurate construction duration estimation models. [ABSTRACT FROM AUTHOR]

This study explores the impact of public health events, multi-modal projects, multi-project environments, and multi-capacity resource constraints on project scheduling. It describes the comprehensive resource-constrained project scheduling problem (MCMRCMPSP) specifically for public health events, and proposes two approaches for modelling and solving the problem. The objective is to enhance the practical relevance of project scheduling and enrich the problem itself. To improve efficiency and the algorithm for scheduling problems, an enhanced quantum algorithm based on the quantum particle swarm algorithm (QPSO) is proposed. The enhancements include Gaussian variation and a tournament selection strategy. Furthermore, the article integrates multiple heuristic rules with the algorithm to minimize illogical computations, improve computational efficiency, and enhance solution quality. The proposed algorithm's effectiveness is validated through performance tests and practical application experiments. The results show that the algorithm has superior convergence performance and solution accuracy compared with the traditional QPSO, particle swarm algorithm (PSO), genetic algorithm, ant colony algorithm, and cuckoo algorithm. Thus, the algorithm provides a targeted resource scheduling plan for real-world cases. This research contributes to the field of project scheduling problems and proposes a new solution. [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]

Nowadays, the digital development of marine ranching requires a communication system with wide coverage, high transmission rate and stable communication links. It is known that fixed‐wing unmanned aerial vehicles (UAVs) have great advantages in long‐range applications. They have the potential to serve as low‐altitude communication platforms for maritime communication. In this study, with a developmental perspective, considering the intense growth of marine terminals in the future, a new clustering algorithm applied to cluster nonorthogonal multiple access (C‐NOMA) is proposed and its advantages are investigated. In addition, considering the limited energy of marine terminals, combining the wireless power communication (WPC) technology for the UAV to charge terminals, the charging and communication time are optimized with the Lagrange multiplier method and the bisection search method. After completing the above optimization content of charging and communication, combined with the optimization results, it is found the trajectory that maximizes the energy efficiency of the UAV with the convex optimization technique. Experimental results show that the proposed clustering algorithm has good throughput performance, better fairness and lower algorithm complexity, and the proposed trajectory optimization scheme has better energy efficiency. [ABSTRACT FROM AUTHOR]

The error performance of the 5G low‐density parity‐check codes is significantly impacted by the update order of layers. At present, the row degree (RD) and the number of punctured bits (PBs) are widely used to decide the update order of layers. Here, the authors propose a metric to assess the soft message recovery speed of coded bits and then suggest updating layers with the lowest RD first rather than those with the least PBs first. Besides, a new criterion is introduced to further determine the update order of layers with the same number of PBs and the same RD. The resulting reordered layered schedule yields better error performance and faster convergence speed than the prior arts. [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]