| 一个具有两类工件的多目标排序的多项式时间算法 |
| |
| 引用本文： | 冯琪,原晋江.一个具有两类工件的多目标排序的多项式时间算法[J].运筹与管理,2007,16(3):52-55. |
| |
| 作者姓名： | 冯琪 原晋江 |
| |
| 作者单位： | 1. 中原工学院,理学院,河南,郑州,450007
2. 郑州大学,数学系,河南,郑州,450052 |
| |
| 摘 要： | 本文考虑具有两个工件集的单机排序问题.第一个工件集J1以完工时间和为目标函数,第二个工件集J2以最大加权完工时间为目标函数.问题的目标是寻找一种排序,使得两个目标函数的加权和达到最小.本文证明该问题可在O(n1n2(n1 n2))时间内求解.
|
| 关 键 词： | 运筹学 排序 多目标 多项式时间算法 |
| 文章编号： | 1007-3221(2007)03-0052-04 |
| 修稿时间： | 2006年12月23 |
The Polynomial Time Algorithm of a Multicriteria Scheduling on Two Families of Jobs |
| |
| FENG Qi,YUAN Jin-jiang.The Polynomial Time Algorithm of a Multicriteria Scheduling on Two Families of Jobs[J].Operations Research and Management Science,2007,16(3):52-55. |
| |
| Authors: | FENG Qi YUAN Jin-jiang |
| |
| Abstract: | We consider a single-machine scheduling problem having two families of jobs.The first family J1 has the total completion time as its objective function,and the second gamily J2 has the maximum weighted completion time as its objective function.The goal of the problem is to seek a schedule so as to minimize the total weighted objective function of two criteria.We show in this paper that the problem can be solved in O(n1n2(n1 n2))time. |
| |
| Keywords: | operation research scheduling multicriteria polynomial time algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
