Abstract
The job shop scheduling problem (JSP) is a critical issue in modern manufacturing. An effective scheduling scheme can not only improve workshop production efficiency but also reduce production costs. For the Job Shop Scheduling Problem, a job shop scheduling model based on fuzzy induction strategy and balanced search mechanism (FIBS-JSP) is proposed in this paper. Firstly, a fuzzy suboptimal search algorithm (FSS) is proposed, which employs a fuzzy induction strategy to enhance the diversity of scheduling paths and designs a look-ahead evaluation scheme to evaluate and filter candidate paths, effectively avoiding the problem where early decision errors lead to poor subsequent scheduling performance. Secondly, a balanced tabu search algorithm based on an enhanced neighborhood structure (BTSA) is proposed, which incorporates an enhanced neighborhood structure that can effectively utilize constraint information of operations outside the critical block for scheduling, thereby improving the search depth of the algorithm. On this basis, a balanced search mechanism is introduced to alleviate the problem of easily falling into local optima during the search process, thereby enhancing scheduling performance. Experimental results show that FSSnet achieves an average scheduling score of 86.21% and performs better than CP_SAT on the larger-size groups, while the complete FIBS-JSP model finds the optimal solution on 42 of 43 benchmark instances.