scholarly journals An Integrated Scheduling Algorithm for Multi-Device-Processes with the Strategy of Exchanging Adjacent Parallel Processes of The Same Device

2021 ◽  
Author(s):  
zhen Wang ◽  
xiaohuan zhang ◽  
yuxiao Cao
Keyword(s):  
Scheduling Algorithm ◽  
Parallel Process ◽  
Parallel Processes ◽  
Integrated Scheduling ◽  
Scheduling Scheme ◽  
Post Process ◽  
Adjustment Strategy ◽  
Serial Process ◽  
Current Algorithm ◽  
Processing Device

Abstract The current integrated scheduling algorithm ignores the influence of the pre-process on the post-process when solving the multi-device-process integrated scheduling problem, which leads to the problem of poor tightness between serial processes and low parallelism between parallel processes. This paper points out that there is no restriction of scheduling sequence between adjacent parallel processes on the same processing device, and the scheduling sequence between parallel processes on the same device can be flexibly processed to optimize the scheduling results, on the basis of the current algorithm scheduling scheme, this paper proposes the application of multi-device adjacent parallel process interchange strategy and multi-device adjacent parallel process interchange adjustment strategy, which avoid the influence of the pre-process on the post-process, improves the compactness of the serial process and the parallelism of the parallel process, and optimizes the scheduling results.

scholarly journals An integrated scheduling algorithm for multi-device-processes with the strategy of exchanging adjacent parallel processes of the same device

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Zhen Wang ◽  
Xiaohuan Zhang ◽  
Yuxiao Cao ◽  
Guoming Lai
Keyword(s):  
Scheduling Algorithm ◽  
Parallel Process ◽  
Parallel Processes ◽  
Process Sequence ◽  
Integrated Scheduling ◽  
Scheduling Scheme ◽  
Post Process ◽  
Adjustment Strategy ◽  
Serial Process ◽  
Processing Device

AbstractAt present, Multi-Devices-Process Integrated Scheduling Algorithm with Time-Selective Strategy for Process Sequence (MISATPS) is an advanced algorithm in the field of integrated scheduling with multi-devices-process problems. This algorithm ignores the influence of the pre-process on the post-process when solving the multi-devices-process integrated scheduling problem, which leads to the problem of poor closeness between serial processes and poor parallelism between parallel processes. This paper points out that there is no restriction of scheduling sequence between parallel processes on the same processing device. It can be scheduled flexibly of the sequence between parallel processes of the same device. Therefore, based on the scheduling scheme of MISATPS, the algorithm is improved by applying the interchange strategy and the interchange adjustment strategy of multi-device adjacent parallel process. In this way, the influence of the pre-process on the post-process is avoided, the compactness of the serial process and the parallelism of the parallel process are improved, and the scheduling result is optimized.

scholarly journals Multiple-Devices-Process Integrated Scheduling Algorithm with Time-Selective Strategy for Process Sequence

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-12 ◽  
Author(s):  
Xiaohuan Zhang ◽  
Dan Zhang ◽  
Zhen Wang ◽  
Yu Xin
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Problems ◽  
Parallel Processes ◽  
Process Sequence ◽  
Integrated Scheduling ◽  
Selective Strategy ◽  
Processing Procedure ◽  
Sequencing Strategy ◽  
Multiple Devices ◽  
Serial Process

This paper is in view of the current algorithm to solve Multiple-Devices-Process integrated scheduling problems without considering parallel process between the parallel processing. Meanwhile, the influence of the first processing procedure on the second processing procedure is ignored, resulting in poor tightness between serial processes and poor parallelism between parallel processes, ultimately affecting the product scheduling results. We proposed Multiple-Devices-Process integrated scheduling algorithm with time-selective for process sequence. The proposed Multiple-Devices-Process sequencing strategy determines the process of scheduling order and improves the tightness between serial process. This paper presents a method to determine the quasischeduling time point of the multiequipment process, the time-selective strategy of Multiple-Devices-Process, and the time-selective adjustment strategy of Multiple-Devices-Process so that the first and the second processing processes cooperate with each other, and the purpose of improving the tightness of the serial process and the parallelism of the parallel processes is achieved, so as to shorten the product processing time.

A multi-shop integrated scheduling algorithm with fixed output constraint

2021 ◽  
pp. 1-9
Author(s):  
Yingchun Xia ◽  
Zhiqiang Xie ◽  
Yu Xin ◽  
Xiaowei Zhang
Keyword(s):  
Constraint Programming ◽  
Programming Model ◽  
Scheduling Algorithm ◽  
Processing Parameters ◽  
Scheduling Problem ◽  
Integrated Scheduling ◽  
Scheduling Scheme ◽  
Wide Range ◽  
Constraint Programming Model ◽  
Output Constraint

The customized products such as electromechanical prototype products are a type of product with research and trial manufacturing characteristics. The BOM structures and processing parameters of the products vary greatly, making it difficult for a single shop to meet such a wide range of processing parameters. For the dynamic and fuzzy manufacturing characteristics of the products, not only the coordinated transport time of multiple shops but also the fact that the product has a designated output shop should be considered. In order to solve such Multi-shop Integrated Scheduling Problem with Fixed Output Constraint (MISP-FOC), a constraint programming model is developed to minimize the total tardiness, and then a Multi-shop Integrated Scheduling Algorithm (MISA) based on EGA (Enhanced Genetic Algorithm) and B&B (Branch and Bound) is proposed. MISA is a hybrid optimization method and consists of four parts. Firstly, to deal with the dynamic and fuzzy manufacturing characteristics, the dynamic production process is transformed into a series of time-continuous static scheduling problem according to the proposed dynamic rescheduling mechanism. Secondly, the pre-scheduling scheme is generated by the EGA at each event moment. Thirdly, the jobs in the pre-scheduling scheme are divided into three parts, namely, dispatched jobs, jobs to be dispatched, and jobs available for rescheduling, and at last, the B&B method is used to optimize the jobs available for rescheduling by utilizing the period when the dispatched jobs are in execution. Google OR-Tools is used to verify the proposed constraint programming model, and the experiment results show that the proposed algorithm is effective and feasible.

scholarly journals An Improved Integrated Scheduling Algorithm with Process Sequence Time-Selective Strategy

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Zhen Wang ◽  
Xiaohuan Zhang ◽  
Gang Peng
Keyword(s):  
Scheduling Algorithm ◽  
Process Scheduling ◽  
Time Points ◽  
Process Sequence ◽  
Integrated Scheduling ◽  
Scheduling Scheme ◽  
Selective Strategy ◽  
Advanced Algorithm ◽  
Time Point

The integrated scheduling algorithm of process sequence time-selective strategy (ISAOPSTSS) is an advanced algorithm in the field of integrated scheduling. The proposed algorithm points out the shortcomings of the process sequence time-selective strategy. Generally, there are too many “trial scheduling” times. The authors propose that there is no need to make “trial scheduling” at every “quasi-scheduling time point.” In fact, the process scheduling scheme can be obtained by trial scheduling on some “quasi-scheduling time points.” The scheduling result is the same as that of the sequence timing strategy. The proposed algorithm reduces the runtime of scheduling algorithm and improves the performance of the algorithm without reducing the optimization effect.

An Effective Memetic Algorithm for the Distributed Integrated Scheduling of Tree-Structured Products

2021 ◽  
pp. 2150001
Author(s):  
Yilong Gao ◽  
Zhiqiang Xie ◽  
Qing Jia ◽  
Xu Yu
Keyword(s):  
Sampling Method ◽  
Memetic Algorithm ◽  
Scheduling Algorithm ◽  
Optimal Solution ◽  
Estimation Algorithm ◽  
Probability Models ◽  
Complex Products ◽  
Integrated Scheduling ◽  
Local Search Strategy ◽  
Representation Method

Aiming at the distributed integrated scheduling of complex products with tree structure, a memetic algorithm-based distributed integrated scheduling algorithm is proposed. Based on the framework of the memetic algorithm, the algorithm uses a distributed estimation algorithm for global search and performs a local search strategy based on the critical operation set for the current optimal solution obtained in each evolutionary generation. A bi-chain-based individual representation method is presented and a simple greedy insertion-based decoding method is given; two position-based probability models are built, which are used to describe the distribution of the operation priority and factory assignment, respectively. Based on the designed probability models, two learning-based updating mechanisms and an improved sampling method are given, which ensures that the population evolves towards a promising region. In order to enhance the searchability for the superior solutions, nine disturbance operators based on the critical operation set are presented. The parameters are determined by the design-of-experiment (DOE) test, and the effectiveness of the proposed algorithm is verified by comparative experiments.

Clock Skew Scheduling with Optimizing-Potential Prediction

2012 ◽  
Vol 198-199 ◽  
pp. 621-625
Author(s):  
Kai Huang ◽  
Jin Guo Zhang ◽  
Zhi Kuang Cai
Keyword(s):  
Time Complexity ◽  
Scheduling Algorithm ◽  
Past Research ◽  
Half Time ◽  
Clock Skew ◽  
Scheduling Scheme ◽  
The Past ◽  
Clock Skew Scheduling

This paper addresses the issue of increasing the efficiency of the clock skew scheduling. The past research focuses on reducing the time complexity of clock skew scheduling algorithm. However, even if an algorithm has time complexity close to linear, the flow iterations still consumes a lot of time. In this paper, a novel clock skew scheduling scheme with the feature of optimization-potential prediction is proposed. With this feature, the algorithm has timing complexity close to linear, and the number of flow iterations is decreased. The experiment results show that the proposed scheme consumes about half time and achieves almost the same optimization strength (13% highest frequency improvement of ARM1136J-FS) compared to the traditional.

Research on Multitask Collaborative Scheduling Problem with Heuristic Strategies

2011 ◽  
Vol 66-68 ◽  
pp. 758-763
Author(s):  
Fan Zhang ◽  
Gui Fa Teng ◽  
Jian Bin Ma ◽  
Jie Yao
Keyword(s):  
Scheduling Algorithm ◽  
Scheduling Problem ◽  
Agricultural Machinery ◽  
Start Time ◽  
Farm Machinery ◽  
Scheduling Scheme ◽  
Scheduling Model ◽  
Heuristic Strategies ◽  
Collaborative Scheduling ◽  
Minimal Resource

According to problems existed in the current farm machinery scheduling process, a new farm machinery scheduling scheme is adopted in this dissertation. The collaborative scheduling model of farm machinery is established and multitask collaborative scheduling algorithm is designed through analyzing the differences between Vehicle Scheduling Problem and agricultural machinery scheduling in the dissertation. Earliest Start Time First and minimal resource allocated capacity first strategies are used in the farm machinery scheduling. The algorithm is useful for the case of machinery owner with sufficient farm machinery. The experiment proves that the collaborative scheduling algorithm is more effective than the serial scheduling algorithm.

Link Scheduling Scheme for Multi-Hop Cognitive Radio Ad Hoc Networks

2013 ◽  
Vol 443 ◽  
pp. 430-434
Author(s):  
Chao Li ◽  
Guo Chun Ren ◽  
Cheng Gui Wang ◽  
Yu Bo Wang
Keyword(s):  
Ad Hoc ◽  
Scheduling Algorithm ◽  
Cluster Head ◽  
Link Scheduling ◽  
Destination Node ◽  
Spatial Reuse ◽  
Topology Structure ◽  
Scheduling Scheme ◽  
Simulation Results ◽  
Hoc Networks

In this paper, we propose to apply a centre scheduling algorithm in the CRAHNs with a cluster. In this network, the cluster head assigns time slots to each node so that every node can be fair to transfer data. The scheme schedules the links to the same destination node first, which has the largest topology structure, then another destination node whose topology structure is larger than the rest. The algorithm presented in this paper considers both the fairness and the spatial reuse, and the simulation results show that this algorithm still has a good performance when the topology is so large.

Sign in / Sign up

Export Citation Format

Share Document