Time‐selective integrated scheduling algorithm with backtracking adaptation strategy

Abstract

Currently, integrated scheduling algorithms schedule processes using fixed rules, making it difficult to balance serial and parallel processes in product craftsmanship trees while conducting complicated single product scheduling. To solve this problem, we propose a time‐selective integrated scheduling algorithm with a backtracking adaptation (TISAWBA) strategy. The proposed process sequence sorting strategy aims to determine process scheduling sequences based on the overall structure of the machining craftsmanship tree. The proposed time‐selective scheduling strategy aims to select the process portfolio with the minimum total elapsed time for machining from a process portfolio set based on craftsmanship tree structure. The proposed backtracking adaptation strategy conducts backtracking adaptation to find process portfolios having a total elapsed machining time greater than the “scheduling reference time.” Finally, illustrative use cases verify that TISAWBA guarantees parallel processing for parallel processes and elevates the proximity of serial processes, generating optimized integrated scheduling results.

Integrated Scheduling Algorithm For Complex Products Based On The Dynamic Subtree Operation Set Inverse Coding

“…In the first type of algorithm, the authors [12] have conducted in-depth research on this problem and proposed a series of rule-based heuristic algorithms. For example, for the general integrated scheduling problem, the authors [13] propose a time-selective integrated scheduling algorithm with backtracking adaptation strategy, and the authors [14] propose an integrated scheduling algorithm based on event-driven by machines' idle. Aiming at the multi-shop integrated scheduling problem, the authors [15] propose an integrated scheduling algorithm of two workshops based on the principle of the neighborhood rendering, the authors [16] propose an integrated scheduling algorithm of two workshops based on optimal time, and the authors [17] propose a reversal sequence integrated scheduling algorithm of multiple workshop with multi-procedures ended together.…”

Flexible integrated scheduling algorithm based on remaining work probability selection coding

“…Based on the proposed processing operation tree model, a series of rule-based integrated scheduling algorithms are proposed. And currently, it has solved the general integrated scheduling problem (Xie et al, 2017;Zhang, Xie, et al, 2019), the integrated scheduling problem with special processing constraints (Xie et al, 2013;Xie, Qi, & Yang, 2014), the distributed integrated scheduling problem (Xie et al, 2016(Xie et al, , 2018 and so on. For the problem of flexible integrated scheduling, which neglects the machine-independent delay constraints between operations, Xie, Shao, and Yang (2011) propose an algorithm for integrated flexible scheduling with device-independence deferred constraint.…”