|Intent||A set of jobs is to be processed on a set of machines. There is a fixed number of stages and each job needs to be processed in each of the stages exactly once in a predetermined order, which is the same for all jobs. In each stage there are some number of identical machines that can process the job at this stage. Each machine can only ever process one job at a time.|
|Motivation||Flexible flow shop machine environments regularly occur in manufacturing.|
|Applicability||Necessary conditions: Elementary Scheduling Problem|
Sufficient conditions: The necessary conditions and let be a job in the event log. For all and all :
(a) Every job is processed on every machine at most once, so for all such that : .
(b) Every job consists of the same number of operations, so .
(c) Each machine belongs to exactly one stage and the order through the stages is the same for all jobs, so for all where we have
|Participants||A set of jobs consisting of operations, and a set of machines partitioned into stages.|
|Collaborations||The machines are partitioned into stages. Each job has to be processed on one machine of each stage exactly once in a predetermined order of the stages, which is the same across all jobs.|
|Diagram||Gantt chart showing four jobs being processed in three stages, where machines 1 and 2 belong to stage 1, machine 3 belongs to stage 2 and machines 4 and 5 belong to stage 3.|
|Consequences||Each operation belongs to a fixed and pedermined stage and can be processed on any of the (identical) machines belonging to this stage. Each job visits each stage exactly once and the order in which stages are visited by jobs is the same for all jobs.|
|Modelling variants||(1) OPL for Cplex CP Download|
(2) MiniZinc Download
|Forces||Elementary Scheduling Pattern|
|Enables||Flow Shop Pattern, Permutation Pattern, 1-Blocking Pattern|
|Compatible with||No Wait Pattern, Machine Setup Pattern, Distinguishable Resources Pattern, Indistinguishable Resources Pattern|