Tabu search based on novel neighborhood structures for solving job shop scheduling problem integrating finite transportation resources

As advancements in transportation equipment intelligence continue, the job shop scheduling problem integrating finite transportation resources (JSPIFTR) has attracted considerable attention. Within the domain of shop scheduling, the neighborhood structure serves as a cornerstone for enabling intelligent optimization algorithms to effectively navigate and discover optimal solutions. However, current algorithms for JSPIFTR rely on generalized neighborhood structures, which incorporate operators like insertion and swap. While these structures are tailored to the encoding vectors, their utilization often leads to suboptimal optimization efficacy. To address this limitation, this paper introduces novel neighborhood structures specifically designed to the distinctive properties of JSPIFTR. These innovative structures leverage the intrinsic structural information in integrated scheduling, thereby enhancing the optimization effectiveness of the algorithm. Firstly, two theorems are presented to demonstrate the feasibility of the neighborhood solution. Secondly, different neighborhood structures for critical transportation and processing tasks are subsequently designed based on the analysis of the problem properties and constraints. Thirdly, an efficient fast evaluation method is developed to expediently calculate the objective value of the neighborhood solution. Finally, the novel neighborhood structures are combined with the tabu search (TS_NNS) and compared with other state-of-the-art methods on EX and NEX benchmarks. The comparative results demonstrate the remarkable performance of the neighborhood structure, with the TS_NNS enhancing the best solutions across 23 instances.