Unboundedness of irreducible decompositions of numerical semigroups

We present two families of numerical semigroups and show that for each family, the number of required components in an irreducible decomposition cannot be bounded by any given integer. This gives a negative answer to a question raised by Delgado, García-Sánchez and Rosales.