Analysis of the Power Grid Automation System Architecture Based on Distributed Scheduling

As the core content of urban power dispatching operation in the new era, power grid automation can ensure the safety and stability of urban power consumption on the basis of reducing resource consumption. Using the distributed scheduling method in the system can not only improve the quality of power transmission, but also improve the speed of system operation. Therefore, on the basis of understanding the distributed task scheduling method, this paper analyzes the independent task dynamic optimization level scheduling algorithm based on MPSoC, and carries on the in-depth understanding of the practical application effect, so as to prove the positive role of distributed scheduling in the application of power grid automation system.

TARS: A Novel Mechanism for Truly Autonomous Resource Selection in LTE-V2V Mode 4

Effective communication in vehicular networks depends on the scheduling of wireless channel resources. There are two types of channel resource scheduling in Release 14 of the 3GPP, i.e., (1) controlled by eNodeB and (2) a distributed scheduling carried out by every vehicle, known as Autonomous Resource Selection (ARS). The most suitable resource scheduling for vehicle safety applications is the ARS mechanism. ARS includes (a) counter selection (i.e., specifying the number of subsequent transmissions) and (b) resource reselection (specifying the reuse of the same resource after counter expiry). ARS is a decentralized approach for resource selection. Therefore, resource collisions can occur during the initial selection, where multiple vehicles might select the same resource, hence resulting in packet loss. ARS is not adaptive towards vehicle density and employs a uniform random selection probability approach for counter selection and reselection. As a result, it can prevent some vehicles from transmitting in a congested vehicular network. To this end, the paper presents Truly Autonomous Resource Selection (TARS) for vehicular networks. TARS considers resource allocation as a problem of locally detecting the selected resources at neighbor vehicles to avoid resource collisions. The paper also models the behavior of counter selection and resource block reselection on resource collisions using the Discrete Time Markov Chain (DTMC). Observation of the model is used to propose a fair policy of counter selection and resource reselection in ARS. The simulation of the proposed TARS mechanism showed better performance in terms of resource collision probability and the packet delivery ratio when compared with the LTE Mode 4 standard and with a competing approach proposed by Jianhua He et al.

A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0

Scheduling plays a pivotal role in the competitiveness of a job shop facility. The traditional job shop scheduling problem (JSSP) is centralized or semi-distributed. With the advent of Industry 4.0, there has been a paradigm shift in the manufacturing industry from traditional scheduling to smart distributed scheduling (SDS). The implementation of Industry 4.0 results in increased flexibility, high product quality, short lead times, and customized production. Smart/intelligent manufacturing is an integral part of Industry 4.0. The intelligent manufacturing approach converts renewable and nonrenewable resources into intelligent objects capable of sensing, working, and acting in a smart environment to achieve effective scheduling. This paper aims to provide a comprehensive review of centralized and decentralized/distributed JSSP techniques in the context of the Industry 4.0 environment. Firstly, centralized JSSP models and problem-solving methods along with their advantages and limitations are discussed. Secondly, an overview of associated techniques used in the Industry 4.0 environment is presented. The third phase of this paper discusses the transition from traditional job shop scheduling to decentralized JSSP with the aid of the latest research trends in this domain. Finally, this paper highlights futuristic approaches in the JSSP research and application in light of the robustness of JSSP and the current pandemic situation.

Diversified teaching-learning-based optimization for fuzzy two-stage hybrid flow shop scheduling with setup time

Distributed scheduling has attracted much attention in recent years; however, distributed scheduling problem with uncertainty is seldom considered. In this study, fuzzy distributed two-stage hybrid flow shop scheduling problem (FDTHFSP) with sequence-dependent setup time is addressed and a diversified teaching-learning-based optimization (DTLBO) algorithm is applied to optimize fuzzy makespan and total agreement index. In DTLBO, multiple classes are constructed and categorized into two types according to class quality. Different combinations of global search and neighborhood search are used in two kind of classes. A temporary class with multiple teachers is built based on Pareto rank and difference index and evolved in a new way. Computational experiments are conducted and results demonstrate that the main strategies of DTLBO are effective and DTLBO has promising advantages on solving the considered problem.