Time complexity of finding chain decomposition of partially ordered set
You may find the following recent reference useful:
M. Caceres, M. Cairo, B. Mumey, R.  Rizzi, and A. Tomescu. On the parameterized complexity of the Minimum Path Cover problem in DAGs.
arXiv preprint arXiv:2007.07575