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

Abstract

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.

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

“…The algorithm performance is affected by the structure of product process tree, the number of processing equipment and the processing time. Therefore, the proposed algorithm is compared with the MISATPS algorithm [13] from the perspective of different scale parameters. First, each experiment will randomly generate 50 products.…”

“…For example, P1/M1/10 means that the procedure is named P1 and processed on device M1, which is a common procedure with a processing duration of 10; P2/M1M2/20, which means that the process name is P2, and it is a multi-device process, which needs to be processed on device M1 and M2 at the same time, and the processing time is 20. According to the algorithm proposed in the literature [13], the total processing time of product P is 265, and its scheduling Gantt chart is shown in Fig. 10.…”

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

“…For example, P1/M1/10 means that the procedure is named P1 and processed on equipment M1, which is a common procedure with a processing duration of 10; P2 / M1M2 /20, which means that the process name is P2, and it is a multi-equipment process, which needs to be processed on equipment M1 and M2 at the same time, and the processing time is 20. According to the algorithm proposed in literature [13], the total processing time of product P is 265, and its scheduling Gantt chart is shown in Figure 10. Meanwhile, according to the algorithm proposed in this paper, the scheduling process of product P is shown in Table 1, and the total processing time of product P is 260, and the nal product P scheduling Gantt chart is shown in Figure 11.…”

“…Zhang et al [13] proposes a multiple-devices-process integrated scheduling algorithm with timeselective strategy for process sequence. Based on [13], this algorithm proposes a Multi-device adjacent parallel process interchange strategy and a multidevice adjacent parallel process interchange adjustment strategy. These two strategies provide solutions to the problem in [13] of ignoring the in uence of the pre-processing process on the post-processing process, which leads to poor tightness between serial processes and poor parallelism between parallel processes, and further optimize the scheduling results.…”

“…The scheduling results of the algorithm can be optimized by exibly handling the scheduling sequence between parallel processes of the same device. Based on [13], it is proposed to apply the multi-device adjacent parallel process interchange strategy and the multi-device adjacent parallel process interchange adjustment strategy.They avoid the in uence of the pre-processing process on the post-processing process, improve the tightness of the serial processing procedure and the parallelism of the parallel processing procedure, so as to shorten the processing time of products.…”