A new heuristic method combined with Lagrangian relaxation algorithm for Hybrid flow shop problem

In this paper, a heuristic algorithm which embedded in the Lagrangian relaxation algorithm is proposed to obtain the near optimal solution to minimize the total weighted complete time in the Hybrid flow shop problem (HFS). Compared with the original precedence capacity relaxation algorithm proposed by Tang et al., our algorithm can produce a better solution in most cases.