user

Serial-batching scheduling with two agents to minimize makespan and maximum cost

被引：13
|
作者：
He, Cheng [1 ]
Xu, Chunqi [2 ]
Lin, Hao [1 ]
机构：
[1] Henan Univ Technol, Sch Sci, Zhengzhou 450001, Henan, Peoples R China
[2] China Univ Geosci Beijing, Sch Econ & Management, Beijing 100083, Peoples R China
来源：
JOURNAL OF SCHEDULING | 2020年 / 23卷 / 05期
关键词：
Two-agent scheduling; Serial-batching; Makespan; Maximum cost; Maximum lateness; SINGLE-MACHINE;
D O I：
10.1007/s10951-020-00656-5
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper considers three serial-batching scheduling problems with two agents to minimize the makespan of agent A and maximum cost (or maximum lateness) of agent B simultaneously. In these two-agent scheduling problems, jobs of different agents cannot be processed in a common batch, and the cost function of an agent depends only on its jobs. For each problem, we present a polynomial-time algorithm which can find all Pareto optimal solutions.
引用
收藏
页码：609 / 617
页数：9
相关论文
共 50 条
  • [1] Serial-batching scheduling with two agents to minimize makespan and maximum cost
    Cheng He
    Chunqi Xu
    Hao Lin
    [J]. Journal of Scheduling, 2020, 23 : 609 - 617
  • [2] Bounded serial-batching scheduling for minimizing maximum lateness and makespan
    He, Cheng
    Lin, Hao
    Lin, Yixun
    [J]. DISCRETE OPTIMIZATION, 2015, 16 : 70 - 75
  • [3] Pareto optimization of serial-batching scheduling problems on two agents
    Department of Mathematics, Zhengzhou University, Zhengzhou 450001, China
    不详
    [J]. Int. Conf. Adv. Mechatronic Syst., ICAMechS - Final Program, 2011, (165-168):
  • [4] Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
    He, Cheng
    Li, Shi-Sheng
    Wu, Jing
    [J]. RAIRO-OPERATIONS RESEARCH, 2021, 55 (06) : 3701 - 3714
  • [5] Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
    He, Cheng
    Lin, Hao
    Lin, Yixun
    Tian, Ji
    [J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2013, 21 (01) : 177 - 186
  • [6] Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
    Cheng He
    Hao Lin
    Yixun Lin
    Ji Tian
    [J]. Central European Journal of Operations Research, 2013, 21 : 177 - 186
  • [7] An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
    He, Cheng
    Wu, Jing
    Xu, Jinglei
    Wang, Junling
    [J]. RAIRO-OPERATIONS RESEARCH, 2023, 57 (02) : 731 - 741
  • [8] Serial-batching scheduling problem to minimize total weighted completion time
    Tian, Le
    Zhao, Chuan-Li
    [J]. Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2007, 29 (11): : 1883 - 1885
  • [9] Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
    He, Cheng
    Lin, Yixun
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 234 - 240
  • [10] BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
    He, Cheng
    Lin, Hao
    Yuan, Jinjiang
    Mu, Yundong
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2014, 31 (04)
12345