Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective

•We consider and review different representations, sequencing rules, and assignment rules.•We analyse the structure of the solution space by using complete enumeration.•We present 4 MILPs to model the different solution representations.•We compare 22 different approaches in two extensive sets of instances.