The shuffle operation has been extensively studied in formal language theory. Regular expressions with shuffle provide succinct representations for modelling concurrent systems. However, even for regular languages, shuffle is hard: membership is NP-complete, inequivalence is EXP-complete, the conversion to NFAs is in the worst-case exponential, and the conversion to DFAs is double exponential. There are also numerous open problems, such as establishing tight bounds for state complexity even for the shuffle of two words. Standard shuffle models the pure interleaving of two concurrent systems. To model synchronisation, and inspired in the Team Automata framework, synchronised shuffle operators allow us to specify symbols on which the operands must or can synchronise instead of interleave. Intersection is thus an extreme case of synchronisation. We consider conversions of regular expressions with several generalised synchronised shuffle operators to NFAs, as well as studying some asymptotic average complexities.