We show that the combination of dynamic programming with partial-order decomposition algorithms enables us to solve sequencing problems in polynomial time for substantially larger classes of ...