当前位置:
X-MOL 学术
›
Discret. Optim.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
Discrete Optimization ( IF 1.1 ) Pub Date : 2022-03-19 , DOI: 10.1016/j.disopt.2022.100698 Cheng He 1 , Jing Wu 1 , Hao Lin 1
中文翻译:
用于最小化最大成本和制造时间的两个代理有界并行批处理调度
更新日期:2022-03-19
Discrete Optimization ( IF 1.1 ) Pub Date : 2022-03-19 , DOI: 10.1016/j.disopt.2022.100698 Cheng He 1 , Jing Wu 1 , Hao Lin 1
Affiliation
This paper considers the bounded parallel-batching scheduling with two agents to minimize maximum cost of agent and makespan of agent simultaneously, in which all jobs of agent 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.
中文翻译:
用于最小化最大成本和制造时间的两个代理有界并行批处理调度
本文考虑使用两个代理的有界并行批处理调度,以最小化代理的最大成本和代理的制造时间同时,代理的所有工作具有相同的处理时间,来自不同代理的作业可以在一个共同的批次中处理,并且每个代理的成本函数仅由其自己的作业确定。在本文中,我们提出了一种多项式时间算法来生成问题的所有帕累托最优点,并为每个帕累托最优点确定相应的帕累托最优调度。