Intelligent Scheduling Algorithm and Application in Modernizing Manufacturing Services

In order to solve the problem that the dynamic programming of traditional intelligent scheduling algorithm is not perfect, which leads to the operation result taking too long, the author proposes an intelligent scheduling algorithm for enterprise human resources based on big data. This research creates an effective planning model based on big data, realizes the effective business plan of human resources, develops the advanced instruction of the intelligent scheduling algorithm, and proposed intelligent scheduling algorithm based on table precedence. The results showed that the average time of the experimental group was 7.261s shorter than the control group in the 20 stages of the data fusion test. The results show that, compared with the traditional intelligent scheduling algorithm, the intelligent scheduling algorithm proposed by the author can reduce the time required for data fusion and calculation in the stage, and the performance of the intelligent scheduling algorithm based on the previous table is better than those. Practice has proven that the intelligent scheduling algorithm based on the table can help reduce the work of intelligent scheduling of business human resources based on big data.

Energy minimization in dynamic train scheduling and control for metro rail operations

This paper analyzes the impact of dynamic task scheduling, processing element allocation and data transfer management on system performance of heterogeneous MPSoCs. Therefore, all parts of a runtime scheduling unit are analyzed. Bottlenecks are identified and their complexity evaluated. Furthermore, traced information is processed with two newly introduced tools. The first one generates an annotated SDF3 file. The second one creates a static schedule which applies the same scheduling and allocation decision as the dynamic scheduler. The execution of the static schedule reduces the burden of task management to a minimum. The resulting static execution is compared with the execution of the dynamic schedule. Hence, runtime overhead of dynamic scheduling is unveiled.

In this paper classic static and dynamic scheduling strategy is analyzed first, and then communication network of schedule ability judgment basis is given. An improved dynamic EDF scheduling algorithm is proposed in order to improve the scheduling task of real-time. The scheduling strategy is to change task priority according to the transmission error over deadline task when applying dynamic EDF scheduling strategy. True Time tool is used to build CAN network control system simulation platform. Dynamic EDF scheduling algorithm and improved scheduling algorithm are simulated respectively. The effectiveness of improved scheduling algorithm is verified by the simulation Keywords-Network control system; Scheduling Algorithm; True Time toolbox result.

Improved random selection strategy, self-adaptive crossover and mutation operators, population co-evolution algorithm are adopted in this paper to set up a new genetic algorithm(GA), guaranteeing the universality of population, the thoroughness of solution and the execution efficiency of algorithm in solving multi-process, process crossover, work-piece flow and other condition based scheduling problem of flexible manufacturing system(FMS). The problem of GA in solving FMS scheduling is summarized in this paper, reasons and countermeasures for GA's pre-maturing are studied, longitudinal and transverse comprehensive state-based correlative self-adaptive crossover and mutation operators are raised according to the analysis on GA to avoid local optimization and pre-maturity, the co-evolutionary GA is designed to solve the scheduling model for FMS, and the algorithm is validated for the scheduling of box-type parts for precise machine tools.

Intelligent manufacturing plays a significant role in Industry 4.0. Dynamic shop scheduling is a key problem and hot research topic in the intelligent manufacturing systems, which is NP-hard. However, traditional shop scheduling mode, dynamic event prediction approach, scheduling model and scheduling algorithm, cannot cope with increasingly complicated problems under kinds of scales production disruptions in the real-world production. To deal with these problems, this paper proposes a new joint data-model driven dynamic scheduling architecture for intelligent workshop. The architecture includes four new and key characteristics in the aspects of scheduling mode, dynamic event prediction, scheduling model and algorithm. More specifically, the new scheduling mode introduces data analytics methods to quickly and accurately deal with the dynamic events encountered in the production process. The new prediction model improves the deep learning method, and further applies it predict the dynamic events accurately to provide reliable input to the dynamic scheduling. The new scheduling model proposes a new hybrid rescheduling and inverse scheduling model, which can cope with almost scales of abnormal production problems. The new scheduling algorithm hybridizes dynamic programming and intelligent optimization algorithm, which can overcome the disadvantages of the two methods based on the analysis of solution space. The dynamic programming is employed to provide high-quality initial solutions for the intelligent optimization algorithm by reducing the computation time greatly. To sum up, the presented architecture is a new attempt to understand the problem domain knowledge and broaden the solving idea, which can also provide new theories and technologies to manufacturing system optimization and promote the applications of the theoretical results.

In this paper, we study a simple question: when are dynamic relaying strategies essential in optimizing the diversity-multiplexing tradeoff (DMT) in half-duplex wireless relay networks? This is motivated by apparently two contrasting results even for a simple three-node network with a single half-duplex relay. When all channels in the system are assumed to be independent and identically fading, a static schedule where the relay listens half the time and transmits half the time combined with quantize-map-and-forward (QMF) relaying is known to achieve the full-duplex performance. However, when there is no direct link between the source and the destination, a dynamic decode-and-forward (DDF) strategy is needed to achieve the optimal tradeoff. In this case, a static schedule is strictly suboptimal and the optimal tradeoff is significantly worse than the full-duplex performance. In this paper, we study the general case when the direct link is neither as strong as the other links nor fully nonexistent, and identify regimes where dynamic schedules are necessary and those where static schedules are enough. We identify four qualitatively different regimes for the single-relay channel, where the tradeoff between diversity and multiplexing is significantly different. We show that in all these regimes one of the above two strategies is sufficient to achieve the optimal tradeoff by developing a new upper bound on the best achievable tradeoff under channel state information available only at the receivers. A natural next question is whether these two strategies are sufficient to achieve the DMT of more general half-duplex wireless networks with a larger number of relays. We propose a generalization of the two existing schemes through a dynamic QMF (DQMF) strategy, where the relay listens for a fraction of time depending on received channel state information but not long enough to be able to decode. We show that such a DQMF strategy is needed to achieve the optimal DMT in a parallel channel with two relays, outperforming both DDF and static QMF strategies.

The traditional single intelligent algorithm has slow convergence speed in the frequency assignment, and the effect cannot meet the increasing frequency equipment in the naval battlefield. Based on the single intelligent frequency assignment algorithm and the frequency conflict analysis model between systems, this paper proposes three heuristic frequency assignment algorithms based on hybrid genetic algorithms, namely, Genetic Algorithm and Tabu Search (GATS), Hybrid Genetic Simulated Annealing Algorithm (HGSAA) and Genetic Algorithm-ant Colony Algorithm (GAA). The simulation results show that the hybrid algorithm can quickly converge to a better allocation result than the single intelligent algorithm in the frequency assignment problem, and the optimal value is better than the single intelligent algorithm. Among them, the convergence speed and optimal value of the GAA are the best of the three algorithms. Therefore, this algorithm can be applied to frequency assignment with more frequency-using equipment within a fixed range.

In response to the problem of weak continuous operation capability of fire equipment in the event of power interruption and insufficient energy supply in intelligent fire protection systems, this paper introduces new energy technologies such as wind and solar energy, and deeply integrates them with intelligent control systems. Through the application of smart grids and energy storage technology, the energy efficiency and reliability of the fire protection system are optimized. By combining power from renewable energy sources such as wind and solar energy, and utilizing edge computing and intelligent scheduling algorithms, the firefighting system maintains stable operation even during grid outages or high loads. Experimental results show that under stable wind power supply, the system maintains an operating time of 6 hours, a 20kWh energy storage battery charge, and a system voltage of 48V. This demonstrates the long-term reliability of wind power systems in stable conditions.

In order to understand the optimization management of sports venue facilities resources, a research on the optimization management of sports venue facilities resources based on intelligent scheduling algorithms has been proposed. This paper first analyzes the resource management system for sports facilities in universities. The system provides a detailed design of functional modules such as user management, venue management, and equipment management. Secondly, under the B/S structure, the NET development framework is adopted, Java programming language and ASP. NET 3.0 development technology are selected, and Oracle 11g is used as the backend database management system to study and design a sports facility resource management system, which has significant practical significance for intelligent management of sports venues.

Pipelining allows the execution of loop iterations with cross-iteration dependences to overlap in time, provided that the loop body is partitioned into stages such that the data dependences are not violated. Then, the stages are mapped onto threads and communication and synchronization between stages is typically achieved using queues. Pipelining techniques that rely on static scheduling perform poorly for load-imbalanced loops. Moreover, previous research efforts that achieve load-balancing are restricted to work-stealing and imply high overhead for fine-grained loops. In this article, we present URTS, a unified runtime system with compiler support that provides a lightweight dynamic scheduler by combining mapping, communication and synchronization algorithms with a suitable data structure and an efficient ticket mechanism. Particularly, URTS shows that it is possible to combine the efficiency of static scheduling with the load-imbalance tolerance of work-stealing by using a unified design that exploits the properties of a novel data structure. The evaluation on 8- and 32-core machines shows that URTS implies low overhead, of the same order as a static scheduler, for a set of benchmarks chosen from widely-used collections. URTS is a scalable solution that performs efficient dynamic scheduling for fine-grained loops, i.e., a class of interesting loops that is poorly handled by the state-of-the-art due to high overhead.

In this paper, the optimal dynamic scheduling of electric vehicles (EVs) in a parking lot (PL) is proposed to minimize the charging cost. In static scheduling, the PL operator can make the optimal scheduling if the demand, arrival, and departure time of EVs are known well in advance. If not, a static charging scheme is not feasible. Therefore, dynamic charging is preferred. A dynamic scheduling scheme means the EVs may come and go at any time, i.e., EVs’ arrival is dynamic in nature. The EVs may come to the PL with prior appointments or not. Therefore, a PL operator requires a mechanism to charge the EVs that arrive with or without reservation, and the demand for EVs is unknown to the PL operator. In general, the PL uses the first-in-first serve (FIFS) method for charging the EVs. The well-known optimization techniques such as particle swarm optimization and shuffled frog leaping algorithms are used for the EVs’ dynamic scheduling scheme to minimize the grid’s charging cost. Moreover, a microgrid is also considered to reduce the charging cost further. The results obtained show the effectiveness of the proposed solution methods.

The objective of a static scheduling algorithm is to minimize the overall execution time of the program, represented by a directed task graph, by assigning the nodes to the processors. However, sometimes it is very difficult to estimate the execution time of several parts of a program and the communication delays under different circumstances. In this paper, an uncertain intelligent scheduling algorithm based on an expected value model and a genetic algorithm is presented to solve the multiprocessor scheduling problem in which the computation time and the communication time are given by stochastic variables. In simulation examples, it shows that the algorithm performs better than other algorithms in uncertain environments.

GPU based parallel genetic algorithm for solving an energy efficient dynamic flexible flow shop scheduling problem

Antenna modeling based on meta-heuristic intelligent algorithms and neural networks