同时最小化最大费用和最大完工时间的双代理无界平行分批排序

Two-agent scheduling on an unbounded parallel-batching machine to minimize maximum cost and makespan

有两个代理A和B,每个代理都各自有一个工件集.同一个代理的工件可以在同一批中加工,而且每一个代理都有一个需要最小化的函数.研究在无界平行分批处理机上同时最小化代理A的最大费用和代理B的最大完工时间问题,并给出一个算法,它可在多项式时间内找到关于这个问题的所有Pareto最优点.

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.