Flow-shop scheduling with flexible processors

We consider a permutation flow-shop where one or more processors is flexible. Two integer programming models are developed; one is for the case where the job sequence is given and the other is for the case where the job sequence is to be determined. In the former case, a heuristic is also developed to solve large-sized problems. Computational results of the heuristic are presented.