运筹学学报 >
2018 , Vol. 22 >Issue 3: 109 - 116
DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2018.03.011
同时最小化最大费用和最大完工时间的双代理无界平行分批排序
收稿日期: 2017-01-19
网络出版日期: 2018-09-15
基金资助
国家自然科学基金(No. 11201121), 河南省科技厅基础前沿基金(No.162300410221)
Two-agent scheduling on an unbounded parallel-batching machine to minimize maximum cost and makespan
Received date: 2017-01-19
Online published: 2018-09-15
有两个代理A和B, 每个代理都各自有一个工件集. 同一个代理的工件可以在同一批中加工, 而且每一个代理都有一个需要最小化的函数. 研究在无界平行分批处理机上同时最小化代理A的最大费用和代理B的最大完工时间问题, 并给出一个算法, 它可在多项式时间内找到关于这个问题的所有Pareto最优点.
关键词： 双代理排序; 分批处理机; 最大费用; Pareto 最优解; 计算复杂性
何程, 韩鑫鑫 . 同时最小化最大费用和最大完工时间的双代理无界平行分批排序[J]. 运筹学学报, 2018 , 22(3) : 109 -116 . DOI: 10.15960/j.cnki.issn.1007-6093.2018.03.011
There are two agents A and B with each having their own job sets. The jobs of a common agent can be processed in a common batch. Moreover, each agent has an objective function to be minimized. This paper studies the two-agent scheduling problem on an unbounded parallel-batching machine to minimize maximum cost of agent A and makespan of agent B simultaneously. We present a polynomial-time algorithm for finding all Pareto optimal points of the problem.
/
| 〈 |
|
〉 |
