Dynamic job sequencing in two parallel two-machine flow shop

In this paper, the case where there are two parallel two-machine flow-shops available to process jobs is considered. We developed a method that creates sequences intended to dynamically minimize the makespan while jobs are added overtime. The solution procedure developed in this research is demonstrated using an illustrative example. The results revealed the effectiveness of the proposed approach for solving dynamic sequencing problem with two parallel two-machine flow-shops.