TWO MACHINES FLOW SHOP WITH REENTRANCE AND EXACT TIME LAG

摘要

This paper considers a reentrant flow shop with two machines and exact time lag L, in which each task may be processed in this order M1, M2, M1 and there is an identical time lag between the completion time of the first operation and the start time of the second operation on the first machine. The objective is to minimize the total completion time. We prove the NP-hardness of a special case and we give some special subproblems that can be solved in polynomial time.