Cyclic flow shop scheduling based on timed event graph extended with disjunctive constraints

The cyclic flow shop is one flow shop that repetitively produces the product mix. We propose that the cyclic flow shops can be modeled as time event graphs extended with disjunctive constraints. Based on the timed event graph models, mixed-integer programs are established to find the optimal schedule under with the system functions with the minimal cycle time. Three different cases of cyclic flow shops are discussed respectively.