Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan

IF 0.9 4区数学 Q3 MATHEMATICS, APPLIED

Discrete Optimization Pub Date : 2022-08-01 DOI:10.1016/j.disopt.2022.100698

Cheng He, Jing Wu, Hao Lin

引用次数: 5

Abstract

This paper considers the bounded parallel-batching scheduling with two agents to minimize maximum cost of agent $A$ and makespan of agent $B$ simultaneously, in which all jobs of agent $A$ have equal processing time, the jobs from different agents can be processed in a common batch and the cost function of each agent is only determined by its own jobs. In the paper, we present a polynomial-time algorithm to generate all Pareto optimal points for the problem and determine a corresponding Pareto optimal schedule for each Pareto optimal point.

查看原文本刊更多论文

最小化最大成本和完工时间的双智能体有界并行批处理调度

考虑两个智能体的有界并行批处理调度，以同时最小化智能体A的最大成本和智能体B的最大完工时间，其中智能体A的所有作业的处理时间相等，不同智能体的作业可以在一个共同的批处理中处理，每个智能体的成本函数仅由其自己的作业决定。本文给出了一种多项式时间算法来生成该问题的所有Pareto最优点，并为每个Pareto最优点确定相应的Pareto最优调度。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Discrete Optimization 管理科学-应用数学

CiteScore

2.10

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.