Analysis of a Preference Order Assembly Line Problem
分析了文献中提出的偏好顺序动态规划方法在随机装配线平衡问题中的应用，指出该方法通常不满足单调性条件，无法保证最优解，并说明在特定问题类别中可转化为标准动态规划模型。
An analysis is made of a preference order dynamic programming procedure proposed in the literature for stochastic assembly line balancing problems. It is shown that in general the procedure does not satisfy the monotonicity condition and that therefore there is no guarantee that the solutions will be optimal. It is also shown that for a certain class of problems for which the procedure does yield optimal solutions, the proposed preference order model can be reformulated as a regular dynamic programming model.