Timed Event Graph-based Scheduling for Cyclic Permutation Flow Shop

The cyclic permutation flow shop is one flow shop that repetitively produces product mix under permutation schedules. We propose that the cyclic permutation flow shop given the general job sequence can be modeled as a time event graph, based on which the mixed-integer programming method is applied to find the optimal schedule with maximum throughput. Two cases of cyclic permutation flow shops with different buffer capacity (i.e., with buffer and without intermediate buffer) are discussed respectively.