An efficient critical path based method for permutation flow shop scheduling problem

Abstract

The permutation flow shop scheduling problem (PFSP) is one of the most important and typical scheduling types in the mass customization production and is also a well-known NP-hard problem. However, most of the reported algorithms lack the theoretical guidance to achieve the good accuracy and efficiency. To solve this problem, this paper proposes an efficient search method based on critical path with three theorems for the PFSP. Firstly, the concept of critical path and key points are defined according to the characteristics of the PFSP. On this basis, three theorems with the corresponding proofs are presented. Then, combined with above three theorems, a new neighborhood search method for the PFSP is developed. In each neighborhood search, only the first and last jobs in the processing sequence and the first job of each machine on the critical path need to be computed. No matter how large the scale of the problem is, this method only needs to search at most (2 m+2) times to find the optimal neighborhood solution (m is the number of machines). Finally, the new neighborhood search method is combined with an improved simulated annealing algorithm to solve the PFSP. To verify the performance of the proposed algorithm, this paper implement a set of comparative experiments with the-state-of-art methods on the part of the TA benchmark. By the proposed method, some significant improvements are obtained according to the experimental results. Meanwhile, under the same algorithm framework, the proposed method can reduce the 35.2% average computation time. Especially, the best-known upper bound of TA116 is updated from 26477 to 26469 by the proposed algorithm.