Abstract
Although the critical path method (CPM) is effective for the integrated scheduling of small-batch orders, its overemphasis on vertical process relationships and neglect of horizontal parallel relationships have imposed limitations on scheduling, often leading to suboptimal outcomes in terms of the total product completion time. This study introduces an innovative algorithm designed to overcome these limitations and further optimize the total processing time of products. We propose a strategy of "exchanging adjacent processes on the same device", which operates based on the scheduling results of the CPM. By swapping adjacent and interchangeable processes within the constraints of the problem, this algorithm generates multiple new scheduling schemes, effectively expanding the solution space. This expansion enables the discovery of optimized solutions that leverage "horizontal parallel relationships", which is crucial for reducing the "total processing time of products". Finally, the effectiveness of the proposed algorithm is verified through experiments.