In this note, we point out that the dynamic programming algorithms for the proportionate flowshop scheduling problems presented by Mor et al. (J Sched 23:61-641, 2020) are incorrect by counterexamples. Moreover, we propose new dynamic programming algorithms to solve the corresponding problems.