An upper bound for the inter-exit time of two jobs in an m-machine flow shop

Abstract This paper addresses the class of permutation flow shop scheduling where jobs, after their completion, must be grouped in batches. This is a common scheme in industrial environments, where products undergo multiple process steps in different shops and, when completed, must be transported to customers or the next production step. A new optimisation criterion is used, the inter-exit time , i.e., the difference between the completion times of two jobs. An upper bound is proposed and demonstrated for a general permutation flow shop with m machines.