{"title":"Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan","authors":"Cheng He, Jing Wu, Hao Lin","doi":"10.1016/j.disopt.2022.100698","DOIUrl":null,"url":null,"abstract":"<div><p>This paper considers the bounded parallel-batching scheduling with two agents to minimize maximum cost of agent <span><math><mi>A</mi></math></span> and makespan of agent <span><math><mi>B</mi></math></span> simultaneously, in which all jobs of agent <span><math><mi>A</mi></math></span><span> 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.</span></p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":"45 ","pages":"Article 100698"},"PeriodicalIF":0.9000,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Optimization","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1572528622000123","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 5
Abstract
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.
期刊介绍：
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
