The k-opt algorithm analysis. The flexible job shop case

Abstract

In the work there is considered an NP-hard flexible job shop problem. Its solution lies in allocation of operations to machines and determination of the sequence of their execution. There is also a method of construction of approximate algorithms presented, based on the idea of descent search, determining the allocation of operations. What is more, there were computational experiments conducted to investigate the correlation between the size of the neighborhood and the quality of solutions determined by the algorithm.