一类双目标容量扩充的最优排序问题(英文)

A KIND OF THE OPTIMAL PROBLEMS OF SEQUENCING FOR CAPACITY EXPANSION UNDER THE DOUBLE-OBJECTIVE

本文提出了双目标最优排序模型,给出了两个结论:(1)当投入顺序确定时,工程投入时间最优的一个充分必要条件;(2)可生成劣序之子序充分条件.在第2个结论的基础上,提出了多目标动态规划向量优化直接算法.最后,研究了一个实例,说明本文提出的方法的应用及其有效性.

Through a brief review, the limitations to optimize single-objective sequencing are pointed out in this paper. We develop an optimal capacity expansion sequencing models under double-objective and draw two main conclusions. The first is optimal necessary and sufficient condition on the time of one project constructed if the sequence of the project put into operation has been determined; The second is a sufficient condition proved here under which subpolicy would produce a set of inferior policies. Based on the second, a direct method of vector optimization for multiobjective dynamic programming is presented.Finally, the application and the efficiency of the method in our paper is illustrated by a real example in which the AHP is used to produce the optimal trade-off policy from the set of noninferior polices.