  An edge-colouring is {\em strong} if every colour class is an induced
matching. In this work we give a formulae that determines either the optimal or
the optimal plus one strong chromatic index of bipartite outerplanar graphs.
Further, we give an improved upper bound for any outerplanar graph which is
close to optimal. All our proofs yield efficient algorithms to construct such
colourings.
