Solving scheduling problems for a non-permutation assembly flow shop

摘要

A non-permutation two-stage flow shop scheduling problem is addressed in this paper. The first stage is composed of multiple factories, where each factory is a non-permutation flow shop that produces jobs. The second stage has only one assembly machine. A mixed integer programming model is formulated, aiming at minimization of total completion time. A dynamic programming algorithm is proposed to solve this problem. The numerical experiments were conducted to validate the proposed methods; and the comparable results demonstrate that it is more efficient and effective than CPLEX.