No abstract

No abstract

No abstract

In this paper, a hybrid method is proposed to generate feasible neighbors for the flexible job shop scheduling problem. Many of the optimization and artificial intelligence methods have been used to solve this important and NP-hard combinatorial problem which provide the basis for solving real-life problems. It is well-known that for such problems the hybrid methods obtain better results than the other approaches. For instance, the applied non-hybrid neural networks for the combinatorial problems, as the Hopfield neural network, usually converge early. Also, their results almost always contain large gaps. These shortcomings prevent them to find good results. Another necessity for a quality search is to find suitable neighbors of the obtained solutions, however, it is possible to create infeasible neighbors during the optimization process. The aim of this study is to overcome these deficiencies. In the suggested approach, at first, an initial solution is generated and then using the left shift heuristics, its gaps are removed. Based on the critical path and critical block concepts, 6 neighbors are constructed for the obtained solution. After the generation of each neighbor, a neural network runs and controls the constraints of the problem. If the achieved neighbor is feasible it is saved. Else if it is infeasible, the neural network tries to transform it into a feasible solution. This is done by applying penalties to the start time of the operations on the violated constraints, which shifts them to the right or the left. During this process, if there are not any violated constraints, the neural network reaches the stable condition so it stops and the obtained solution is saved as a feasible neighbor. Otherwise, after a certain number of the iterations, it stops without any feasible neighbors. Then these steps are repeated for the other created neighbors. This constraint-based process provides an effective and diverse search. Finally, the obtained neighbors, are improved using the left shift heuristics. Also to demonstrate the importance of the initial solutions, they are generated randomly and also using the Giffler and Thompson's heuristic. The comparison between the proposed approach and the methods from the literature shows that it constructs better neighbors. However, using the Giffler and Thompson heuristic to create the initial solution improves the results significantly.

No abstract